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 Sadrzadeh, University College London Jonathan Sterling, Aarhus University Todd Trimble, Western Connecticut State University Christina Vasilakopoulou, University of Patras Greece Maaike Zwart, IT University of Copenhagen 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 serge.autexier at dfki.de Fri Apr 22 10:01:19 2022 From: serge.autexier at dfki.de (Serge Autexier) Date: Fri, 22 Apr 2022 16:01:19 +0200 (CEST) Subject: [TYPES/announce] CICM 2022, 15th Conf. Intelligent Computer Mathematics, Hybrid Event, Invited Speakers update & Second Call for Papers Message-ID: <20220422140119.0A7194FCEDA4@gigondas.localdomain> *** Apologies for cross postings *** [Abstract Submission: May 9, 2022 / Doctoral programme: July 15, 2022] Second Call for Papers formal papers - informal papers - doctoral programme 15th Conference on Intelligent Computer Mathematics - CICM 2022 - September 19-23, 2022 Tbilisi, Georgia (hybrid event) https://urldefense.com/v3/__http://www.cicm-conference.org/2022__;!!IBzWLUs!HPg5TeltY65GOw8HOQsz3KNyLrq_hkT0WgOvz9vFcJrbOxvTOWgTPftUuudMwiI5tHUi4BbjCNjSZw$ ---------------------------------------------------------------------- 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: * Erika Abraham (RWTH Aachen University) * Deyan Ginev (FAU Erlangen-N?rnberg and NIST) * S?bastien Gou?zel (IRMAR, Universit? de Rennes 1) CICM 2022 Programme committee: see https://urldefense.com/v3/__https://www.cicm-conference.org/2022/cicm.php?event=&menu=pc__;!!IBzWLUs!HPg5TeltY65GOw8HOQsz3KNyLrq_hkT0WgOvz9vFcJrbOxvTOWgTPftUuudMwiI5tHUi4BaEox-a2Q$ 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!HPg5TeltY65GOw8HOQsz3KNyLrq_hkT0WgOvz9vFcJrbOxvTOWgTPftUuudMwiI5tHUi4BbZAHi0Yw$ 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!HPg5TeltY65GOw8HOQsz3KNyLrq_hkT0WgOvz9vFcJrbOxvTOWgTPftUuudMwiI5tHUi4BYdZA2jKQ$ From kyrozier at iastate.edu Sat Apr 23 21:26:15 2022 From: kyrozier at iastate.edu (Kristin Yvonne Rozier) Date: Sat, 23 Apr 2022 20:26:15 -0500 Subject: [TYPES/announce] Call for Presentations: VardiFest22 Message-ID: ============================================================ ?VardiFest22: On the Not So Unusual Effectiveness of Logic ?????????? (a collection of ~12-minute talks) ????? Technion, Haifa, Israel (co-located with FLoC) ?????????????????? July 31-August 1, 2022 https://urldefense.com/v3/__https://vardifest.github.io/__;!!IBzWLUs!WHJWWDhiUjEnI-fRwjOIt7BpXQ2dd04RJIolAL-z1MH9aKrBk3dsXfnJS9r4cZjOIPa8JcPMxffsNCNZFcu6PAPaXOpTiedwaNc$ ============================================================ VardiFest is a FLoC-22 workshop in honor of Moshe Y. Vardi and is intended to celebrate Vardi's pioneering contributions that have enhanced logic's centrality in computer science. The workshop will be organized in a Highlights conference style: i.e., composed of short talks and invited talks. This is a call for short talks (expected to be ~12 minutes). The proposal should be at most one page PDF in Easychair class style (https://urldefense.com/v3/__https://easychair.org/publications/for_authors__;!!IBzWLUs!WHJWWDhiUjEnI-fRwjOIt7BpXQ2dd04RJIolAL-z1MH9aKrBk3dsXfnJS9r4cZjOIPa8JcPMxffsNCNZFcu6PAPaXOpT4WQDTSQ$ ). Given the depth and breadth of Vardi's contributions that span across multiple fields of computer science and society at large, there is no definite list of topics of interest. We encourage you to present a proposal for a talk that would be of interest to Vardi be it published or not, technical or non-technical, retrospective or crystal-ball gazing. While we may allow some remote presentations, strong preference will be given to in-person presentations. ==================== DATES: ==================== Deadline for Submission: May 15, 2022 AoE Notification of Acceptance: May 19, 2022 AoE Submission Site: https://urldefense.com/v3/__https://easychair.org/conferences/?conf=vardifest22__;!!IBzWLUs!WHJWWDhiUjEnI-fRwjOIt7BpXQ2dd04RJIolAL-z1MH9aKrBk3dsXfnJS9r4cZjOIPa8JcPMxffsNCNZFcu6PAPaXOpTkfIVJzs$ ==================== ORGANIZERS: ==================== Giuseppe De Giacomo (Sapienza Univ. Rome, Italy) Kuldeep S. Meel (National University of Singapore) Kristin Yvonne Rozier (Iowa State University, Ames, Iowa) View this Call in EasyChair: https://urldefense.com/v3/__https://easychair.org/cfp/vardifest22__;!!IBzWLUs!WHJWWDhiUjEnI-fRwjOIt7BpXQ2dd04RJIolAL-z1MH9aKrBk3dsXfnJS9r4cZjOIPa8JcPMxffsNCNZFcu6PAPaXOpTCM_eKEk$ -- ____________________________________________________________ __ /\ \ \_____ / \ ###[==_____> / \ /_/ __ / __ \ \ \_____ | ( ) | ###[==_____> /| /\/\ |\ /_/ / | | | | \ / |=|==|=| \ 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 !!! !!! laboratory.temporallogic.org -------------- next part -------------- An HTML attachment was scrubbed... URL: From willem.heijltjes at gmail.com Mon Apr 25 10:05:52 2022 From: willem.heijltjes at gmail.com (Willem Heijltjes) Date: Mon, 25 Apr 2022 15:05:52 +0100 Subject: [TYPES/announce] PhD positions in Mathematical Foundations of Computer Science, Bath - deadline 16 May Message-ID: We are recruiting for 2 PhD positions Funding: Competition funded Deadline: Monday 16 May 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/research-groups/mathematical-foundations-of-computation/__;!!IBzWLUs!XU1FULh3w8KnDha7nWYXGf08MMM-71LNQcr-DhHrrtz91Y-SmzHGanKIhGuuxHC_bJazbpZcrv3lyvF9aETm7DJjIsEQSPM20Nectr4_$ Please see at the end of this email for a list of projects and supervisors. ===== How to apply ===== To apply, please complete the following online form: https://urldefense.com/v3/__https://samis.bath.ac.uk/urd/sits.urd/run/siw_ipp_lgn.login?process=siw_ipp_app&code1=RDUCM-FP01&code2=0016__;!!IBzWLUs!XU1FULh3w8KnDha7nWYXGf08MMM-71LNQcr-DhHrrtz91Y-SmzHGanKIhGuuxHC_bJazbpZcrv3lyvF9aETm7DJjIsEQSPM20MasVTIB$ 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!XU1FULh3w8KnDha7nWYXGf08MMM-71LNQcr-DhHrrtz91Y-SmzHGanKIhGuuxHC_bJazbpZcrv3lyvF9aETm7DJjIsEQSPM20Lx3hym9$ 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!XU1FULh3w8KnDha7nWYXGf08MMM-71LNQcr-DhHrrtz91Y-SmzHGanKIhGuuxHC_bJazbpZcrv3lyvF9aETm7DJjIsEQSPM20BOBjs4C$ James Davenport | J.H.Davenport at bath.ac.uk | https://urldefense.com/v3/__http://people.bath.ac.uk/masjhd/__;!!IBzWLUs!XU1FULh3w8KnDha7nWYXGf08MMM-71LNQcr-DhHrrtz91Y-SmzHGanKIhGuuxHC_bJazbpZcrv3lyvF9aETm7DJjIsEQSPM20Akrtr7S$ Tom Powell | trjp20 at bath.ac.uk | https://urldefense.com/v3/__http://t-powell.github.io__;!!IBzWLUs!XU1FULh3w8KnDha7nWYXGf08MMM-71LNQcr-DhHrrtz91Y-SmzHGanKIhGuuxHC_bJazbpZcrv3lyvF9aETm7DJjIsEQSPM20EvuXGzT$ 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!XU1FULh3w8KnDha7nWYXGf08MMM-71LNQcr-DhHrrtz91Y-SmzHGanKIhGuuxHC_bJazbpZcrv3lyvF9aETm7DJjIsEQSPM20L4g0Znm$ ) 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!XU1FULh3w8KnDha7nWYXGf08MMM-71LNQcr-DhHrrtz91Y-SmzHGanKIhGuuxHC_bJazbpZcrv3lyvF9aETm7DJjIsEQSPM20MblPkkG$ 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!XU1FULh3w8KnDha7nWYXGf08MMM-71LNQcr-DhHrrtz91Y-SmzHGanKIhGuuxHC_bJazbpZcrv3lyvF9aETm7DJjIsEQSPM20NHgzHto$ 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!XU1FULh3w8KnDha7nWYXGf08MMM-71LNQcr-DhHrrtz91Y-SmzHGanKIhGuuxHC_bJazbpZcrv3lyvF9aETm7DJjIsEQSPM20IeoDZ4w$ 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!XU1FULh3w8KnDha7nWYXGf08MMM-71LNQcr-DhHrrtz91Y-SmzHGanKIhGuuxHC_bJazbpZcrv3lyvF9aETm7DJjIsEQSPM20O2KJGii$ 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!XU1FULh3w8KnDha7nWYXGf08MMM-71LNQcr-DhHrrtz91Y-SmzHGanKIhGuuxHC_bJazbpZcrv3lyvF9aETm7DJjIsEQSPM20EvuXGzT$ 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 serge.autexier at dfki.de Mon Apr 25 11:10:50 2022 From: serge.autexier at dfki.de (Serge Autexier) Date: Mon, 25 Apr 2022 17:10:50 +0200 (CEST) Subject: [TYPES/announce] CICM 2022, 15th Conf. Intelligent Computer Mathematics, Call for Workshop & Tutorial Proposals until July 8, 2022 Message-ID: <20220425151050.71DF250B6449@gigondas.localdomain> *** Apologies from cross postings *** Call for Workshop and Tutorial Proposals 15th Conference on Intelligent Computer Mathematics - CICM 2022 - September 19-23, 2022 Tbilisi, Georgia (hybrid event) https://urldefense.com/v3/__http://www.cicm-conference.org/2022__;!!IBzWLUs!SaZRHSHL_bKZZS4jpF7EaNp2K2MYRFnTp2RxHXQwJuG_tcZYqUfUNZQPmc3jVaXqpR85K1vKS2B_H21oOa0L7ppNTA-xVBpOG1v_p6bM$ ---------------------------------------------------------------------- The CICM conference brings together the many separate communities that have developed theoretical and practical solutions for mathematical applications. CICM will be held as a hybrid event (in person and online) and will provide associated events with appropriate infrastructure for supporting both kinds of participants. CICM covers * all aspects of mathematics such as formalization, computation, deduction, mathematical databases, and mathematical documents, * all kinds of tool support such as theorem provers, computer algebra systems, knowledge management tools, and user interfaces * the whole spectrum from theoretical foundations to practical tools and from challenge problems to case studies. Workshops typically feature presentations of ongoing research that is not ready yet for formal publication, and tutorials present extended demos of a particular software. However, the CICM organizers strongly encourage a broad interpretation of these concepts and welcome proposals for any kind of event that benefits the CICM community. A proposal should include the following information: * title of the event * names and affiliations of the organizers * brief description of the event (e.g., 1-2 paragraphs) * proposed workshop duration (typically half a day up to two days) * style (online-only, in person-only, hybrid) * previous instances of the event (if any) * preferred or excluded dates within the CICM dates (if any) CICM will take care of publishing and distributing informal proceedings of the workshop/tutorial events (if the respective organizers so with) via open access online proceedings with CEUR-WS.org. Important Dates =============== Proposals should be submitted by July 8, 2022. Earlier submissions are strongly encouraged, and notifications of acceptance will be issued on a rolling basis. All proposals should be submitted via https://urldefense.com/v3/__https://easychair.org/conferences/?conf=cicm2022__;!!IBzWLUs!SaZRHSHL_bKZZS4jpF7EaNp2K2MYRFnTp2RxHXQwJuG_tcZYqUfUNZQPmc3jVaXqpR85K1vKS2B_H21oOa0L7ppNTA-xVBpOG1V1rSDj$ More details on the conference are available from https://urldefense.com/v3/__http://www.cicm-conference.org/2022__;!!IBzWLUs!SaZRHSHL_bKZZS4jpF7EaNp2K2MYRFnTp2RxHXQwJuG_tcZYqUfUNZQPmc3jVaXqpR85K1vKS2B_H21oOa0L7ppNTA-xVBpOG1v_p6bM$ From ryukilon at gmail.com Mon Apr 25 11:55:08 2022 From: ryukilon at gmail.com (Taro Sekiyama) Date: Tue, 26 Apr 2022 00:55:08 +0900 Subject: [TYPES/announce] FLOPS 2022: the 16th International Symposium on Functional and Logic Programming: Call For Participation & Workshop talk proposals Message-ID: <797ed845-d664-a870-e69c-8d7ea8f17e05@gmail.com> ============================================================================ Call For Participation & Workshop talk proposals (extended) FLOPS 2022: 16th International Symposium on Functional and Logic Programming ============================================================================ In-Cooperation with ACM SIGPLAN May 10-12, 2022, Online Registration is open for FLOPS 2022. https://urldefense.com/v3/__https://conf.researchr.org/attending/flops-2022/registration__;!!IBzWLUs!Sacr-OqwHpZ6Hp6ULeD8zRNfQA0DaVuB5RjIQLtr_qRWkw_XCre_CwWqPP1aIEh50zBWmgBKVx4DOEXQEgrqXtI0d-5gbb0$ Deadlines for registration are: (Early) 27 April, 2022, 23:59 (UTC) (Late) 5 May, 2022, 23:59 (UTC) *** Call for talk proposals: AiDL 2022 *** An extra workshop, AiDL 2022 (Workshop on Advances in Declarative Languages), will be held in hybrid (online / physical) format in Kyoto, Japan. Venue: Hybrid (Online / RIMS, Kyoto University, Japan) Talk proposal deadline (extended): April 30, 2022 (AoE) Details: https://urldefense.com/v3/__https://conf.researchr.org/track/flops-2022/aidl-2022__;!!IBzWLUs!Sacr-OqwHpZ6Hp6ULeD8zRNfQA0DaVuB5RjIQLtr_qRWkw_XCre_CwWqPP1aIEh50zBWmgBKVx4DOEXQEgrqXtI0OsEiw5E$ *** Venue / Dates for the extra workshop *** This extra event will take place early afternoon (UTC+9), 10-12 May at the venue, RIMS - Research Institute for Mathematical Sciences, Kyoto University, Japan, without any interference with the main FLOPS conference slots, and remote participants are able to attend via Zoom. *** FLOPS 2022 Accepted Papers *** The list of FLOPS 2022 accepted papers is at https://urldefense.com/v3/__https://conf.researchr.org/track/flops-2022/flops-2022-papers*event-overview__;Iw!!IBzWLUs!Sacr-OqwHpZ6Hp6ULeD8zRNfQA0DaVuB5RjIQLtr_qRWkw_XCre_CwWqPP1aIEh50zBWmgBKVx4DOEXQEgrqXtI0-K3n91A$ *** FLOPS 2022 Invited Speakers *** Lindsey Kuper (University of California at Santa Cruz) Akimasa Morihata (University of Tokyo) Peter J. Stuckey (Monash University) *** FLOPS 2022 Program Committee *** Andreas Abel Gothenburg University, Sweden Elvira Albert Universidad Complutense de Madrid Nada Amin Harvard Universuty, USA Davide Ancona Univ. Genova, Italy William Byrd University of Alabama, USA Matteo Cimini UMass Lowell, USA Youyou Cong Tokyo Institute of Technology, Japan Robert Gl?ck University of Copenhagen, Denmark Makoto Hamana Gunma University, Japan Michael Hanus Kiel University (co-chair) Zhenjiang Hu Peking University, China Atsushi Igarashi Kyoto University, Japan (co-chair) Ekaterina Komendantskaya Heriot-Watt University, UK Shin-Cheng Mu Academia Sinica, Taiwan Koko Muroya Kyoto University, Japan Klaus Ostermann University of Tuebingen, Germany Ricardo Rocha University of Porto, Portugal Tom Schrijvers KU Leuven, Belgium Harald Sondergaard University of Melbourne, Australia Hiroshi Unno University of Tsukuba, Japan Niki Vazou IMDEA, Spain Janis Voigtlaender University of Duisburg-Essen, Germany Nicolas Wu Imperial College, UK Ningning Xie University of Hong Kong, China Jeremy Yallop University of Cambridge, UK Neng-Fa Zhou City University of New York, USA *** FLOPS 2022 Organizers *** Michael Hanus Kiel University, Germany (PC Co-Chair) Atsushi Igarashi Kyoto University, Japan (PC Co-Chair, General Chair) Keigo Imai Gifu University, Japan (Local Co-Chair) Taro Sekiyama National Institute of Informatics, Japan (Local Co-Chair) From zaydargaye at gmail.com Wed Apr 27 05:31:14 2022 From: zaydargaye at gmail.com (zaynah dargaye) Date: Wed, 27 Apr 2022 11:31:14 +0200 Subject: [TYPES/announce] Second CfP: FMBC 2022 - 4th International Workshop on Formal Methods for Blockchains Message-ID: FMBC 2022 Second 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!SruDPPvC6Xt9R4kY_EbDmDS944OhbHDPQ44wNfK6mgv4VBfDPKjZDnTmsnNgQbsoXbfy-kASybjpY0PEGKcWkGIgXSlNxmRi3A$ 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!SruDPPvC6Xt9R4kY_EbDmDS944OhbHDPQ44wNfK6mgv4VBfDPKjZDnTmsnNgQbsoXbfy-kASybjpY0PEGKcWkGIgXSm7k4dq6A$ ) 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!SruDPPvC6Xt9R4kY_EbDmDS944OhbHDPQ44wNfK6mgv4VBfDPKjZDnTmsnNgQbsoXbfy-kASybjpY0PEGKcWkGIgXSkQk7MnAg$ ). ----------------------------------------------------------------- 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!SruDPPvC6Xt9R4kY_EbDmDS944OhbHDPQ44wNfK6mgv4VBfDPKjZDnTmsnNgQbsoXbfy-kASybjpY0PEGKcWkGIgXSmhicBvNg$ . ---------------------- ---------------------- 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. , published as a volume of the OpenAccess Series in Informatics (OASIcs ) by Dagstuhl. ---------------------- ---------------------- 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) * Clara Schneidewind, (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 daniel.hillerstrom at ed.ac.uk Wed Apr 27 07:06:21 2022 From: daniel.hillerstrom at ed.ac.uk (=?UTF-8?Q?Daniel_Hillerstr=c3=b6m?=) Date: Wed, 27 Apr 2022 12:06:21 +0100 Subject: [TYPES/announce] [CFP] HOPE'22: ACM SIGPLAN Workshop on Higher-Order Programming with Effects (2nd CFP) Message-ID: <67b93eda-b0fe-dd7c-afd5-62ed1b51e447@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!RmTbJowFh1AIrQC498Zwav_R8Yye4a9iF5uXNBez-y-MwzCUozi10r1UBeyfSgpO_-9fHlWKwYwJjO61vU7H69UTrAG1VG7aKZF1gIDYkEY$ 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 elaine.pimentel at gmail.com Wed Apr 27 07:25:43 2022 From: elaine.pimentel at gmail.com (Elaine Pimentel) Date: Wed, 27 Apr 2022 12:25:43 +0100 Subject: [TYPES/announce] CSL'23 -- 1st call for papers Message-ID: ===================================== Call for papers (CSL'23) https://urldefense.com/v3/__https://csl2023.mimuw.edu.pl/__;!!IBzWLUs!Qbd9GAVzf7rr0rwRKzvI3jIccdfi7H9BJalvc28hDg4V8VKoTojWFJR1sSGYZjlnF3A2GmdCm-ZoBgyhAfiUw2NmamMa4IWmBOWuKfgF$ ===================================== 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!Qbd9GAVzf7rr0rwRKzvI3jIccdfi7H9BJalvc28hDg4V8VKoTojWFJR1sSGYZjlnF3A2GmdCm-ZoBgyhAfiUw2NmamMa4IWmBCm-mvFs$ . It is an interdisciplinary conference, spanning across both basic and application oriented research in mathematical logic and computer science. CSL'23 will be held on February 13 - 16, 2023, in Warsaw, Poland, with satellite workshops on February 17. It is planned as an on-site event, with support for remote presence for those participants who are unable to come for pandemic reasons. In case of a deteriorating pandemic situation, we may decide to organize the conference as an online-only event. The final decision about this will be made in November 2022. Keynote speakers: ---------------------- - Claudia Faggian (Universit? de Paris, France) - Nina Gierasimczuk (Danish Technical University, Denmark) - Dale Miller (Inria Saclay, France) - Micha? Pilipczuk (University of Warsaw, Poland) - Davide Sangiorgi (University of Bologna, Italy) Submission guidelines: ---------------------- Submitted papers must be in English and must provide sufficient detail to allow the Programme Committee to assess the merits of the paper. Full proofs may appear in a clearly marked technical appendix which will be read at the reviewers' discretion. Authors are strongly encouraged to include a well written introduction which is directed at all members of the PC. The paper should be submitted via Easychair: https://urldefense.com/v3/__https://easychair.org/conferences/?conf=csl2023__;!!IBzWLUs!Qbd9GAVzf7rr0rwRKzvI3jIccdfi7H9BJalvc28hDg4V8VKoTojWFJR1sSGYZjlnF3A2GmdCm-ZoBgyhAfiUw2NmamMa4IWmBEIu46rV$ The CSL 2022 conference proceedings will be published in Leibniz International Proceedings in Informatics (LIPIcs), see https://urldefense.com/v3/__https://submission.dagstuhl.de/documentation/authors__;!!IBzWLUs!Qbd9GAVzf7rr0rwRKzvI3jIccdfi7H9BJalvc28hDg4V8VKoTojWFJR1sSGYZjlnF3A2GmdCm-ZoBgyhAfiUw2NmamMa4IWmBLTPIHFi$ . Authors are invited to submit contributed papers of no more than 15 pages in LIPIcs style (not including appendices or references), presenting unpublished work fitting the scope of the conference. Papers may not be submitted concurrently to another conference with refereed proceedings. The PC chairs should be informed of closely related work submitted to a conference or a journal. Papers authored or co-authored by members of the PC are not allowed. At least one of the authors of each accepted paper is expected to register for the conference in order to present their papers. Important dates: ---------------- Abstract submission: July 9, 2022 (AoE), Paper submission: July 16, 2022 (AoE), Notification: September 30, 2022, Final version: October 30, 2022, Conference: February 13-16, 2022 List of topics: --------------- The following list is not exhaustive but indicates the scope of interest for CSL'23: - automated deduction and interactive theorem proving - constructive mathematics and type theory - equational logic and term rewriting - automata and games, game semantics - modal and temporal logic - model checking - decision procedures - logical aspects of computational complexity - finite model theory - computability - computational proof theory - logic programming and constraints - lambda calculus and combinatory logic - domain theory - categorical logic and topological semantics - database theory - specification, extraction and transformation of programs - logical aspects of quantum computing Programme Committee: ------------------ Matteo Acclavio (University of Luxembourg, Luxembourg) Patricia Bouyer-Decitre (LSV, CNRS & ENS Paris-Saclay, France) Agata Ciabattoni (TU Wien, Austria) Diana Costa (University of Lisbon, Portugal) Gilles Dowek (INRIA & ENS Paris-Saclay, France) Mart?n Escard? (University of Birmingham, UK) Rajeev Gor? (The Australian National University, Australia) Giulio Guerrieri (Huawei Edinburgh Research Centre, UK) Shin-ya Katsumata (National Institute of Informatics, Japan) Delia Kesner (Universit? de Paris, France) Sandra Kiefer (RWTH Aachen University, Germany) Bartek Klin (University of Oxford, UK, co-chair) Naoki Kobayashi (The University of Tokyo, Japan) Stepan Kuznetsov (Steklov Mathematical Institute of RAS, Russia) Martin L?ck (Leibniz Universit?t Hannover, Germany) Meena Mahajan (The Institute of Mathematical Sciences, HBNI, India) Filip Murlak (University of Warsaw, Poland) Daniele Nantes (University of Bras?lia, Brazil) Elaine Pimentel (UCL, UK, co-chair) Paolo Pistone (University of Bologna, Italy) Ana Sokolova (University of Salzburg, Austria) Lutz Stra?burger (Inria Saclay ? ?le-de-France, France) Pascal Schweitzer (TU Darmstadt, Germany) Martin Zimmermann (Aalborg University, Denmark) Yoni Zohar (Bar Ilan University, Israel) Organisation committee: ----------------- Lorenzo Clemente (chair) Wojciech Czerwi?ski Rados?aw Pi?rkowski -------------- next part -------------- An HTML attachment was scrubbed... URL: From mzi at cs.aau.dk Sun Apr 24 12:15:47 2022 From: mzi at cs.aau.dk (Martin Zimmermann) Date: Sun, 24 Apr 2022 16:15:47 +0000 Subject: [TYPES/announce] MOVEP: Early-bird rate ends April 30th Message-ID: IMPORTANT DATES: - Early-bird rate ends April 30th - Submission deadline for student presentations: May 1st 15th Summer School on Modelling and Verification of Parallel Processes (MOVEP) Aalborg University, Aalborg, Denmark June 13 - 17, 2022 https://urldefense.com/v3/__https://movep2022.cs.aau.dk/__;!!IBzWLUs!T1iaM-kleL1OiiRi4euOaNIVdJjEZ_YRgCsJSrOeNHfvk0Xn2rGt_l1oFs7jfXH7ywNVPH7wHDhVuBe60ceZ4b_vaTk$ 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. == 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 == Registration == Please visit https://urldefense.com/v3/__https://movep2022.cs.aau.dk/registration.html__;!!IBzWLUs!T1iaM-kleL1OiiRi4euOaNIVdJjEZ_YRgCsJSrOeNHfvk0Xn2rGt_l1oFs7jfXH7ywNVPH7wHDhVuBe60ceZODTxqUg$ == Committees == Organising committee * Peter G. Jensen (Aalborg University, Denmark) * Florian Lorber (Aalborg University, Denmark) * Martin Zimmermann (chair, Aalborg University, Denmark) Program committee * Saddek Bensalem (Universit? 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 jose at proenca.org Tue Apr 26 13:19:18 2022 From: jose at proenca.org (=?utf-8?Q?Jos=C3=A9_Proen=C3=A7a?=) Date: Tue, 26 Apr 2022 18:19:18 +0100 Subject: [TYPES/announce] CfP: FACS 2022 - 18th International Conference on Formal Aspects of Component Software Message-ID: <7e2c697f-c21d-44a1-84d7-b65d42d93bf1@Spark> --------------------------------------------------------------------- ? ? ? ? ? ? ? ? ? ? ?First Call for Papers ?? ? ? ? ? ? ? ? ? ? ? ? ? ?FACS'22 18th International Conference on Formal Aspects of Component Software ?? ? ? ? ? ?Oslo, Norway, 10-11 November, 2022 (online) ?? ? ? ? ? ? ?https://urldefense.com/v3/__https://facs-conference.github.io/2022__;!!IBzWLUs!R6vo1kpuTQeK81R8xm7u5l8E5vRQv9obejGfDWyZNHgKnWYMox2rAd3n_T3jiYiuXePlDKjyfsQB56RWAb5ijYRN2Zc$ --------------------------------------------------------------------- FOLLOW US ??All updates on https://urldefense.com/v3/__https://twitter.com/facs_conf__;!!IBzWLUs!R6vo1kpuTQeK81R8xm7u5l8E5vRQv9obejGfDWyZNHgKnWYMox2rAd3n_T3jiYiuXePlDKjyfsQB56RWAb5ivkVeufs$ . IMPORTANT DATES ??Abstract submission deadline: 24 Jun, 2022 (AoE) ??Paper submission deadline: 4 Jul, 2022 (AoE) ??Notification: 5 Sep, 2022 (AoE) ??Final version due: 26 Sep, 2022 (AoE) INVITED SPEAKERS ?- Christel Baier, TU Dresden, Germany ?- Renato Neves, University of Minho, Portugal ?- Ina Schaefer, Karlsruhe IT, Germany ?- Volker Stolz, Western Norway University of Applied Science, Norway SCOPE ??FACS 2022 is concerned with how formal methods can be applied to component- ??based software and system development. Formal methods have provided ??foundations for component-based software through research on mathematical ??models for components, composition and adaptation, and rigorous approaches to ??verification, deployment, testing, and certification. TOPICS ??The conference seeks to address the applications of formal methods in all ??aspects of software components and services. FACS aims at developing a ??community-based understanding of relevant and emerging research problems ??through formal paper presentations and lively discussions. FACS 2022 welcomes ??contributions including but not limited to: ??- Formal methods, models, and languages for components and services, including ? ? ?+ verification techniques (e.g., model checking, type systems, testing, ?? ? ?runtime analysis), ? ? ?+ probabilistic techniques, ? ? ?+ (co-)simulation techniques, ? ? ?+ composition and deployment, ? ? ?+ component interaction, ? ? ?+ software variability, ? ? ?+ QoS and other non-functional properties (e.g., trust, compliance, ?? ? ?security, privacy); ??- Formal aspects of concrete component-based systems, including ? ? ?+ service-oriented architectures, ? ? ?+ business processes, ? ? ?+ cloud or edge computing, ? ? ?+ real-time/safety-critical systems, ? ? ?+ hybrid and cyber physical systems, ? ? ?+ quantum systems, ? ? ?+ components that use artificial intelligence; ??- Tools supporting formal methods for components and services; ??- Case studies and experience reports over the above topics. SUBMISSIONS ??We solicit high-quality submissions reporting on: ?? ?A - full papers: original research, applications and experiences, or surveys ?? ? ?16 pages); ?? ?B - short papers: tools and demonstrations (6 pages); ?? ?C - journal-first papers (4 pages). ??Please use the Easychair link below to submit your paper: ?? ?https://urldefense.com/v3/__https://easychair.org/conferences/?conf=facs2022__;!!IBzWLUs!R6vo1kpuTQeK81R8xm7u5l8E5vRQv9obejGfDWyZNHgKnWYMox2rAd3n_T3jiYiuXePlDKjyfsQB56RWAb5iQDgTR0g$ ??Each paper will undergo a thorough review process. Submissions will be judged ??on the basis of significance, relevance, correctness, originality, and ??clarity. Accepted papers from all categories will be published by Springer, ??in the Lecture Notes for Computer Science series. The page limit excludes ??references and appendices. Papers should be prepared in LaTeX or Microsoft ??Word, adhering to the Springer LNCS format and Guidelines. Submissions must ??be in PDF format. For further information please visit ?? ?https://urldefense.com/v3/__http://www.springer.com/lncs__;!!IBzWLUs!R6vo1kpuTQeK81R8xm7u5l8E5vRQv9obejGfDWyZNHgKnWYMox2rAd3n_T3jiYiuXePlDKjyfsQB56RWAb5ihzqk6Po$ . ??All accepted papers must be presented at the conference. Their authors must ??be prepared to sign a copyright transfer statement. At least one author of ??each accepted paper must register to the conference by the early registration ??date, and present the paper. ??= Full and tool/short publications (A, B) = ??All submissions in categories A and B must be original, unpublished, and not ??submitted concurrently for publication elsewhere. A special journal issue is ??planned for extended versions of selected papers from categories A and B from ??FACS 2022. ??= Journal-first publications (C) = ??Submissions in category C must be 4-page abstracts of journal papers ??published after January 1st, 2021. Authors of published papers in ??high-quality journals can submit a proposal to present their journal paper at ??FACS. The journal paper must adhere to the following criteria: ??- It is clearly in the scope of FACS. ??- It is recent: only journal papers available after January 1st, 2021 (online ?? ?or printed) can be presented. ??- It reports new research results that significantly extend prior work. As ?? ?such, the journal paper does not simply extend prior work with material ?? ?presented for completeness only (such as omitted proofs, algorithms, minor ?? ?enhancements, or empirical results). ??- It has not been presented at, and is not under consideration for, ?? ?journal-first programs of other similar conferences or workshops. ??Journal-first submissions must be marked as such in EasyChair, and they must ??explicitly include pointers to the journal publication (such as a DOI). PROGRAM COMMITTEE ??Farhad Arbab, CWI and Leiden University, Netherlands ??Kyungmin Bae, Pohang University of Science and Technology, Korea ??Guillermina Cledou, University of Minho, Portugal ??Peter Csaba ?lveczky, University of Oslo, Norway ??Brijesh Dongol, University of Surrey, UK ??Clemens Dubslaff, Technische Universit?t Dresden, Germany ??Marie Farrell, National University of Ireland Maynooth, Irland ??Samir Genaim, IMDEA, Spain ??Fatemeh Ghassemi, University of Tehran, Iran ??Ludovic Henrio, INRIA, Lyon, France ??Sung-Shik Jongmans, Open University and CWI, Netherlands ??Olga Kouchnarenko, University of Franche-Comt?, France ??Ivan Lanese, University of Bologna, Italy ??Zhiming Liu, Southwest University, China ??Mieke Massink, CNR ISTI, Italy ??Jacopo Mauro, University of Southern Denmark, Denmark ??Hern?n Melgratti, University of Buenos Aires, Argentina ??Catuscia Palamidessi, INRIA Saclay, France ??Corina Pasareanu, CMU, USA ??Jos? Proen?a, Polytechnic Institute of Porto, Portugal ??Violet Ka I Pun, University of Oslo, Norway ??Gwen Sala?n, Universit? Grenoble Alpes, France ??Camilo Rocha, Pontificia Universidad Javeriana Cali, Colombia ??Lu?s Soares Barbosa, University of Minho, Portugal ??Silvia Lizeth Tapia Tarifa, University of Oslo, Norway ??Emilio Tuosto, Gran Sasso Science Institute, Italy ??Anton Wijs, Eindhoven University of Technology, Netherlands ??Shoji Yuen, Nagoya University, Japan STEERING COMMITTEE ??Farhad Arbab, CWI and Leiden University, Netherlands ??Kyungmin Bae, Pohang University of Science and Technology, Korea ??Peter Csaba ?lveczky, University of Oslo, Norway ??Sung-Shik Jongmans, Open University and CWI, Netherlands ??Zhiming Liu, Southwest University, China ??Markus Lumpe, Swinburne University of Technology, Australia ??Eric Madelaine, INRIA Sophia Antipolis, France ??Corina Pasareanu, CMU, USA ??Jos? Proen?a, Polytechnic Institute of Porto & INESC TEC, Portugal ??Gwen Sala?n, Universit? Grenoble Alpes, France ??Lu?s Soares Barbosa, University of Minho, Portugal ??Anton Wijs, Eindhoven University of Technology, Netherlands PROGRAM CHAIRS ??Silvia Lizeth Tapia Tarifa, University of Oslo, Norway ??Jos? Proen?a, Polytechnic Institute of Porto & INESC TEC, Portugal ORGANISING COMMITTEE ??Rudolf Schlatte, University of Oslo, Norway ??Silvia Lizeth Tapia Tarifa, University of Oslo, Norway ??Jos? Proen?a, Polytechnic Institute of Porto & INESC TEC, Portugal More information: https://urldefense.com/v3/__https://facs-conference.github.io/2022__;!!IBzWLUs!R6vo1kpuTQeK81R8xm7u5l8E5vRQv9obejGfDWyZNHgKnWYMox2rAd3n_T3jiYiuXePlDKjyfsQB56RWAb5ijYRN2Zc$ -- Jos? Proen?a https://urldefense.com/v3/__https://jose.proenca.org__;!!IBzWLUs!R6vo1kpuTQeK81R8xm7u5l8E5vRQv9obejGfDWyZNHgKnWYMox2rAd3n_T3jiYiuXePlDKjyfsQB56RWAb5i8OubynU$ -------------- next part -------------- An HTML attachment was scrubbed... URL: From C.Kop at cs.ru.nl Wed Apr 27 05:13:15 2022 From: C.Kop at cs.ru.nl (Cynthia Kop) Date: Wed, 27 Apr 2022 11:13:15 +0200 Subject: [TYPES/announce] WST 2022: final call for papers (submission deadline changed!) Message-ID: <43269457-133b-38f5-5684-5aaae4716abe@cs.ru.nl> ====================================================================== ????????????????????? WST 2022 - Call for Papers ????????????? 18th International Workshop on Termination https://urldefense.com/v3/__https://sws.cs.ru.nl/WST2022__;!!IBzWLUs!UfZwWzbu5jb9mOYO_SlE7WAyQ3vuUsDC3TwcT4tMiI4xUxMsbRH9h-NQEdEJpiaLbbg30AGgYn4wJX_vtRgX0nvSL_2d$ ????????????????? 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. /*The submission deadline has been extended by one week.*/ IMPORTANT DATES: ? * submission deadline: *May 10, 2022* ? * notification: *June 15, 2022* ? * final version due: *June 29, 2022* ? * workshop:???????????? August 11-12, 2022 INVITED SPEAKER: Ren? Thiemann 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 only informal 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!UfZwWzbu5jb9mOYO_SlE7WAyQ3vuUsDC3TwcT4tMiI4xUxMsbRH9h-NQEdEJpiaLbbg30AGgYn4wJX_vtRgX0n16OdgS$ 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!UfZwWzbu5jb9mOYO_SlE7WAyQ3vuUsDC3TwcT4tMiI4xUxMsbRH9h-NQEdEJpiaLbbg30AGgYn4wJX_vtRgX0sqV6hdY$ 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 -------------- next part -------------- An HTML attachment was scrubbed... URL: From caterina.urban at ens.fr Wed Apr 27 15:42:00 2022 From: caterina.urban at ens.fr (Caterina Urban) Date: Wed, 27 Apr 2022 21:42:00 +0200 Subject: [TYPES/announce] SAS 2022 - Last Call for Papers - Submissions by May 4th, 2022 (paper updates until May 11th, 2022) Message-ID: <55CB5233-F709-4EA6-BA14-8C84DFD29272@ens.fr> -------------------------------------------------------------------------------- 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!UBLSgn45qgBKX2RirbLLHj_dlP8h1Q1us_dT8hEGVr_CtMUDU248a7BzjCDmRHSUtjqGeP-UbI-0e6cC42r8b1tJyfvdAhQS2D9rQbw$ -------------------------------------------------------------------------------- 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 Are you running late in preparing your paper? No worries! Submit what you have by May 4th and you will have one extra week until May 11th for updating your paper. - Artifact submission: Wednesday, May 18th, 2022 - Author response period: Monday, June 27th, 2022 - Thursday, June 30th, 2022 - 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!UBLSgn45qgBKX2RirbLLHj_dlP8h1Q1us_dT8hEGVr_CtMUDU248a7BzjCDmRHSUtjqGeP-UbI-0e6cC42r8b1tJyfvdAhQSFrdtLHg$ 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 cangiuli at cs.cmu.edu Thu Apr 28 10:27:05 2022 From: cangiuli at cs.cmu.edu (Carlo Angiuli) Date: Thu, 28 Apr 2022 10:27:05 -0400 Subject: [TYPES/announce] announcing the HoTTEST summer school (save the dates) Message-ID: We're delighted to announce the HoTTEST Summer School on homotopy type theory, which will take place online everywhere in the world during the months of July and August 2022. The school will run both synchronously and asynchronously. The lectures will be delivered live (between 2:30-4pm UTC) and paired with various tutorial sessions run by teaching assistants. The course will also feature a discord-based all-hours Q&A and an online archive of all course materials so that participants can follow along on their own schedule. This school is for everyone and anyone with some familiarity with abstract mathematics or theoretical computer science and an itching to learn about homotopy type theory. Our goal is to make homotopy type theory accessible to, and inclusive of, everyone who is interested, regardless of cultural background, age, ability, formal education, ethnicity, gender identity, or expression. We believe HoTT is for everyone, and are committed to fostering a kind, inclusive environment. The first part of the course will include parallel introductions to homotopy type theory and formalization given by Ulrik Buchholtz, Mart?n H?tzel Escard?, Dan Licata, Anders M?rtberg, Paige North, Emily Riehl, and Egbert Rijke. The summer school will then close with a series of colloquia introducing more advanced topics and exciting areas for further study delivered by Pierre Cagne, Favonia, Jonas Frey, Jon Sterling, and Chaitanya Leena Subramaniam. A team of teaching assistants which includes Elisabeth Bonnevier, Tom de Jong, Jarl G. Taxer?s Flaten, Artem Gureev, Perry Hart, Astra Kolomatskaia, Am?lia Liao, Jacob Neumann, Johannes Schipp von Branitz, and Christopher Stough-Brown among others, will lead problem sessions and assist students with exercises. A central aim of the summer school is to build community among all of the participants, irrespective of geography. To further this, we will hold some online social events (e.g. game nights) for the summer school staff and participants. More details about the course logistics and the scientific program will be announced soon on the summer school website: https://urldefense.com/v3/__https://uwo.ca/math/faculty/kapulkin/seminars/hottest_summer_school_2022.html__;!!IBzWLUs!TNTH5bzph_fvHcUIyVtdi3P2WZ_mIgGaZlK0mFrlNQcyngBYY5WDGdJEYUpoTUQ50ZQMDRMqIaQsHSzCrzNVeLeF63k0SxLwtL0$ In the meanwhile, we invite everyone to join us on the summer school Discord group to hang out and get to know one another: https://urldefense.com/v3/__https://discord.gg/tkhJ9zCGs9__;!!IBzWLUs!TNTH5bzph_fvHcUIyVtdi3P2WZ_mIgGaZlK0mFrlNQcyngBYY5WDGdJEYUpoTUQ50ZQMDRMqIaQsHSzCrzNVeLeF63k09LNzul8$ If you would like to participate in some background surveys that will shape the design of the curriculum, please register for the Discord by May 15th, but students are also welcome to join in at any time. On behalf of the organizers, Carlo Angiuli, Dan Christensen, Mart?n H?tzel Escard?, Chris Kapulkin, Dan Licata, Emily Riehl, Egbert Rijke -------------- next part -------------- An HTML attachment was scrubbed... URL: From clemens.grabmayer at gssi.it Thu Apr 28 15:33:49 2022 From: clemens.grabmayer at gssi.it (Clemens Grabmayer) Date: Thu, 28 Apr 2022 21:33:49 +0200 Subject: [TYPES/announce] Fwd: TERMGRAPH 2022 Workshop: Final Call for Papers In-Reply-To: <70168830-7090-88a1-b59b-0eaf0f39ecac@gssi.it> References: <70168830-7090-88a1-b59b-0eaf0f39ecac@gssi.it> Message-ID: ======================================================================== Final Call for Papers TERMGRAPH 2022 Twelfth International Workshop on Computing with Terms and Graphs https://urldefense.com/v3/__http://termgraph.org.uk/2022__;!!IBzWLUs!XGQ8LeDTcmJatDwL5Cxh5Y-zQmyNX9Vu93aNb4RD5wIVM8pKvEiG4i0A6zQaYVv9PrqvG12L313fxTyyKkUf6NWUHFwVJ41uzTfppjaMMw$ Technion, Haifa, Israel Monday, 1st August 2022 *) A Workshop that is part of FLoC 2022, (associated with the conference FSCD) ======================================================================== *) 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. Poster announcement ------------------- https://urldefense.com/v3/__http://www.termgraph.org.uk/2022/poster.pdf__;!!IBzWLUs!XGQ8LeDTcmJatDwL5Cxh5Y-zQmyNX9Vu93aNb4RD5wIVM8pKvEiG4i0A6zQaYVv9PrqvG12L313fxTyyKkUf6NWUHFwVJ41uzTfo3f9-2A$ Invited Speakers: ----------------- Joerg Endrullis (Vrije Universiteit Amsterdam, The Netherlands) Delia Kesner (Universite Paris Cite, Institut Universitaire de France, and IRIF/CNRS): "A Computational Interpretation of Girard?s Intuitionistic Proof-Nets" Submissions and Publication: ---------------------------- We invite submissions of extended abstracts of at most 8 pages typeset in the EPTCS (Electronic Proceedings in Theoretical Computer Science) LaTeX 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!XGQ8LeDTcmJatDwL5Cxh5Y-zQmyNX9Vu93aNb4RD5wIVM8pKvEiG4i0A6zQaYVv9PrqvG12L313fxTyyKkUf6NWUHFwVJ41uzTfjY8ViEw$ 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 andreeac at comp.nus.edu.sg Thu Apr 28 21:51:21 2022 From: andreeac at comp.nus.edu.sg (Andreea Costea) Date: Fri, 29 Apr 2022 09:51:21 +0800 Subject: [TYPES/announce] SPLASH 2022 Final Call for Workshops Message-ID: ======================================================================== 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!VMYqVrpia7HyxnOLMJ9IHVuGhw5ppuqobG3YJlCYCrX3fDXFDqFVlXe1Qc-Vyk75ddqUyGQQh_A_tVwN48rFEmDEn86ZEcG8N4kWPcg$ ======================================================================== 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!VMYqVrpia7HyxnOLMJ9IHVuGhw5ppuqobG3YJlCYCrX3fDXFDqFVlXe1Qc-Vyk75ddqUyGQQh_A_tVwN48rFEmDEn86ZEcG8_lcuJTw$ . ## 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!VMYqVrpia7HyxnOLMJ9IHVuGhw5ppuqobG3YJlCYCrX3fDXFDqFVlXe1Qc-Vyk75ddqUyGQQh_A_tVwN48rFEmDEn86ZEcG8SjyTpi4$ ## Organizing Committee - Mehdi Bagherzadeh, Oakland University, USA - Raffi Khatchadourian, CUNY Hunter College, USA From elaine.pimentel at gmail.com Fri Apr 29 03:35:35 2022 From: elaine.pimentel at gmail.com (Elaine Pimentel) Date: Fri, 29 Apr 2022 08:35:35 +0100 Subject: [TYPES/announce] 28th WoLLIC 2022 - Deadline extension Message-ID: [Please distribute. Apologies for multiple postings] CALL FOR PAPERS New dates: May 10, 2022: Abstract deadline May 14, 2022: Full paper deadline 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!WOmwHzAJjj7hJYHuMtDfQWU0kImd38ORux3-WwvF4thrB0hYF7QJmOI3EO0pkXNvaCGDwSvbWpcmDvfMCiQyUg4MDWdiGUSZsV57EeFM$ 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!WOmwHzAJjj7hJYHuMtDfQWU0kImd38ORux3-WwvF4thrB0hYF7QJmOI3EO0pkXNvaCGDwSvbWpcmDvfMCiQyUg4MDWdiGUSZsTjK9eJU$ ). 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!WOmwHzAJjj7hJYHuMtDfQWU0kImd38ORux3-WwvF4thrB0hYF7QJmOI3EO0pkXNvaCGDwSvbWpcmDvfMCiQyUg4MDWdiGUSZsUXomnlN$ . 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 May 10, 2022: Abstract deadline -- extended! May 14, 2022: Full paper deadline -- extended! June 25, 2022: Author notification June 30, 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!WOmwHzAJjj7hJYHuMtDfQWU0kImd38ORux3-WwvF4thrB0hYF7QJmOI3EO0pkXNvaCGDwSvbWpcmDvfMCiQyUg4MDWdiGUSZsfNYNVzB$ -------------- next part -------------- An HTML attachment was scrubbed... URL: From email at justinh.su Fri Apr 29 12:56:53 2022 From: email at justinh.su (Justin Hsu) Date: Fri, 29 Apr 2022 12:56:53 -0400 Subject: [TYPES/announce] DEADLINE EXTENSION: MFPS 2022: Conference on Mathematical Foundations of Programming Semantics Message-ID: <580d96a6-323e-43c4-88cd-27ac89b8b738@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!RahuYibo6LqLCMmZda0xRmbQADw8QES3mWPD2peT5fS4yxjd0P-tMhVJBhqJadvWF-vOippJsRBNVkQfy8GGwoa_qjPdXUA$ ========================================================== IMPORTANT DATES (anywhere on earth): Abstract submission: May 3, 2022 Paper submission (EXTENDED): May 6, 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 Aix-Marseille Universit? J?r?my Dubut, AIST, 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 stefan.ciobaca at gmail.com Fri Apr 29 18:20:41 2022 From: stefan.ciobaca at gmail.com (Stefan Ciobaca) Date: Sat, 30 Apr 2022 01:20:41 +0300 Subject: [TYPES/announce] WPTE 2022 cfp (extended deadline, journal publication) 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!Ud35Dm3y5kUKCxfJNAT1mPy0V3SZ0GoFcVtgnLBKjOPWhj_Jju9jTqfdq97er-TdRaNsfAqOAvZWc_LvnFVLYB6NRba4UeRkrWYb1ig$ Submit: https://urldefense.com/v3/__https://easychair.org/conferences/?conf=wpte2022__;!!IBzWLUs!Ud35Dm3y5kUKCxfJNAT1mPy0V3SZ0GoFcVtgnLBKjOPWhj_Jju9jTqfdq97er-TdRaNsfAqOAvZWc_LvnFVLYB6NRba4UeRkPxgKwt4$ Deadline: 10 May 2022 (extended) 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 via https://urldefense.com/v3/__https://easychair.org/conferences/?conf=wpte2022__;!!IBzWLUs!Ud35Dm3y5kUKCxfJNAT1mPy0V3SZ0GoFcVtgnLBKjOPWhj_Jju9jTqfdq97er-TdRaNsfAqOAvZWc_LvnFVLYB6NRba4UeRkPxgKwt4$ . 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 10, 2022 (AoE, extended) 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 tristanj at bc.edu Sun May 1 19:12:19 2022 From: tristanj at bc.edu (Jean-Baptiste Tristan) Date: Sun, 1 May 2022 19:12:19 -0400 Subject: [TYPES/announce] Save the Date: Symposium on Probabilistic Programming in Paris (France) on June 29 and 30, 2022 Message-ID: We are pleased to announce the upcoming symposium on probabilistic programming that will take place at Coll?ge de France, in Paris, on June 29 and 30, 2022. The purpose of this event is to bring together researchers in programming languages, statistics, and machine learning. No registration is required. Organizers: Xavier Leroy, chair of software sciences, Coll?ge de France Jean-Baptiste Tristan, Boston College Keynote: Andrew Gelman, Columbia University Speakers: Francis Bach, Ecole Normale Superieure Gilles Barthes, Max Planck Institute Guillaume Baudart, INRIA Atilim Gunes Baydin, Oxford University Nicolas Chopin, ENSAE Andrew Gordon, Microsoft Research Maria Gorinova, Twitter Vikash Mansinghka, Massachusetts Institute of Technology Jan van de Meent, University of Amsterdam Xavier Rival, Ecole Normale Superieure Joseph Tassarotti, Boston College Christine Tasson, Sorbonne Universite A detailed schedule will be posted later on the website of the symposium. https://urldefense.com/v3/__https://www.college-de-france.fr/site/en-xavier-leroy/symposium-2021-2022.htm__;!!IBzWLUs!VNuRoJy7cdS992gXDyy6hy4Dh_HgL734CTFpBodv3oI2BumfAlVsp5_-6eXmwqUNiV5UD5tTZRT_s6TCFh_ItJYszgDynUs$ -- Jean-Baptiste Tristan Associate Professor Computer Science Department Boston College Website -------------- next part -------------- An HTML attachment was scrubbed... URL: From pierre-marie.pedrot at inria.fr Mon May 2 05:40:37 2022 From: pierre-marie.pedrot at inria.fr (=?UTF-8?Q?Pierre-Marie_P=c3=a9drot?=) Date: Mon, 2 May 2022 11:40:37 +0200 Subject: [TYPES/announce] TYPES 2022 -- Call for participation Message-ID: CALL FOR PARTICIPATION 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 Early registration deadline: June, 1st 2022 Registration: https://types22.sciencesconf.org/registration/ Registration fees: see below INVITED SPEAKERS Youyou Cong: Composing Music from Types Ekaterina Komendantskaya: Refine and Synthesise: a type-theoretic view on neural network robustness. Sam Lindley: On the expressive power of types. Leonardo de Moura: The Lean 4 theorem prover and programming language REGISTRATION FEES To facilitate their attendance, TYPES'22 offers a reduced rate for students, available in the registration form. In addition, all registrations performed before June, 1st will be offered a discount. It is possible to register for the satellite events only, which will take place on June 24th and 25th. Such a registration is free, but mandatory for catering purposes. Registering to TYPES'22 implicitly includes registration to satellite events. See the registration page https://types22.sciencesconf.org/registration/ for details. 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. The EuroProofNet Cost Action CA20111 focuses on the same research topics as TYPES and partially sponsors the TYPES Conference. CONTACT Email: types2022 at easychair.org 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) ORGANIZERS 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 antti.hyvarinen at gmail.com Mon May 2 11:21:47 2022 From: antti.hyvarinen at gmail.com (=?UTF-8?Q?Antti_Hyv=C3=A4rinen?=) Date: Mon, 2 May 2022 17:21:47 +0200 Subject: [TYPES/announce] SMT Workshop 2022: Final Call for Papers Message-ID: (apologies for multiple copies) 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!S_lyDhjjyiKpKy7VIXe2DqDCylHWwwJk1qCSUhj1YOvUUANgJ1pWzZwTpXWRGq19SIJrhnGMMSVDYfOTPVGsFVhNdMBkdtOEepbXEWs3$ Submission link https://urldefense.com/v3/__https://easychair.org/conferences/?conf=smt2022__;!!IBzWLUs!S_lyDhjjyiKpKy7VIXe2DqDCylHWwwJk1qCSUhj1YOvUUANgJ1pWzZwTpXWRGq19SIJrhnGMMSVDYfOTPVGsFVhNdMBkdtOEeoCJWrRu$ Submission deadline May 15, 2022 11.59 pm AoE (Anywhere on Earth) 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 tringer at cs.washington.edu Mon May 2 13:34:07 2022 From: tringer at cs.washington.edu (Talia Ringer) Date: Mon, 2 May 2022 12:34:07 -0500 Subject: [TYPES/announce] Final Call for Proposals for the Coq Workshop 2022 Message-ID: Hi all, this is the *final call* for proposals for the Coq Workshop 2022. Proposals are due on *May 10th*. We'd love your proposals. More below! --- 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 andrei.h.popescu at gmail.com Sun May 1 18:29:44 2022 From: andrei.h.popescu at gmail.com (Andrei Popescu) Date: Sun, 1 May 2022 23:29:44 +0100 Subject: [TYPES/announce] BCS-FACS evening seminar, 24 June 2022: Alan Turing at 110 - and at Oxford! In-Reply-To: References: Message-ID: *Hybrid event: Alan Turing at 110 - and at Oxford!* This hybrid talk celebrates the 110th anniversary of Alan Turing and also explores recent research on his connections with Oxford. Further information and free registration (online and at the BCS London office): https://urldefense.com/v3/__https://www.bcs.org/events-calendar/2022/june/hybrid-event-alan-turing-at-110-and-at-oxford/__;!!IBzWLUs!VoMal_dK2QSfIxsS42MHpfG6V-3iqBrF0IJLa43Uvgj9ePitQrgWtURvtkNRz6fzgzhT4fifNFXMWCg0BcPdRncOnUZ77B14DKK2vL5m$ Speaker Jonathan Bowen, London South Bank University Agenda 17:15 - Physical and online networking for attendees 18:00 - Talk 19:00 - Questions 19:15-20:30 - Networking Synopsis Alan Turing's centenary was widely celebrated in 2012. It is now 110 years since Turing's birth. This talk explores some developments with respect to Turing, especially in the last decade. In particular, it presents some recent research on Turing's connections with Oxford, the speaker's home city. Turing is well-known for his work at Cambridge, Bletchley Park, and Manchester, but there has been little evidence of his visiting Oxford. Turing arguably wrote the first formal methods paper on program proving and much later Oxford has been a major research hub for formal methods, initially through the leadership of Christopher Strachey, a colleague of Turing at Manchester, and the founder of the Programming Research Group at Oxford. About the speaker Jonathan Bowen, FBCS FRSA, is an Emeritus Professor at London South Bank University, where he was Professor of Computing from 2000, and Chairman of Museophile Limited in Oxford (founded in 2002). His main research interest has been in formal methods, especially the Z notation, but with wider computer science interests in software engineering and the history of computing. He has held previous positions at Imperial College London, the Programming Research Group at the Oxford University Computing Laboratory, and the University of Reading. Starting in 2002, he has been Chair of the BCS-FACS Specialist Group. He co-organized a centenary celebration for Alan Turing at Oxford in 2012 and his books include "The Turing Guide" (Oxford University Press, 2017). He is a Life Fellow of the BCS and the Royal Society of Arts. Jonathan Bowen's personal page Article: "Alan Turing and Oxford ". Resurrection: The Journal of the Computing Conservation Society, No. 97, pp. 11-18, Spring 2022. -------------- next part -------------- An HTML attachment was scrubbed... URL: From gorla at di.uniroma1.it Mon May 2 12:42:03 2022 From: gorla at di.uniroma1.it (Daniele Gorla) Date: Mon, 2 May 2022 18:42:03 +0200 Subject: [TYPES/announce] ICTCS'22 - CfP In-Reply-To: References: 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!RsSnW7OIG4oYucQ8PRtMtmla-pdYrukjPCgyfucVW9_-uxOKz478HzriVaI-10h5sLOANppr_IgPCavBhwyalyZrvJ4FiRxR5w$ 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!RsSnW7OIG4oYucQ8PRtMtmla-pdYrukjPCgyfucVW9_-uxOKz478HzriVaI-10h5sLOANppr_IgPCavBhwyalyZrvJ6r788bMg$ ================================ -------------- next part -------------- An HTML attachment was scrubbed... URL: From Graham.Hutton at nottingham.ac.uk Tue May 3 06:39:54 2022 From: Graham.Hutton at nottingham.ac.uk (Graham Hutton) Date: Tue, 3 May 2022 10:39:54 +0000 Subject: [TYPES/announce] Journal of Functional Programming - Call For PhD Abstracts Message-ID: Dear all, If you or one of your students recently completed a PhD in the area of functional programming, please submit the dissertation abstract for publication in JFP: simple process, no refereeing, open access, 200+ published to date, deadline 31st May 2022. Please share! Best wishes, Graham Hutton ============================================================ CALL FOR PHD ABSTRACTS Journal of Functional Programming Deadline: 31st May 2022 https://urldefense.com/v3/__http://tinyurl.com/jfp-phd-abstracts__;!!IBzWLUs!Q7KaoWMxO8TPLTOFOBCUdmdIkKn4ZKgQhch199vvxlohhHBLGZ14PMVoh77LorUFzWTrsJLU1NUZOBoHfuPqqoDppD6r6ZGoE0XzEQvzTYApgg$ ============================================================ PREAMBLE: Many students complete PhDs in functional programming each year. As a service to the community, twice per year the Journal of Functional Programming publishes the abstracts from PhD dissertations completed during the previous year. The abstracts are made freely available on the JFP website, i.e. not behind any paywall. They do not require any transfer of copyright, merely a license from the author. A dissertation is eligible for inclusion if parts of it have or could have appeared in JFP, that is, if it is in the general area of functional programming. The abstracts are not reviewed. Please submit dissertation abstracts according to the instructions below. We welcome submissions from both the PhD student and PhD advisor/supervisor although we encourage them to coordinate. ============================================================ SUBMISSION: Please submit the following information to Graham Hutton by 31st May 2022. o Dissertation title: (including any subtitle) o Student: (full name) o Awarding institution: (full name and country) o Date of PhD award: (month and year; depending on the institution, this may be the date of the viva, corrections being approved, graduation ceremony, or otherwise) o Advisor/supervisor: (full names) o Dissertation URL: (please provide a permanently accessible link to the dissertation if you have one, such as to an institutional repository or other public archive; links to personal web pages should be considered a last resort) o Dissertation abstract: (plain text, maximum 350 words; you may use \emph{...} for emphasis, but we prefer no other markup or formatting; if your original abstract exceeds the word limit, please submit an abridged version within the limit) Please do not submit a copy of the dissertation itself, as this is not required. JFP reserves the right to decline to publish abstracts that are not deemed appropriate. ============================================================ PHD ABSTRACT EDITOR: Graham Hutton School of Computer Science University of Nottingham Nottingham NG8 1BB United Kingdom ============================================================ This message and any attachment are intended solely for the addressee and may contain confidential information. If you have received this message in error, please contact the sender and delete the email and attachment. Any views or opinions expressed by the author of this email do not necessarily reflect the views of the University of Nottingham. Email communications with the University of Nottingham may be monitored where permitted by law. From jnear at uvm.edu Tue May 3 14:56:08 2022 From: jnear at uvm.edu (Joe Near) Date: Tue, 03 May 2022 14:56:08 -0400 Subject: [TYPES/announce] Call for papers: FCS'22 workshop @ CSF/FLoC'22 Message-ID: <87v8umsawn.fsf@uvm.edu> The Workshop on Foundations of Computer Security (FCS), is co-located with CSF and FLoC in Haifa, Israel on August 11, 2022. FCS 2022 welcomes papers on all topics related to the formal underpinnings of security and privacy, and their applications. We are seeking submissions for full length talks and short talks. FCS does not have formal proceedings, and you are welcome to advertise your work that appeared in other venues, or submit your work-in-progress. Submissions may conform to any 2-column format accepted by IEEE, ACM, or USENIX conferences. FCS uses a light form of double-blind reviewing similar to CSF?s. Long paper submissions (12 pages excluding bib and appendices) are due Friday, June 10 (AoE) Short paper submissions (2 pages excluding bib and appendices) are due Thursday, June 16 (AoE) Our virtual workshop had great attendance last year, and led to great discussions and conversations with the friendly and awesome CSF community. For more information, please visit our website: https://urldefense.com/v3/__https://jnear.github.io/fcs2022/__;!!IBzWLUs!TR8aSJYNSDjdyhKmv_Fh_ovhTyKfWnghGfgYeQqUcIqcDhqmvCC9SPmMpJ0bal0jlDnLkI4b_u0ACATHZwSjAE9zekRp$ From beniamino.accattoli at inria.fr Tue May 3 18:15:41 2022 From: beniamino.accattoli at inria.fr (Beniamino Accattoli) Date: Wed, 4 May 2022 00:15:41 +0200 (CEST) Subject: [TYPES/announce] PPDP 2022 - 2nd Call for Papers Message-ID: <1293659115.3276549.1651616141539.JavaMail.zimbra@inria.fr> ============================== PPDP 2022 2nd Call for Papers ============================== 24th International Symposium on Principles and Practice of Declarative Programming 20-22 September 2022, Tbilisi, Georgia The conference will be held as a hybrid (blended) meeting, both in-person and virtual. https://urldefense.com/v3/__https://software.imdea.org/Conferences/PPDP2022/__;!!IBzWLUs!WpGz77vjIhNXUPbF_8mnkaR_r9L0i4Nj36dXCJKg4YWkikQQY-ezjWOvJKS21PDIsP8BrJl4afcfl0gdXlAbbiWZE50k3PeUfqMnT6eulh0$ 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!WpGz77vjIhNXUPbF_8mnkaR_r9L0i4Nj36dXCJKg4YWkikQQY-ezjWOvJKS21PDIsP8BrJl4afcfl0gdXlAbbiWZE50k3PeUfqMnHa6Y_kU$ Submission Categories --------------------- Submissions can be made in three categories: - Research Papers, - System Descriptions, - Experience Reports. Submissions of Research Papers must present original research which is unpublished and not submitted elsewhere. They must not exceed 12 pages ACM sigconf style, 2-column (including figures, but excluding bibliography). See below for further formatting instructions. 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. Format of a submission For each paper category, you must follow the instructions of the new ACM Primary Article Templates. You must use the LaTeX sigconf proceedings template as the conference organizers are unable to process final submissions in other formats. In case of problems with the templates, please contact ACM's TeX support team at Aptara. Authors should note ACM's statement on author's rights which apply to final papers. Submitted papers should meet the requirements of ACM's plagiarism policy. Final publication will follow the new ACM Primary Article TAPS Publication Workflow. Invited Speakers ---------------- Niki Vazou, IMDEA Florian Zuleger, Technische Universit?t Wien 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 dcerna at cs.cas.cz Wed May 4 04:13:52 2022 From: dcerna at cs.cas.cz (David Cerna) Date: Wed, 4 May 2022 10:13:52 +0200 Subject: [TYPES/announce] UNIF 2022 (Extended Deadline) - 36TH International Workshop on Unification - deadline: May 11, 2022 In-Reply-To: <61b5b39c-6e1c-d498-4d36-b2a49790c4cf@cs.cas.cz> References: <61b5b39c-6e1c-d498-4d36-b2a49790c4cf@cs.cas.cz> Message-ID: <1513d17a-7768-d9e3-3cae-86e6cd3c2b0c@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!Ufp81nBbHLcJiCR-osAb1Onv5imGIoF3EG4JCSTlq2cMhbtiqo3txVgt4OJV3rozBSAfUyxg6WdvhTJ0hswXaSNZvBB82Kw$ ??????? Submission link: https://urldefense.com/v3/__https://easychair.org/conferences/?conf=unif2022__;!!IBzWLUs!Ufp81nBbHLcJiCR-osAb1Onv5imGIoF3EG4JCSTlq2cMhbtiqo3txVgt4OJV3rozBSAfUyxg6WdvhTJ0hswXaSNZ73jnXCQ$ ??????? Paper submission deadline: May 11, 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!Ufp81nBbHLcJiCR-osAb1Onv5imGIoF3EG4JCSTlq2cMhbtiqo3txVgt4OJV3rozBSAfUyxg6WdvhTJ0hswXaSNZ3maOkmc$ ). 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!Ufp81nBbHLcJiCR-osAb1Onv5imGIoF3EG4JCSTlq2cMhbtiqo3txVgt4OJV3rozBSAfUyxg6WdvhTJ0hswXaSNZ_Se9xss$ 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 11, 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 radu.iosif at univ-grenoble-alpes.fr Wed May 4 07:39:31 2022 From: radu.iosif at univ-grenoble-alpes.fr (RADU IOSIF) Date: Wed, 4 May 2022 13:39:31 +0200 (CEST) Subject: [TYPES/announce] Workshop on Advances in Separation Logics (ASL 2022 @ FLOC 2022) Message-ID: <1527370375.6252318.1651664371020.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!Wbqz275VrfcLh86etZGpokLQbw6n0TgP97c4jpKhvxXCJDkyGIUrSfLgA1GA3sOpyelDEvGwuK6QDhWYmGfC-XAQSaN3cQPmYpYYxAlNsnTAY-Y$ 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 affiliated with IJCAR 2022. Due to the uncertainty of the COVID19 and international situation, the workshop will be organized as a virtual event. Keynote Speakers * Philippa Gardner, Imperial College London * Ralf Jung, MIT CSAIL Important Dates * Papers due: May 20, 2022 (AoE, firm) * 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 zaydargaye at gmail.com Wed May 4 09:30:48 2022 From: zaydargaye at gmail.com (zaynah dargaye) Date: Wed, 4 May 2022 15:30:48 +0200 Subject: [TYPES/announce] Deadline extension CfP: FMBC 2022 - 4th International Workshop on Formal Methods for Blockchains External Message-ID: FMBC 2022 Deadline Extension Call for Papers [ Please distribute, apologies for multiple postings. ] ======================================================================== 4rd International Workshop on Formal Methods for Blockchains (FMBC) - Deadline Extension Call https://urldefense.com/v3/__https://fmbc.gitlab.io/2022__;!!IBzWLUs!StBsxadDCGF3Tn2xe-W96o638UoT4DdyfmTM-ZwrrOupYiZmgu64v7PufhPaPs5bDDYnSc0k_kmlb9p-GoEsqI54ovP-MFrF8Q$ August 11, 2022, Haifa, Israel Co-located with The Federated Logic Conference 2022 (FLoC 22 -- https://urldefense.com/v3/__https://www.floc2022.org/__;!!IBzWLUs!StBsxadDCGF3Tn2xe-W96o638UoT4DdyfmTM-ZwrrOupYiZmgu64v7PufhPaPs5bDDYnSc0k_kmlb9p-GoEsqI54ovOqRaIf4Q$ ) 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!StBsxadDCGF3Tn2xe-W96o638UoT4DdyfmTM-ZwrrOupYiZmgu64v7PufhPaPs5bDDYnSc0k_kmlb9p-GoEsqI54ovPKDrPxhg$ ). ----------------------------------------------------------------- Important dates --------------------- Abstract submission: May 3, 2022, *May 10, 2022* Full paper submission: May 10, 2022 *May 17, 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!StBsxadDCGF3Tn2xe-W96o638UoT4DdyfmTM-ZwrrOupYiZmgu64v7PufhPaPs5bDDYnSc0k_kmlb9p-GoEsqI54ovNof7HBJw$ . ---------------------- ---------------------- 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 Systemization of Knowledge (SoK) papers, and 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 bibliography) summarizing your ongoing work in the area of formal methods and blockchain. Authors of selected extended abstracts are invited to give a short lightning talk. Submission link: https://urldefense.com/v3/__https://easychair.org/conferences/?conf=fmbc2022__;!!IBzWLUs!StBsxadDCGF3Tn2xe-W96o638UoT4DdyfmTM-ZwrrOupYiZmgu64v7PufhPaPs5bDDYnSc0k_kmlb9p-GoEsqI54ovObRD0anw$ Authors are encouraged to use LaTeX and prepare their submissions according to the instructions and styling guides for OASIcs provided by Dagstuhl. Instructions for authors: https://urldefense.com/v3/__https://submission.dagstuhl.de/series/details/5*author__;Iw!!IBzWLUs!StBsxadDCGF3Tn2xe-W96o638UoT4DdyfmTM-ZwrrOupYiZmgu64v7PufhPaPs5bDDYnSc0k_kmlb9p-GoEsqI54ovPz-jQ-3g$ At least one author of an accepted paper is expected to present the paper at the workshop as a registered participant. -------------------- -------------------- PROCEEDINGS ------------------- All submissions will be peer-reviewed by at least three members of the program committee for quality and relevance. Accepted regular papers (full and short papers) will be included in the workshop proceedings. ---------------------- ---------------------- 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) * Clara Schneidewind (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 daniel.hillerstrom at ed.ac.uk Wed May 4 11:05:31 2022 From: daniel.hillerstrom at ed.ac.uk (=?UTF-8?Q?Daniel_Hillerstr=c3=b6m?=) Date: Wed, 4 May 2022 16:05:31 +0100 Subject: [TYPES/announce] ICFP 2022 Student Research Competition: Call for Submissions [2nd CfP] Message-ID: 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!WBlWC0_cHJqX1hY1RZuC6KiiC-5MXoQ6-n4smmCD5vXVYDqU_8Ykdod1XyP0z5N9kgMeKI9s_Rsc1HZ674Spre8Y0gE5cMXTYR5zVl3EDwk$ 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!WBlWC0_cHJqX1hY1RZuC6KiiC-5MXoQ6-n4smmCD5vXVYDqU_8Ykdod1XyP0z5N9kgMeKI9s_Rsc1HZ674Spre8Y0gE5cMXTYR5zVxaGWQ0$ . 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!WBlWC0_cHJqX1hY1RZuC6KiiC-5MXoQ6-n4smmCD5vXVYDqU_8Ykdod1XyP0z5N9kgMeKI9s_Rsc1HZ674Spre8Y0gE5cMXTYR5zNgj19mw$ . 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!WBlWC0_cHJqX1hY1RZuC6KiiC-5MXoQ6-n4smmCD5vXVYDqU_8Ykdod1XyP0z5N9kgMeKI9s_Rsc1HZ674Spre8Y0gE5cMXTYR5zRsIKsUU$ ### 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) -- 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 evan.cavallo at math.su.se Thu May 5 06:53:10 2022 From: evan.cavallo at math.su.se (Evan Cavallo) Date: Thu, 5 May 2022 12:53:10 +0200 Subject: [TYPES/announce] HoTT/UF 2022: Second Call for Contributions Message-ID: <9342726b-bdcd-dd90-80e5-117ac31daf0c@math.su.se> ========================================================== SECOND 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!Vt3H9ZIgZgUZgE3ZAGInDtEiXJbENS5Jkj243lpIL1r91nlA3wyOE-qJ2OuyMDsEpjDkJ42Ty5nm9iI1XPIGxennXwzs7bAiyQ6yx0U$ Co-located with FSCD 2022 https://urldefense.com/v3/__http://www.cs.tau.ac.il/*nachumd/FSCD/__;fg!!IBzWLUs!Vt3H9ZIgZgUZgE3ZAGInDtEiXJbENS5Jkj243lpIL1r91nlA3wyOE-qJ2OuyMDsEpjDkJ42Ty5nm9iI1XPIGxennXwzs7bAi7fwFEqw$ 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. The workshop will be held in person, and remote participation will be supported. Specifically, talks will be streamed for remote viewers given speaker permission, and we will support streamed or recorded talks from remote speakers. ============================ # 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!Vt3H9ZIgZgUZgE3ZAGInDtEiXJbENS5Jkj243lpIL1r91nlA3wyOE-qJ2OuyMDsEpjDkJ42Ty5nm9iI1XPIGxennXwzs7bAiWjpTpQ8$ . 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. ================ # Financial support Limited financial support will be available to subsidize participation costs. Priority will be given to women and members of under-represented minorities, including representatives of developing countries. Please contact the organizers via evan.cavallo at math.su.se for more information. ====================== # Program committee * Benedikt Ahrens (TU Delft and University of Birmingham) * Carlo Angiuli (Carnegie Mellon University) * Evan Cavallo (Stockholm University) * Chris Kapulkin (University of Western Ontario) * 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 (University of Birmingham) * Evan Cavallo (Stockholm University) * Chris Kapulkin (Western University) * Anja Petkovi? Komel (Vienna University of Technology) * Paige Randall North (University of Pennsylvania) From jaapb at kerguelen.org Fri May 6 04:16:02 2022 From: jaapb at kerguelen.org (Jaap Boender) Date: Fri, 06 May 2022 10:16:02 +0200 Subject: [TYPES/announce] Researcher Formal Verification position at Hensoldt Cyber in Munich Message-ID: <5881733.lOV4Wx5bFT@dev-nb-10021> Hello all, There is an open position for a researcher in Formal Verification at Hensoldt Cyber GmbH in Munich, Germany. This involves formal verification of software and/or hardware using Isabelle/ HOL and assorted tools, both doing actual verification work and expanding the state of the art in this domain. For more information, have a look at the job offer here: https://urldefense.com/v3/__https://hensoldt-cyber.com/job-offers/*job-549910__;Iw!!IBzWLUs!VruWSRK2rlPKt99ukuDM9kaAT8NoZxnGiD7L9f9xSDhBL-bny7Wko4uHHIaic87Z1ApeQlcLgaPJVtNcfwqPF_K4kYO708o$ where you can also apply directly. If there are any questions, feel free to contact me personally. kind regards, Jaap Boender From antonios at ru.is Fri May 6 07:58:49 2022 From: antonios at ru.is (Antonios Achilleos) Date: Fri, 6 May 2022 11:58:49 +0000 Subject: [TYPES/announce] Logic colloquium 2022 registration is open Message-ID: <8b69848df4f849d2b8d080f9087d2d1a@ru.is> Dear all, The registration page for the Logic Colloquium 2022 is now open. We encourage everyone to register as soon as possible. The early registration deadline is June 1st. The link to the conference page is this: https://urldefense.com/v3/__http://icetcs.ru.is/lc2022/__;!!IBzWLUs!SQBDtEKLX0cZjViLW3iqAcaq95Oyx6kzhcYSX9ZxUeff1bhRP-Xtpll1Ccj20u9wLoo8xaW8Yk5_MFeRXUDT_th2ZbT2uQ$ You can find more information about the colloquium and an active registration page. We will upload the schedule shortly. Please distribute this message to whoever you think would be interested. We look forward to seeing as many of you as possible in Reykjavik in June - and many others online! Antonis On behalf of the organisers Antonios Achilleos Lektor | T?lvunarfr??ideild Assistant Professor | Department of Computer Science Fars?mi / Mobile: +354 6179544 P?stfang / E-mail: antonios at ru.is [cid:image001.png at 01D86140.A521DA10] H?sk?linn ? Reykjav?k | Reykjavik University Menntavegur 1 | 102 Reykjav?k | Iceland S?mi/Tel: +354 599 6200 https://urldefense.com/v3/__http://www.hr.is__;!!IBzWLUs!SQBDtEKLX0cZjViLW3iqAcaq95Oyx6kzhcYSX9ZxUeff1bhRP-Xtpll1Ccj20u9wLoo8xaW8Yk5_MFeRXUDT_tiZttrJPw$ -------------- next part -------------- An HTML attachment was scrubbed... URL: -------------- next part -------------- A non-text attachment was scrubbed... Name: image001.png Type: image/png Size: 8041 bytes Desc: image001.png URL: -------------- next part -------------- A non-text attachment was scrubbed... Name: oledata.mso Type: application/octet-stream Size: 7969 bytes Desc: oledata.mso URL: From fredrik.nordvall-forsberg at strath.ac.uk Fri May 6 10:18:31 2022 From: fredrik.nordvall-forsberg at strath.ac.uk (Fredrik Nordvall Forsberg) Date: Fri, 6 May 2022 15:18:31 +0100 Subject: [TYPES/announce] Applied Category Theory 2022: Final Call for Papers (deadline extended to Wed 11 May) Message-ID: <43108434-391d-c2e9-dd10-45846b301e5e@strath.ac.uk> FINAL CALL FOR PAPERS WITH DEADLINE EXTENSION [By popular demand, we have extended the deadline for ACT2022 by two days until Wednesday 11 May. However we ask that authors still submit their title and abstract by the original deadline of Monday 9 May to help the PC with the paper bidding process. Please let us know if you have any questions. New abstract deadline: Monday 9 May (AoE) New paper deadline: Wednesday 11 May (AoE) Submission link: https://urldefense.com/v3/__https://easychair.org/conferences/?conf=act2022__;!!IBzWLUs!RKWcL3bNcGPhuFvJDwKMszIxq8uJ25SW23wlOzVe91MNg5kG7RrWxh_8BDuPPQn3_nK1BXIK1zBvGWNZNPvFwonPsJHYec5qB-u5c7iKVKrS1w$ .] 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!RKWcL3bNcGPhuFvJDwKMszIxq8uJ25SW23wlOzVe91MNg5kG7RrWxh_8BDuPPQn3_nK1BXIK1zBvGWNZNPvFwonPsJHYec5qB-u5c7gHmkI0yg$ 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!RKWcL3bNcGPhuFvJDwKMszIxq8uJ25SW23wlOzVe91MNg5kG7RrWxh_8BDuPPQn3_nK1BXIK1zBvGWNZNPvFwonPsJHYec5qB-u5c7gXg-PtCA$ . The submission link is https://urldefense.com/v3/__https://easychair.org/conferences/?conf=act2022__;!!IBzWLUs!RKWcL3bNcGPhuFvJDwKMszIxq8uJ25SW23wlOzVe91MNg5kG7RrWxh_8BDuPPQn3_nK1BXIK1zBvGWNZNPvFwonPsJHYec5qB-u5c7iKVKrS1w$ . IMPORTANT DATES The following dates are all in 2022, and Anywhere On Earth. - Abstract Deadline: Monday 9 May - Submission Deadline: Wednesday 11 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, SandboxAQ and The Master?s University Benjamin Merlin Bumpus, Eindhoven University of Technology 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 Gioele Zardini, 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 Sadrzadeh, University College London Jonathan Sterling, Aarhus University Todd Trimble, Western Connecticut State University Christina Vasilakopoulou, University of Patras Greece Maaike Zwart, IT University of Copenhagen 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 ventura at ufg.br Sat May 7 16:37:23 2022 From: ventura at ufg.br (D. Ventura) Date: Sat, 7 May 2022 17:37:23 -0300 Subject: [TYPES/announce] Final 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!WCtT7849kwnpI1FReY5Pspc2YM_u5L7wIUfPqsmchYmLsdweTduZX8yb-Hit8ibDjfyznahTyMSuKQtWJxr_ukhlgW55lw$ 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!WCtT7849kwnpI1FReY5Pspc2YM_u5L7wIUfPqsmchYmLsdweTduZX8yb-Hit8ibDjfyznahTyMSuKQtWJxr_ukjsMvPBaw$ *Workshop will be held as a hybrid meeting (both **virtually** and **in person**)* ======================================================== 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!WCtT7849kwnpI1FReY5Pspc2YM_u5L7wIUfPqsmchYmLsdweTduZX8yb-Hit8ibDjfyznahTyMSuKQtWJxr_ukhW1DhGGQ$ 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. *INVITED SPEAKERS* + Stephanie Balzer , Carnegie Mellon University + Thomas Ehrhard , Universit? Paris Cit? + Giulio Guerrieri , Huawei-Edinburgh Joint Lab + Koko Muroya , RIMS Kyoto University *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 sandra at dcc.fc.up.pt Mon May 9 09:22:32 2022 From: sandra at dcc.fc.up.pt (Sandra Alves) Date: Mon, 9 May 2022 14:22:32 +0100 Subject: [TYPES/announce] Women in Logic 2022 - Call for Contributions Message-ID: <7F750233-756D-484E-9148-EA6ABCDAEA0E@dcc.fc.up.pt> ----------------------------------------------------------------------------------------- --> Please feel free to forward this e-mail to interested persons! <-- Are you a woman working in logic? Please join us on July 31 at WiL, give a talk, and enjoy a day with Women in Logic! Please submit an abstract of 1-2 pages by May 29, 2022, via EasyChair. This will help us provide an interesting program, with only a light-weight selection procedure. More information below: ----------------------------------------------------------------------------------------- Call for Contributions WiL 2022: 6th Women in Logic Workshop July 31, 2022 part of FLoC 2022 https://urldefense.com/v3/__https://sites.google.com/g.uporto.pt/wil2022__;!!IBzWLUs!RQPnvIDnU81OFXMQ348cqzZ3tGLQcdVskwwaK5wqfDjkTL89Phvo0U1vQNbk9i2rGeVXwE8fUJfPYgIGRHRZcTuUW2529ZfSwA$ ----------------------------------------------------------------------------------------- Women in Logic 2022 is a satellite event of the 8th Federated Logic Conference (FLoC 2022) to be held in Haifa, Israel, from July 31 to August 12, 2022. The Women in Logic workshop (WiL) provides an opportunity to increase awareness of the valuable contributions made by women in the area of logic in computer science. Its main purpose is to promote the excellent research done by women, with the ultimate goal of increasing their visibility and representation in the community. Our aim is to: - provide a platform for female researchers to share their work and achievements; - increase the feelings of community and belonging, especially among junior faculty, post-docs and students through positive interactions with peers and more established faculty; - establish new connections and collaborations; - foster a welcoming culture of mutual support and growth within the logic research community. We believe these aspects will benefit women working in logic and computer science, particularly early-career researchers. Previous versions of Women in Logic (Reykjav?k 2017, Oxford 2018, Vancouver 2019, Paris 2020, and Rome 2021) were very successful in showcasing women's work and as catalysts for a recognition of the need for change in the community. Topics of interest include but are not limited to: automata theory, automated deduction, categorical models and logics, concurrency and distributed computation, constraint programming, constructive mathematics, database theory, decision procedures, description logics, domain theory, finite model theory, formal aspects of program analysis, formal methods, foundations of computability, games and logic, higher-order logic, lambda and combinatory calculi, linear logic, logic in artificial intelligence, logic programming, logical aspects of bioinformatics, logical aspects of computational complexity, logical aspects of quantum computation, logical frameworks, logics of programs, modal and temporal logics, model checking, probabilistic systems, process calculi, programming language semantics, proof theory, real-time systems, reasoning about security and privacy, rewriting, type systems and type theory, and verification. INVITED SPEAKERS * Philippa Gardner (Imperial College London) * Delia Kesner (IRIF - Universit? de Paris) IMPORTANT DATES Abstract submission deadline: May 29, 2022 Notification: June 17, 2022 Contribution for Informal Proceedings: June 29, 2022 Workshop: July 31, 2022 SUBMISSIONS Abstracts should be written in English (1-2 pages), and prepared using the Easychair style (https://urldefense.com/v3/__https://easychair.org/publications/for_authors__;!!IBzWLUs!RQPnvIDnU81OFXMQ348cqzZ3tGLQcdVskwwaK5wqfDjkTL89Phvo0U1vQNbk9i2rGeVXwE8fUJfPYgIGRHRZcTuUW26oOdRkdg$ ). The abstracts should be uploaded to the WiL 2022 Easychair page as a PDF file (https://urldefense.com/v3/__https://easychair.org/conferences/?conf=wil2022__;!!IBzWLUs!RQPnvIDnU81OFXMQ348cqzZ3tGLQcdVskwwaK5wqfDjkTL89Phvo0U1vQNbk9i2rGeVXwE8fUJfPYgIGRHRZcTuUW24m_-RKVg$ ) before the submission deadline on May 29, 2022, anywhere on Earth. ORGANIZING AND PROGRAM COMMITTEE * Maria Aloni (University of Amsterdam) * Sandra Alves (Co-chair, University of Porto) * Lourdes Del Carmen Gonz?lez Huesca (Universidad Nacional Aut?noma de M?xico) * Amy Felty (University of Ottawa) * Sandra Kiefer (Co-chair, Max Planck Institute for Software Systems) * Daniele Nantes (Co-chair, University of Bras?lia) * Valeria de Paiva (Topos Institute) * Elaine Pimentel (University College London) * Simona Ronchi Della Rocca (Universit? di Torino) * Renate A. Schmidt (University of Manchester) * Ana Sokolova (University of Salzburg) * Femke Van Raamsdonk (University of Amsterdam) * Rineke Verbrugge (University of Groningen) ----------------------------------------------------------------------------------------- -------------- next part -------------- An HTML attachment was scrubbed... URL: From Neil.JR.Ross at Dal.Ca Mon May 9 16:17:51 2022 From: Neil.JR.Ross at Dal.Ca (Julien Ross) Date: Mon, 9 May 2022 20:17:51 +0000 Subject: [TYPES/announce] PLanQC 2022: First call for submissions Message-ID: PLanQC 2022: Programming Languages for Quantum Computing 1st Call for Submissions We invite members of the programming languages and quantum computing communities to submit talk proposals for the 3rd International Workshop on Programming Languages for Quantum Computing (PLanQC 2022), co-located this September with ICFP in Ljubljana, Slovenia. PLanQC aims to bring together researchers from the fields of programming languages and quantum information, exposing the programming languages community to the unique challenges of programming quantum computers. It will promote the development of tools to assist in the process of programming quantum computers, as they exist today and as they are likely to exist in the near to distant future. Submissions to PLanQC should take the form of 2-5 page abstracts (single-column, 11pt acmsmall style, not including references), with links to larger preprints when appropriate. Work in progress is welcome. We hope to make PLanQC maximally accessible to the programming languages community. Thus, abstracts should cover cutting edge ideas and results, but not be opaque to new, potential entrants to quantum computing coming from programing languages. Abstracts will be reviewed for quality and relevance to the workshop, and accepted authors will be invited to give talks or poster presentations. We will not be publishing formal proceedings, but the extended abstracts, along with links (where available) to full papers will be posted to the website of the workshop. Invited speakers: ? Dominique Unruh, University of Tartu ? Charles Yuan, MIT Workshop topics include (but are not limited to): ? High-level quantum programming languages ? Verification tools for quantum programs ? Novel quantum programming abstractions ? Quantum circuit and program optimizations ? Hardware-aware circuit compilation and routing ? Error handling, mitigation, and correction ? Instruction sets for quantum hardware ? Other techniques from traditional programming languages (e.g., types, compilation/optimization, foreign function interfaces) applied to the domain of quantum computation. ------------------------------------------------------------------------- Important dates: ? Submission deadline: 20 June 2022 (anywhere on earth) ? Author notification: 1 August 2022 ? Workshop: TBA (one of 11, 15, or 16 of September 2022) ------------------------------------------------------------------------- Important links: ? Website: https://urldefense.com/v3/__https://icfp22.sigplan.org/home/planqc-2022__;!!IBzWLUs!TlHahlqyLcFmJnpRWYTgDWe7EQ0WYlXfKco0N0tnrIklnrnpiLDTZCNER1UpGWaPxXFTaam0_HoWBwvTSxNP_H1wPiUcFdFCYS2h$ ? Submission: https://urldefense.com/v3/__https://planqc2022.hotcrp.com/__;!!IBzWLUs!TlHahlqyLcFmJnpRWYTgDWe7EQ0WYlXfKco0N0tnrIklnrnpiLDTZCNER1UpGWaPxXFTaam0_HoWBwvTSxNP_H1wPiUcFXv8nWG0$ ------------------------------------------------------------------------- Program Committee: Matthew Amy, Simon Fraser University Robert Booth, The University of Edinburgh Olivia Di Matteo, University of British Columbia Yufei Ding, UC Santa Barbara Ross Duncan, Cambridge Quantum Computing Ltd Peng (Frank) Fu, Dalhousie University Kesha Hietala, University of Maryland Kohei Kishida, University of Illinois Urbana-Champaign Aleks Kissinger, University of Oxford Bert Lindenhovius, Tulane University Robert Rand, University of Chicago Mathys Rennela, Inria Neil Julien Ross (chair), Dalhousie University Sam Staton, University of Oxford Mathias Soeken, Microsoft Dominique Unruh, University of Tartu Beno?t Valiron, Universit? Paris-Saclay, CNRS, CentraleSup?lec, LMF Vladimir Zamdzhiev, Inria, LORIA, Universit? de Lorraine Organizing Committee: Matt Amy, Simon Fraser University Ross Duncan, Cambridge Quantum Computing Robert Rand, University of Chicago Neil Julien Ross, Dalhousie University -------------- next part -------------- An HTML attachment was scrubbed... URL: From clemens.grabmayer at gssi.it Tue May 10 02:26:20 2022 From: clemens.grabmayer at gssi.it (Clemens Grabmayer) Date: Tue, 10 May 2022 08:26:20 +0200 Subject: [TYPES/announce] [TERMGRAPH-2022] 2-day extension submission deadline: May 12 Message-ID: ======================================================================== 2-day EXTENSION of Submission deadline: Thursday, May 12 (AoE), 2022. The adapted final Call for Papers below now also includes the titles of both of the invited talks. ======================================================================== (Adapted) Final Call for Papers TERMGRAPH 2022 Twelfth International Workshop on Computing with Terms and Graphs https://urldefense.com/v3/__http://termgraph.org.uk/2022__;!!IBzWLUs!UOON2usnaeJ3hoTX1Em19DJPdMmbnWRP5gnPxuyz4RHNLYVGH-ESLauWdBR3ua_9Ta--4wAKpI9cY72XDDovJ02OEnna0_1VQTVLP-wWFg$ Technion, Haifa, Israel Monday, 1st August 2022 *) A Workshop that is part of FLoC 2022, (associated with the conference FSCD) ======================================================================== *) 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. Poster announcement ------------------- https://urldefense.com/v3/__http://www.termgraph.org.uk/2022/poster.pdf__;!!IBzWLUs!UOON2usnaeJ3hoTX1Em19DJPdMmbnWRP5gnPxuyz4RHNLYVGH-ESLauWdBR3ua_9Ta--4wAKpI9cY72XDDovJ02OEnna0_1VQTUnFK5p1Q$ Invited Speakers: ----------------- Joerg Endrullis (Vrije Universiteit Amsterdam, The Netherlands) "A PBPO+ Graph Rewriting Tutorial" Delia Kesner (Universite Paris Cite, Institut Universitaire de France, and IRIF/CNRS): "A Computational Interpretation of Girard?s Intuitionistic Proof-Nets" Submissions and Publication: ---------------------------- We invite submissions of extended abstracts of at most 8 pages typeset in the EPTCS (Electronic Proceedings in Theoretical Computer Science) LaTeX 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 12 May 2022 (AoE) electronically (pdf) via the EasyChair submission site: https://urldefense.com/v3/__https://easychair.org/conferences/?conf=termgraph2022__;!!IBzWLUs!UOON2usnaeJ3hoTX1Em19DJPdMmbnWRP5gnPxuyz4RHNLYVGH-ESLauWdBR3ua_9Ta--4wAKpI9cY72XDDovJ02OEnna0_1VQTWDHFiRBw$ 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: 12 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 W.S.Swierstra at uu.nl Tue May 10 03:12:49 2022 From: W.S.Swierstra at uu.nl (Swierstra, W.S. (Wouter)) Date: Tue, 10 May 2022 07:12:49 +0000 Subject: [TYPES/announce] Full professorships at Utrecht University Message-ID: <3e78cd69-4076-5cbe-c615-fec128419eab@uu.nl> Utrecht University is currently recruiting four full professors in Computing Science. The exact research areas are not fixed -- but I'd love to see applications from the TYPES community. https://urldefense.com/v3/__https://www.uu.nl/en/organisation/working-at-utrecht-university/jobs/4-full-professors-in-information-and-computing-sciences-08-10-fte__;!!IBzWLUs!SM9rJaSnWkX9p1JrXn6OmA4rfcmVTl8FH5fCaeJDiTKHp7bhj10R90qkfdxfpzW-jtpUgDonXwyNNLZgsRW3QY0f1r7v9itswbJ7QA$ # Job description The Department of Information and Computing Sciences (ICS) is nationally and internationally renowned for its fundamental and applied research in computer science and information science. In our constantly changing (digital) society, we are continually looking for new, realistic ways to push the boundaries of both science and societal application. We contribute to innovative information technologies through the development and application of new concepts, theories, algorithms, and software methods. With our expertise, we nourish a wide range of interdisciplinary and societal collaboration initiatives. The Department has grown significantly in the past years. Due to this growth and the upcoming retirement of some of our professors we envisage having appointed eight new full professors by the end of 2024 in the following fields of expertise: software systems (preferably in software production, and software and information security), artificial intelligence and data science (preferably in machine learning, responsible AI, and natural Language processing) and interaction (preferably in data-driven interaction). We are now actively searching to fill four positions. Since we aim to continue to increase the participation of women in Information and Computing Sciences (both students and staff), we wish to appoint at least two female full professors. Additionally, we have one position open that is not tied to any specific area, exclusively reserved for female candidates, a Westerdijk chair*. In Software Systems, we have research groups on Software Technology, Software Technology for Teaching and Learning, Software Production, and Business Process Management and Analytics. We lead the research masters on Computing Science and Business Informatics, and co-lead the bachelors Informatics and Information Science. We engage closely with industry and public sector partners to study the development and adoption of software technology and software production methods. In Artificial Intelligence & Data Science, we have research groups on Intelligent Systems, Data Intensive Systems, Data Mining, and Natural Language Processing. We lead the multidisciplinary research master in Artificial Intelligence and Data Science, and co-lead the Applied Data Science master and Artificial Intelligence bachelor. We closely collaborate with the public sector and companies, for example in our National Police Lab AI and AI & Mobility Lab. We also work closely with other disciplines, for example in the university's Human Centered AI and Applied Data Science focus areas. In Interaction Technology, we have research groups on Human Centered Computing, Game and Media Technology, Social and Affective Computing, and Visualisation and Graphics. We lead the Research Masters on Game & Media Technology and Human-Computer Interaction, and co-lead the Bachelor Information Science. Our state-of-the-art facilities include a Human-Centered Computing lab for prototyping interactive systems and conducting user studies and a Motion Capture and Virtual Reality Lab with full body motion capture equipment. We co-lead the multidisciplinary AI & Media and AI & Healthy Living labs and the Center for Game Research. As a full professor you are a committed, internationally acknowledged and leading scientist with expertise in one of the areas of Information and Computing Science. Your ambition is to lead the further development of research, the quality of education (both in teaching and curriculum development) and the achievement of societal impact in the field of information and computing sciences. You seek internal and external (interdisciplinary) collaboration and acquire funding for research, developing new research collaborations and new application areas. You are an inspiring educator with enthusiasm for teaching. Alongside you will take a leading role in your field of expertise, you also play an important role in creating a workplace that is supportive, socially safe and inclusive, further enhancing scientific integrity and working together towards open science. You have a clear view of how to achieve this as a leading staff member. The Department provides a dynamic, informal and international work environment. Our approach is characterized by a connected, open, and can-do spirit that stimulates personal initiative and curiosity. You are a team player who encourages taking ownership and create value while sharing your knowledge both internally and across the wider (global) community. If you are excited to actively participate and collaborate in shaping our developing department, we invite you to apply. It is important that when you apply, you make clear where and how you see that your expertise fits the overall research and education portfolio of the department, including the relationship with (future) external stakeholders. *A Westerdijk chair is a position especially installed to be occupied by a female professor. It is named after Johanna Westerdijk, appointed at Utrecht University in 1917 as the first female full professor in the Netherlands. # Qualifications We are looking for new colleagues to complement our team at an academic as well as a personal level, who fit well with the following qualifications: a PhD in Computer Science, Information Science or another relevant discipline; an internationally acknowledged research line with a strong publication track record on original research of high impact; an active player in international scientific communities; experience in and a personal view on how to lead a group of scientists and create and sustain a supportive, collaborative and inclusive work environment; demonstrated ability to acquire external funding for research and innovation; driven to explore and forge new collaborations in- and outside academia; enthusiasm for education and experience with student supervision, ability to teach in BSc and MSc programmes; experience in and aspiration for further development of courses and programmes. # Offer a tenured position as full professor; a full-time gross salary ranging from ?5,864 to ?8,539 in scale H2 at full professor level; benefits including an 8% holiday bonus and an 8.3% end-of-year bonus; a pension scheme, partially paid parental leave, and flexible employment conditions based on the Collective Labour Agreement (cao) Dutch Universities; a starting package that is negotiable and depends on what is necessary to give you a running start in the department; assistance in finding housing and, if applicable, help with finding employment for a partner and schools for children; 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. # About the organisation 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 informal atmosphere and the can-do mentality of our people. This lively and inspiring academic environment attracts professors, researchers 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 If you have specific questions regarding the positions or the department, please email them to Professor Johan Jeuring (Head of Department) or Professor Judith Masthoff (Director of Research) at j.t.jeuring at uu.nl/ j.f.m.masthoff at uu.nl. If you are interested in reading more about the development of our department, we can provide you with a copy of our summarized organizational development plan. You can send your request to a.bonsma at uu.nl. Do you have a question about the application procedure? Please send an email to science.recruitment at uu.nl # Apply https://urldefense.com/v3/__https://ssl1.peoplexs.com/Peoplexs22/CandidatesPortalNoLogin/ApplicationForm.cfm?PortalID=4124&VacatureID=1188880__;!!IBzWLUs!SM9rJaSnWkX9p1JrXn6OmA4rfcmVTl8FH5fCaeJDiTKHp7bhj10R90qkfdxfpzW-jtpUgDonXwyNNLZgsRW3QY0f1r7v9iv2PVzn9Q$ Everyone deserves to feel at home at our university. We welcome employees with a wide variety of backgrounds and perspectives. Please enclose: your motivation letter; your full academic curriculum vitae, including a list of publications; your vision on research and education. If this specific opportunity isn?t for you, but you know others who may be interested, please forward this vacancy to them. The application deadline is 1 July 2022. From efes at cs.uni.wroc.pl Tue May 10 03:52:54 2022 From: efes at cs.uni.wroc.pl (Filip Sieczkowski) Date: Tue, 10 May 2022 08:52:54 +0100 Subject: [TYPES/announce] SPLV 2022 - Call for Participation Message-ID: +---------------------------------------------------------------+ | | | Scottish Programming Languages and Verification Summer School | | Heriot-Watt University, UK, 11--15 July 2022 | | https://urldefense.com/v3/__https://www.macs.hw.ac.uk/splv/splv22/__;!!IBzWLUs!VWrf4TR6u_G-ENxQp5BtSxf-GxqpdV-x6s8Pz1u0-gsKMnpnTSMUTVg2ECeeU7_AolEKxwmVMD0HSbZ8B3xwxF7a0DlVbbwO$ | | | +---------------------------------------------------------------+ The Scottish Programming Languages and Verification Summer School will be held at Heriot-Watt University 11--15 July 2022. The aim of the school is to provide PhD students with core and specialised knowledge in the broad area of Programming Language and Verification research. COURSES ======= Core courses ------------ * James McKinna (Heriot-Watt University) ?The lambda calculus, formalised: the Church-Rosser and Standardisation theorems, with applications? * Elizabeth Polgreen (U. Edinburgh) ?An Introduction to SAT and SMT? Specialised courses ------------------- * Susmit Sarkar (St. Andrews), Marko Doko (Heriot-Watt University) ?An Introduction to Reasoning with Weak Memory? * Ohad Kammar (U. Edinburgh) ?Introduction to Statistical modelling with higher-order measure theory? * Glynn Winskel (U. Strathclyde/Huawei Labs) ?Making Concurrency Functional? * Jeremy Singer (U. Glasgow) ?Capabilities for Coders; an introduction to the CHERI platform? Invited Lecture --------------- TBA Talks ----- * Jamie Gabbay (Heriot-Watt University) ?Introduction to Blockchain technology? * Sam Lindley (U. Edinburgh) ?Effect-Handler Oriented Programming? PREREQUISITES ============= The school is aimed at PhD students in programming languages, verification and related areas. Also researchers and practitioners will be very welcome, as will strong master's students with the support of a supervisor. Participants will need to have a background in computer science, mathematics or a related discipline, and have basic familiarity with (functional) programming and logic. SPONSORSHIP =========== We offer a range of sponsorship opportunities for industry with attractive benefits -- please get in touch if you are interested. REGISTRATION ============ Registration is open at https://urldefense.com/v3/__https://forms.gle/yVuJXU9P3evp2QwAA__;!!IBzWLUs!VWrf4TR6u_G-ENxQp5BtSxf-GxqpdV-x6s8Pz1u0-gsKMnpnTSMUTVg2ECeeU7_AolEKxwmVMD0HSbZ8B3xwxF7a0E8loP-Y$ The registration fees in general are as follows: * Students & Academics: ?330. * Industry: ?500. The registration fee covers coffee breaks, lunches, dinners, and an excursion. Registration Date: June 10, 2022 We may be able to provide fee waivers for a small number for students as well as Scottish academics. Please indicate your interest in the registration form. ACCOMMODATION ============= We can offer 5-night accommodation (Sunday to Friday) in student dorms for ?210. Please indicate your interest in the registration form. Alternatively, Marriot Hotel on Heriot-Watt campus offers self-organised accommodation. FURTHER INFORMATION =================== More information can be found on the school webpage: https://urldefense.com/v3/__http://www.macs.hw.ac.uk/splv/splv22/__;!!IBzWLUs!VWrf4TR6u_G-ENxQp5BtSxf-GxqpdV-x6s8Pz1u0-gsKMnpnTSMUTVg2ECeeU7_AolEKxwmVMD0HSbZ8B3xwxF7a0Ot6Qtvb$ Please contact one of the local organisers if you have any questions: * Ekaterina Komendantskaya e.komendantskaya at hw.ac.uk * Filip Sieczkowski f.sieczkowski at hw.ac.uk * Kathrin Stark k.stark at hw.ac.uk From andersmortberg at gmail.com Tue May 10 10:29:07 2022 From: andersmortberg at gmail.com (Anders Mortberg) Date: Tue, 10 May 2022 16:29:07 +0200 Subject: [TYPES/announce] Final call for participation (Deadline Friday 13 May): Workshop on Syntax and Semantics of Type Theories in Stockholm, Sweden, May 20-21, 2022 Message-ID: As previously announced, we are organizing an in-person workshop on Syntax and Semantics of Type Theories in Stockholm, Sweden, May 20-21, 2022. Details can be found at: https://urldefense.com/v3/__https://europroofnet.github.io/wg6-kickoff-stockholm/__;!!IBzWLUs!RzvbAQwLyd8l_4lxEk8SWgyTqE08SZtnBZ88IB7DmLdxRhfGsQ7GkFSybMnXNgJ-tIfP7opmYXv_b0XJvYH5GvskPcepOKutvLjljRY$ Registration is free, but required for planning purposes, by *Friday 13 May*. To register please fill out the form linked to on the event webpage. # Invited speakers: - Andrej Bauer - Anja Petkovi? Komel - Andr?s Kovacs - Ivan Di Liberti - Jonathan Sterling - Taichi Uemura - Th?o Winterhalter There will also be multiple contributed talks, for details see the schedule: https://urldefense.com/v3/__https://europroofnet.github.io/wg6-kickoff-stockholm/programme__;!!IBzWLUs!RzvbAQwLyd8l_4lxEk8SWgyTqE08SZtnBZ88IB7DmLdxRhfGsQ7GkFSybMnXNgJ-tIfP7opmYXv_b0XJvYH5GvskPcepOKutRcfpO00$ # 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 Jan.deMuijnck-Hughes at glasgow.ac.uk Tue May 10 11:03:48 2022 From: Jan.deMuijnck-Hughes at glasgow.ac.uk (Jan de Muijnck-Hughes) Date: Tue, 10 May 2022 16:03:48 +0100 Subject: [TYPES/announce] Call for Reviewers APLAS 2022 Artifact Evaluation Committee Message-ID: Dear all; The /20th Asian Symposium on Programming Languages and Systems/ (APLAS'22) is going to be holding its first /Artifact Evaluation Committee/ (AEC). The artifact evaluation process aims to promote, share, and catalogue the research artifacts of papers accepted to the APLAS research track. We are looking for motivated researchers at all academic stages (PhD Students, Researchers, Lecturers, & Professors) to join us on the inaugural APLAS'22 AEC. The self-nomination form is available at: https://urldefense.com/v3/__https://forms.gle/rJREG9DiFQHegZmD9__;!!IBzWLUs!UlGQR-V8fEPAFIX2Alv0wFWLheD-qfJ8rWUDenPzs-H6xjuaYx2ZpX7HquufrcB8K6JDTzW0Tnb3mAI3zl2ONaDA_5Asr2xzTyNu9BUw3BYQ9vI$ To nominate other people please use the following form: https://urldefense.com/v3/__https://forms.gle/KFiQYLjELMsEjGLp8__;!!IBzWLUs!UlGQR-V8fEPAFIX2Alv0wFWLheD-qfJ8rWUDenPzs-H6xjuaYx2ZpX7HquufrcB8K6JDTzW0Tnb3mAI3zl2ONaDA_5Asr2xzTyNu9BUwsceE3M8$ As a committee member your primary responsibility will be to review artifacts submitted by authors of accepted papers and ensure that the artifact is a faithful representation of the accepted paper's results. This will involve interacting with some tooling provided by the authors, check if the results of the main paper are consistent with the claims in the paper and are also reproducible for researchers to come. APLAS will use a three-phase artifact review process: Kick-The-Tyres; Review the Artifact; and Iron-out-the-Wrinkles. Reviewing guidance for committee members will be made available once the committee has been formed. We will close nominations on: Friday 08 July 2022 (AOE) and notify the selected committee members on: Friday 15 July 2022 (AOE) We expect most of the reviewing process to be performed between 22nd August 2022 and 19th September 2022. We expect each artifact to take around eight hours to review and we will look to assign each reviewer three to four reviews. For each artifact we will assign a Lead Reviewer to lead the reviewing process. Salient information about the reviewing process can be found online: https://urldefense.com/v3/__https://2022.splashcon.org/track/aplas-2022-aec*Reviewer-Information__;Iw!!IBzWLUs!UlGQR-V8fEPAFIX2Alv0wFWLheD-qfJ8rWUDenPzs-H6xjuaYx2ZpX7HquufrcB8K6JDTzW0Tnb3mAI3zl2ONaDA_5Asr2xzTyNu9BUwq53MO68$ Come join us to improve the quality of research in our field! Thanks Arpita Dutta and Jan de Muijnck-Hughes APLAS'22 AEC Co-Chairs. This call was adapted from the PLDI'22 AEC Call for Nominations. From lysxia at gmail.com Tue May 10 11:33:36 2022 From: lysxia at gmail.com (Li-yao Xia) Date: Tue, 10 May 2022 11:33:36 -0400 Subject: [TYPES/announce] BX 2022 - Final Call For Papers (deadline 14 May) In-Reply-To: References: Message-ID: # Tenth International Workshop on Bidirectional Transformations (BX 2022) ## Important Dates - Paper submission: 14 May, 2022 - Author notification: 28 May, 2022 - Workshop: 8 July 2022, Nantes, France Part of STAF 2022 (5-8 July): https://urldefense.com/v3/__https://staf2022.univ-nantes.io/__;!!IBzWLUs!Xg6QthdhGbTdlGnemy59PnTSPl1EKYg6DVuUBrmiDu9XiFMfVYziu70feHPoSaBP-9Byr1_DHNBDDKDnl_uc_lM0JgTZ$ BX 2022 homepage: https://urldefense.com/v3/__http://bx-community.wikidot.com/bx2022:home__;!!IBzWLUs!Xg6QthdhGbTdlGnemy59PnTSPl1EKYg6DVuUBrmiDu9XiFMfVYziu70feHPoSaBP-9Byr1_DHNBDDKDnl_uc_jJeWT67$ ## 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!Xg6QthdhGbTdlGnemy59PnTSPl1EKYg6DVuUBrmiDu9XiFMfVYziu70feHPoSaBP-9Byr1_DHNBDDKDnl_uc_l9Vo9ai$ ## 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!Xg6QthdhGbTdlGnemy59PnTSPl1EKYg6DVuUBrmiDu9XiFMfVYziu70feHPoSaBP-9Byr1_DHNBDDKDnl_uc_kmiZMgE$ https://urldefense.com/v3/__http://ceur-ws.org/Vol-XXX/CEURART.zip__;!!IBzWLUs!Xg6QthdhGbTdlGnemy59PnTSPl1EKYg6DVuUBrmiDu9XiFMfVYziu70feHPoSaBP-9Byr1_DHNBDDKDnl_uc_vzoaE-X$ and must be submitted via EasyChair: https://urldefense.com/v3/__https://www.easychair.org/conferences/?conf=bx2022__;!!IBzWLUs!Xg6QthdhGbTdlGnemy59PnTSPl1EKYg6DVuUBrmiDu9XiFMfVYziu70feHPoSaBP-9Byr1_DHNBDDKDnl_uc_l9Vo9ai$ 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. Talk proposals are encouraged to 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. 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 madeira at ua.pt Wed May 11 05:45:43 2022 From: madeira at ua.pt (Alexandre Madeira) Date: Wed, 11 May 2022 09:45:43 +0000 Subject: [TYPES/announce] WADT'22 - 26th International Workshop on Algebraic Development Techniques 2022 (CALL FOR PARTICIPATION) Message-ID: <6C57E22A-FFA2-48B8-8048-3C06E3AE5324@ua.pt> =================================================================================== WADT'22 - 26th International Workshop on Algebraic Development Techniques 2022 ****************** CALL FOR PARTICIPATION ****************** Early registration deadline: May 20, 2022 https://urldefense.com/v3/__http://wadt2022.web.ua.pt__;!!IBzWLUs!UBY3BGVwMke--u-cDML7xriZwJg9IVaItXU7x29zbjYQAvumCRbpRtMHcz5GdE60DXyiSliNg5shzQs1WPG1OOEKijW9$ 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 ** Contributed talks ** see https://urldefense.com/v3/__http://wadt2022.web.ua.pt__;!!IBzWLUs!UBY3BGVwMke--u-cDML7xriZwJg9IVaItXU7x29zbjYQAvumCRbpRtMHcz5GdE60DXyiSliNg5shzQs1WPG1OOEKijW9$ ** 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 in https://urldefense.com/v3/__http://wadt2022.web.ua.pt__;!!IBzWLUs!UBY3BGVwMke--u-cDML7xriZwJg9IVaItXU7x29zbjYQAvumCRbpRtMHcz5GdE60DXyiSliNg5shzQs1WPG1OOEKijW9$ . 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. ** 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 dmat-wadt2022 at ua.pt From bove at chalmers.se Wed May 11 09:04:49 2022 From: bove at chalmers.se (Ana Bove) Date: Wed, 11 May 2022 15:04:49 +0200 Subject: [TYPES/announce] Workshop in honour of Thierry Coquand's 60th birthday Message-ID: <8dfa035b-2483-c8c5-2fcc-548f589ea7ee@chalmers.se> Thierry Coquand, professor at the University of Gothenburg in Sweden, had his 60th birthday on 18 April 2021. We are organizing a scientific meeting to celebrate him and his seminal contributions to mathematical logic, constructive mathematics, theoretical computer science, and the development of proof assistants for type theory. The celebration was originally planned to take place in direct connection with Thierry?s birthday, but had to be postponed several times because of the pandemic. The meeting will take place in Gothenburg on 24?26 August 2022, and is open to everyone who wants to join the celebration. It is free of charge, except that participants who wish to join the banquet in the evening on Thursday 25th of August have to pay their bill directly to the restaurant. Participants are also asked to arrange their own travel and accommodation. For more information about the meeting please visit the workshop's page at https://urldefense.com/v3/__https://tc60.cse.chalmers.se/__;!!IBzWLUs!RUBHGEIqdsOWS8gIHLHgWCj-btE3I11wKkNK-3qyzSYOxB_Ot9K9643Qsbwvq7cQ7u14I9ZY61_sdvUfTeELNtNNrJdPRg$ . If you plan to attend the meeting, we kindly ask you to fill in the registration form (available from the link above) by June 30th at the latest so we can plan catering and dinner. Sincerely, the organising committee Andreas Abel, Ana Bove, Peter Dybjer, Peter LeFanu Lumsdaine and Anders M?rtberg -- -- Ana Bove, Docent email: bove(at)chalmers.se Phone: (46)(31)7721020 https://urldefense.com/v3/__http://www.cse.chalmers.se/*bove__;fg!!IBzWLUs!RUBHGEIqdsOWS8gIHLHgWCj-btE3I11wKkNK-3qyzSYOxB_Ot9K9643Qsbwvq7cQ7u14I9ZY61_sdvUfTeELNtMnAfW8og$ Department of Computer Science and Engineering Chalmers Univ. of Technology and Univ. of Gothenburg From evan.cavallo at math.su.se Wed May 11 10:36:16 2022 From: evan.cavallo at math.su.se (Evan Cavallo) Date: Wed, 11 May 2022 16:36:16 +0200 Subject: [TYPES/announce] Extended Deadline for HoTT/UF 2022: 15 May Message-ID: <45c07049-ce21-0006-d605-b968d83e3550@math.su.se> We have extended the submission deadline for HoTT/UF abstracts to 15 May. Note that we will support remote speakers and participation. ========================================================== EXTENDED CALL FOR CONTRIBUTIONS 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!SslTNGuf89EsQU5HdWhAYFMIEHMGDWsz3N-GkdKEHgJwLC0Un0vMLatkNqh9NCZXwZBeFu2z5s1ZNiIzda95dEx8NyFHryND5fNDNsU$ Co-located with FSCD 2022 https://urldefense.com/v3/__http://www.cs.tau.ac.il/*nachumd/FSCD/__;fg!!IBzWLUs!SslTNGuf89EsQU5HdWhAYFMIEHMGDWsz3N-GkdKEHgJwLC0Un0vMLatkNqh9NCZXwZBeFu2z5s1ZNiIzda95dEx8NyFHryNDGMz8F2c$ Abstract submission deadline: **15 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. The workshop will be held in person, and remote participation will be supported. Specifically, talks will be streamed for remote viewers given speaker permission, and we will support streamed or recorded talks from remote speakers. ============================ # Invited speakers * Eric Finster (University of Birmingham) * Kristina Sojakova (INRIA Paris) * Taichi Uemura (Stockholm University) ================ # Submissions * Abstract submission deadline: **15 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!SslTNGuf89EsQU5HdWhAYFMIEHMGDWsz3N-GkdKEHgJwLC0Un0vMLatkNqh9NCZXwZBeFu2z5s1ZNiIzda95dEx8NyFHryNDJIGIoCE$ . 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. ================ # Financial support Limited financial support will be available to subsidize participation costs. Priority will be given to women and members of under-represented minorities, including representatives of developing countries. Please contact the organizers via evan.cavallo at math.su.se for more information. ====================== # Program committee * Benedikt Ahrens (TU Delft and University of Birmingham) * Carlo Angiuli (Carnegie Mellon University) * Evan Cavallo (Stockholm University) * Chris Kapulkin (University of Western Ontario) * Nicolai Kraus (University of Nottingham) * Peter LeFanu Lumsdaine (Stockholm University) * Anja Petkovi? Komel (TU Wien) * 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 (University of Birmingham) * Evan Cavallo (Stockholm University) * Chris Kapulkin (Western University) * Anja Petkovi? Komel (TU Wien) * Paige Randall North (University of Pennsylvania) From antti.hyvarinen at gmail.com Wed May 11 10:56:23 2022 From: antti.hyvarinen at gmail.com (=?UTF-8?Q?Antti_Hyv=C3=A4rinen?=) Date: Wed, 11 May 2022 16:56:23 +0200 Subject: [TYPES/announce] Deadline extension: SMT Workshop 2022 Message-ID: (Apologies for multiple posts) ================================================================= Deadline extension: SMT Workshop 2022 News: - travel grants - invited speakers ================================================================= Due to a number of requests, we have decided to extend the submission deadline for SMT Workshop 2022. The new submission deadline for full papers is *EXTENDED TO* May 24, 2022 23.59 AoE The new submission deadline for abstracts is *EXTENDED TO* May 22, 2022 23.59 AoE We use this occasion to announce that, thanks to the generosity of our sponsors, we are able to offer three travel grants of 1000 USD each. We plan to offer these funds to students, who may have limited travel funding and have a paper accepted to the workshop. Finally, we want to advertise that our invited speakers will be Aina Niemetz and Grigore Rosu. The full call for papers can be found at the workshop web page https://urldefense.com/v3/__http://smt-workshop.cs.uiowa.edu/2022/__;!!IBzWLUs!VAuL4gZvdVnMfGR7tUPaV-n41YfaemRVlTT6htDREdmSDFivxS4KYuyutHBnWgcgn6YhOYJZMkkHIgBI0dfqFlczRj0dpHWDP2Cq-3XL$ In case you have further questions, please contact us, the PC chairs. Best regards, Antti and David From Vlad.Rusu at inria.fr Thu May 12 03:23:59 2022 From: Vlad.Rusu at inria.fr (vlad) Date: Thu, 12 May 2022 09:23:59 +0200 Subject: [TYPES/announce] second CFP: 6th Working Formal Methods Symposium Message-ID: <715e3923-7989-c194-dcda-caf25f902a98@inria.fr> ?? FROM 2022 - Working Formal Methods Symposium ????? Iasi, Romania, 19-20 September 2022 ?????? https://urldefense.com/v3/__https://project.inria.fr/from22/__;!!IBzWLUs!Xt4w9TfZ0GROb5oamXm9ezBhZFeXBI0m21RTV0Dt5vRItYp32Bj-YoUnP2WnJEh26OH_0Nd8s9OJJsXxDZQ8VyR9Z8XeBRXZxw$ ?????? in conjunction with WOLLIC 2022 ??????? https://urldefense.com/v3/__https://wollic2022.github.io__;!!IBzWLUs!Xt4w9TfZ0GROb5oamXm9ezBhZFeXBI0m21RTV0Dt5vRItYp32Bj-YoUnP2WnJEh26OH_0Nd8s9OJJsXxDZQ8VyR9Z8UeEuOY1Q$ FROM aims to bring together? researchers and practitioners who work on formal? methods? by? contributing new? theoretical? results, methods, techniques, and frameworks, and/or make? the formal methods to work by creating or using software tools that apply theoretical contributions. FROM? symposiums? are organized? by? the? Faculty of? Mathematics and Computer? Science? of the? University? of? Bucharest, the Faculty? of Mathematics? and Computer? Science of? the Babes-Bolyai University of Cluj-Napoca, the? Faculty of? Computer Science? of the? Alexandru Ioan Cuza University of? Iasi, and the Faculty of? Mathematics and Computer Science of the West University of Timi?oara. FROM 2022? is the sixth event? in a yearly workshop? series. The first edition was held in 2017 in? Bucharest, the second edition was held in 2018 in? Ia?i, the third? edition was held? in 2019 in? Timi?oara. The fourth edition was organized in Cluj-Napoca in 2020 as a virtual event due to the COVID-19 pandemic.? The fifth edition (2021), in Timi?oara, was also organized? as a virtual event.? The program? of the symposium includes invited? lectures and? regular contributions. Submissions on the general? topics of? formal methods, theoretical? computer science, logic and applications are welcome. Important Dates --------------- Abstract submission:??? July 8, 2022 Paper submission:??? July 15, 2022 Author notification:??? August 25, 2022 Symposium days: ??? September 19-20, 2022 Topics of interest ------------------ Areas and formalisms of interest include: + Category theory in computer science + Distributed systems and concurrency + Formal languages and automata theory + Formal modelling, verification and testing + Logic in computer science + Logical frameworks + Mathematical structures in computer science + Models of computation + Semantics of programming languages + Type systems + Domain Science and Engineering Methods of interest include: + Automated reasoning and model generation + Automated induction + Certified programs + Data-flow and control-flow analysis + Deductive verification + Mechanized proofs + Model checking + Proof mining + Symbolic computation + Term rewriting Applications of interest include: + Computational logic + Computer mathematics + Knowledge representation, ontology reasoning, deductive databases + Program analysis + Verification and synthesis of software and hardware + Uncertainty reasoning and soft computing Publication ----------- Accepted research? papers should? be presented? at the? conference and will be? published in the? Electronic Proceedings in? Computer Science series https://urldefense.com/v3/__http://www.eptcs.org/__;!!IBzWLUs!Xt4w9TfZ0GROb5oamXm9ezBhZFeXBI0m21RTV0Dt5vRItYp32Bj-YoUnP2WnJEh26OH_0Nd8s9OJJsXxDZQ8VyR9Z8UyLd6rLQ$ We? intend to invite authors? of the best original? contributions --? regular? or short? --? to submit extended versions to? a special issue of? a journal. For previous editions, we published? selected? papers? in? Fundamenta? Informaticae? (2018) and Journal of Logical and Algebraic Methods in Programming (2019). Submissions ----------- Papers of? up to? 16 pages? prepared according? to the? EPTCS template https://urldefense.com/v3/__http://style.eptcs.org/__;!!IBzWLUs!Xt4w9TfZ0GROb5oamXm9ezBhZFeXBI0m21RTV0Dt5vRItYp32Bj-YoUnP2WnJEh26OH_0Nd8s9OJJsXxDZQ8VyR9Z8VJkPw9mQ$ ? must? be?? submitted? electronically through EasyChair https://urldefense.com/v3/__https://easychair.org/conferences/?conf=from22__;!!IBzWLUs!Xt4w9TfZ0GROb5oamXm9ezBhZFeXBI0m21RTV0Dt5vRItYp32Bj-YoUnP2WnJEh26OH_0Nd8s9OJJsXxDZQ8VyR9Z8V7wdW8QA$ Research papers? must contain original research? results not submitted and? not published? elsewhere. Authors? who? want to? present work? in progress or? discuss new aspects or? a survey of their? older research results at the workshop are welcome to submit an extended abstract (up to 8? pages). Papers? will be? refereed and accepted? on the basis of their scientific merit and relevance to the symposium's topics. Registration ------------ The planned registration fee? is? 100? Euro.? It? covers? the symposium kit, refreshments during breaks, lunches, symposium dinner, publication. Invited Speakers ---------------- Dines Bj?rner, Technical University of Denmark Denisa Diaconescu, University of Bucharest? & Runtim Verification Inc. Thomas Genet, University of Rennes Ioana Leustean, University of Bucharest Dorel Lucanu, Alexandru Ioan Cuza University of Iasi Luigia Petre,? ?bo Akademi University Program Committee ------------------- Andrei Arusoaie, Alexandru Ioan Cuza University of Iasi Dines Bj?rner, Technical Univesity of Denmark Florin Craciun, Babes-Bolyai University of Cluj-Napoca Catalin Dima, Universit? Paris-Est Cr?teil Madalina Erascu, West University of Timisoara & e-Austria Institute Laurentiu Leustean, University of Bucharest Dorel Lucanu, Alexandru Ioan Cuza University of Iasi Simona Motogna, Babes-Bolyai University of Cluj-Napoca David Nowak, CNRS & University of Lille Peter Csaba ?lveczky, University of Oslo Corina Pasareanu, Nasa & Carnegie Mellon University Luigia Petre, ?bo Akademi University Vlad Rusu, INRIA Lille (chair) Viorica Sofronie-Stokkermans, University of Koblenz-Landau Organising Committee -------------------- Andrei Arusoaie, Alexandru Ioan Cuza University of Iasi Rodica Bozianu, Alexandru Ioan Cuza University of Iasi Vlad Rusu, INRIA Lille From A.Das at bham.ac.uk Thu May 12 12:31:47 2022 From: A.Das at bham.ac.uk (Anupam das) Date: Thu, 12 May 2022 16:31:47 +0000 Subject: [TYPES/announce] Postdoc in Proof Theory - University of Birmingham, UK Message-ID: <2e3027de-99c4-248f-b70b-bf988b619665@bham.ac.uk> Research Fellow in Proof Theory - University of Birmingham, UK. The School of Computer Science at the University of Birmingham is seeking to appoint a Research Fellow (postdoc) in Proof Theory, to be employed until (at least) the end of April 2024. The Theory group at the University of Birmingham is one of the leading groups in logical foundations of computer science, with expertise not only in Proof Theory but also related areas such as Type Theory, Category Theory and Mathematical Logic: This position is funded by a UKRI Future Leaders Fellowship "StrIP: Structure vs Invariants in Proofs", led by Dr Anupam Das. The project aims to develop the theory of 'cyclic proofs' and their connections to automata theory, programming languages, and structural proof theory. The principal responsibility of the fellow will be to conduct research, both collaboratively with Dr Das and other researchers at Birmingham, and independently. The fellow will also be supported in career development and encouraged to pursue independent opportunities. Qualifications and expertise You will have (or be close to completing) a PhD in logic (computer science, mathematics or philosophy), or equivalent qualifications. You will have an excellent research record, with expertise in some of the following areas: * Proof theory (in particular, deep inference, cyclic proofs, and/or computational interpretations). * Automata theory (in particular, infinite word and tree automata). * Mathematical logic (in particular, fragments of arithmetic or set theory). Application Informal inquiries prior to application are encouraged and should be directed to Dr Anupam Das . You may find further details on the position and instructions for applying here: Practical information Starting salary range: ?31,406 - ?40,927 (potentially progressing to ?43,434). Application deadline: 29 May 2022. Starting date: ideally September 2022. Duration: until 30 April 2024. From serge.autexier at dfki.de Fri May 13 02:48:55 2022 From: serge.autexier at dfki.de (Serge Autexier) Date: Fri, 13 May 2022 08:48:55 +0200 (CEST) Subject: [TYPES/announce] CICM 2022, Abstract Submnission Deadline Extension May 23rd, 2022; uodate hybrid conference format; 15th Conf. Intelligent Computer Mathematics Message-ID: <20220513064855.F251257399E1@gigondas.localdomain> *** Apologies for cross postings *** [Abstract Submission Deadline Extended to May 23, 2022 Update Information on hybrid format] Call for Papers formal papers - informal papers - doctoral programme 15th Conference on Intelligent Computer Mathematics - CICM 2022 - September 19-23, 2022 Tbilisi, Georgia (hybrid event) https://urldefense.com/v3/__http://www.cicm-conference.org/2022__;!!IBzWLUs!T1g8_MtXLnJM5bWbXNs_6a8lIUrLZIRkL6ZQE89-NL0od0SiwZNvphM8EUc4gaRLVPNHwm99JmhwGj5zFVPVgGVNV_KvR39k1xfaA9eI$ ---------------------------------------------------------------------- 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: * Erika Abraham (RWTH Aachen University) * Deyan Ginev (FAU Erlangen-N?rnberg and NIST) * S?bastien Gou?zel (IRMAR, Universit? de Rennes 1) CICM 2022 Programme committee: see https://urldefense.com/v3/__https://www.cicm-conference.org/2022/cicm.php?event=&menu=pc__;!!IBzWLUs!T1g8_MtXLnJM5bWbXNs_6a8lIUrLZIRkL6ZQE89-NL0od0SiwZNvphM8EUc4gaRLVPNHwm99JmhwGj5zFVPVgGVNV_KvR39k1yodl9gP$ 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. *** Participation / Hybrid Event *** CICM 2022 wil be held as an hybrid event, participation is possible online or on-site. Authors of accepted papers can choose to present online or on-site, but at least one author needs to register for the conference. *** Important Dates *** - Abstract deadline: May 23 (extended) - Full paper deadline: May 27 (extended) - 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!T1g8_MtXLnJM5bWbXNs_6a8lIUrLZIRkL6ZQE89-NL0od0SiwZNvphM8EUc4gaRLVPNHwm99JmhwGj5zFVPVgGVNV_KvR39k13TvaUaJ$ 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!T1g8_MtXLnJM5bWbXNs_6a8lIUrLZIRkL6ZQE89-NL0od0SiwZNvphM8EUc4gaRLVPNHwm99JmhwGj5zFVPVgGVNV_KvR39k178ob73v$ From W.S.Swierstra at uu.nl Fri May 13 08:53:54 2022 From: W.S.Swierstra at uu.nl (Swierstra, W.S. (Wouter)) Date: Fri, 13 May 2022 12:53:54 +0000 Subject: [TYPES/announce] Final call for participation: Advanced Functional Programming Summer School in Utrecht Message-ID: # Call for Participation SUMMER SCHOOL ON ADVANCED FUNCTIONAL PROGRAMMING Utrecht, the Netherlands, 04 July ? 08 July 2022 https://urldefense.com/v3/__http://www.afp.school__;!!IBzWLUs!T6fqheCP2ksYYIIyOpesZ_89EAY2R2ifkiNflwTiptaGFYkzOSjxnAS8frO__xp1cCZdkuhSuHXG46psTkGMQy5988v_No506Be2IA$ **Please register before June 17th ** ## ABOUT The Advanced Functional Programming summer school has been running for more than ten years. We aim to educate aspiring Haskell programmers beyond the basic material covered by many textbooks. After running remotely for the past two years, we're thrilled to announce that this year's edition will take place on site in Utrecht. We are monitoring the pandemic closely - and will make contingency plans if we cannot meet in person; at the moment, we do not have plans for remote participation. The lectures will cover several more advanced topics regarding the theory and practice of Haskell programming, including topics such as: * lambda calculus; * monads and monad transformers; * lazy evaluation; * generalized algebraic data types; * type families and type-level programming; * concurrency and parallelism. The summer school consists of a mix of lectures, labs, and a busy social program. ## LECTURERS Utrecht staff: * Gabriele Keller * Trevor McDonell * Wouter Swierstra ## PREREQUISITES We expect students to have a basic familiarity with Haskell already. You should be able to write recursive functions over algebraic data types, such as lists and trees. There is a great deal of material readily available that covers this material. If you've already started learning Haskell and are looking to take your functional programming skills to the next level, this is the course for you. ## DATES **Registration deadline: June 17th, 2022** School: 04 July ? 08 July 2022 ## COSTS 750 euro - Profession registration only 250 euro - Student registration fee 200 euro - Housing fee We will charge a registration fee of 750 euros (or 250 euros for students) to cover our expenses. If this is problematic for you for any reason at all, please email the organisers and we can try to offer you a discounted rate or a fee waiver. We have a limited number of scholarships or discounts available for students that would not be able to attend otherwise, especially for women and under-represented minorities. ## FURTHER INFORMATION Further information, including instructions on how to register, is available on our website: https://urldefense.com/v3/__http://www.afp.school__;!!IBzWLUs!T6fqheCP2ksYYIIyOpesZ_89EAY2R2ifkiNflwTiptaGFYkzOSjxnAS8frO__xp1cCZdkuhSuHXG46psTkGMQy5988v_No506Be2IA$ From eacsl.ls1 at cs.tu-dortmund.de Fri May 13 09:47:30 2022 From: eacsl.ls1 at cs.tu-dortmund.de (EACSL Mail-Account) Date: Fri, 13 May 2022 15:47:30 +0200 Subject: [TYPES/announce] ACKERMANN AWARD 2022: 2ND CALL FOR NOMINATIONS Message-ID: ACKERMANN AWARD 2022 - THE EACSL OUTSTANDING DISSERTATION AWARD FOR LOGIC IN COMPUTER SCIENCE CALL FOR NOMINATIONS (Note: there are no changes since the first call for nominations. However, since the first call was sent out in February and the deadline is July, a reminder might be helpful. Apologies for the extra mail.) Nominations are 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 daniel.marsden at cs.ox.ac.uk Fri May 13 10:50:08 2022 From: daniel.marsden at cs.ox.ac.uk (Daniel Marsden) Date: Fri, 13 May 2022 14:50:08 +0000 Subject: [TYPES/announce] Structure meets Power workshop 2022 (Extended deadline) Message-ID: **************************************** * 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!WCBReaLvEDM3lQKi5Ccqc3xMeA7e8NFqYmDTT7kU5ODDz92sJMUkC_ruzsUQrMBQKSjTSJ0YhcY6mX5B3820G8WbIiGA8WPsYmqmF4jlo6A$ 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: 27 May 2022 (extended) 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!WCBReaLvEDM3lQKi5Ccqc3xMeA7e8NFqYmDTT7kU5ODDz92sJMUkC_ruzsUQrMBQKSjTSJ0YhcY6mX5B3820G8WbIiGA8WPsYmqm7qnfowU$ 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 ------------ There will be two types of participation, online and on-site participation. For online participation it is mandatory to fill in the following form: https://urldefense.com/v3/__https://www.cst.cam.ac.uk/conference/structure-meets-power-2022/registration-online-participation__;!!IBzWLUs!WCBReaLvEDM3lQKi5Ccqc3xMeA7e8NFqYmDTT7kU5ODDz92sJMUkC_ruzsUQrMBQKSjTSJ0YhcY6mX5B3820G8WbIiGA8WPsYmqm0SMP5dg$ For on-site participation one must fill in the ICALP registration form: https://urldefense.com/v3/__https://icalp2022.dakini-pco.com/__;!!IBzWLUs!WCBReaLvEDM3lQKi5Ccqc3xMeA7e8NFqYmDTT7kU5ODDz92sJMUkC_ruzsUQrMBQKSjTSJ0YhcY6mX5B3820G8WbIiGA8WPsYmqmOlh2kc4$ Note that online participation is free and on-site participation costs 50 euros which includes 2 coffee breaks and lunch. Organising and Programme Committee: ----------------------------------- * Samson Abramsky * Anuj Dawar * Tomas Jakl * Dan Marsden -------------- next part -------------- An HTML attachment was scrubbed... URL: From bpientka at cs.mcgill.ca Fri May 13 13:28:53 2022 From: bpientka at cs.mcgill.ca (Brigitte Pientka) Date: Fri, 13 May 2022 17:28:53 +0000 Subject: [TYPES/announce] Call for Presentations for "Teaching Functional Programming in OCaml" as part of the OCaml Workshop 2022 Message-ID: <13A6D6DC-88B6-4194-B9A6-F4EB3C5763D0@cs.mcgill.ca> **** Special Session / Call for Presentations for "Teaching Functional Programming in OCaml" as part of the OCaml Workshop 2022 **** Abstract Submission: 6 June 2022 Author Notification: 7 July 2022 OCaml Workshop : 9 Sept 2022 The OCaml Workshop 2022, co-located with ICFP 2022, will take place the 2022-09-16 and will be held at Ljubljana, Slovenia. This year, we would like to organize a special session on "Teaching Functional Programming in OCaml". Hence, we would like to encourage and invite submissions for presentations that highlight teaching practices and innovation that highlights how OCaml is taught around the globe and the wide range of tools and strategies that have been developed to teach effectively functional programming using OCaml. In particular, we are interested in automated program evaluation / grading tools / error analysis (both type and syntax errors) for OCaml programs, tools that provide assistance in practical lessons (such as pair programming for example), Jupiter notebooks like solutions to interactively introduce programming concepts, or full featured web platforms. We are particularly seeking contributions and experience reports of the Learn-OCaml online programming environment which has been used by the OCaml teaching community for online but also for regular in-person class. The goal is to share experiences, exchange ideas and tools, and promote best practices. Interested researchers are invited to submit and register a description of the talk (about 2 pages long) at https://ocaml2022.hotcrp.com/ providing a clear statement of what will be provided by the presentation: the problems that are addressed, the solutions or methods that are proposed. LaTeX-produced PDFs are a common and welcome submission format. For accessibility purposes, we ask PDF submitters to also provide the sources of their submission in a textual format, such as .tex sources. Reviewers may read either the submitted PDF or the text version. The OCaml workshop and this special session is an informal meeting with no formal proceedings. The presentation material will be available online from the workshop homepage. The presentations may be recorded and made available at a later date. The main presentation format is a workshop talk, traditionally around 20 minutes in length, plus question time, but we also have a poster session during the workshop - this allows to present more diverse work, and gives time for discussion. The program committee for the OCaml Workshop will decide which presentations should be delivered as posters or talks. Sim?o Melo de Sousa (University of Beira Interior) Brigitte Pientka (McGill University) Yann Regis-Gianas (Paris Diderot University) Xujie Si (McGill University) -------------- 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 sperber at deinprogramm.de Sat May 14 07:38:01 2022 From: sperber at deinprogramm.de (Michael Sperber) Date: Sat, 14 May 2022 13:38:01 +0200 Subject: [TYPES/announce] Final 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!VRg7YPaEWbhsLqWY_YeBoNLvcF4aACYM-JRImZg5P6hmK4_DjZNhcqdwvDeuJM_aup1esmaF0VcUc9dCp4RmoGQZ-I-39XvbgwI6$ =============================================================================== 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!VRg7YPaEWbhsLqWY_YeBoNLvcF4aACYM-JRImZg5P6hmK4_DjZNhcqdwvDeuJM_aup1esmaF0VcUc9dCp4RmoGQZ-I-39R-6fd3h$ ), 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!VRg7YPaEWbhsLqWY_YeBoNLvcF4aACYM-JRImZg5P6hmK4_DjZNhcqdwvDeuJM_aup1esmaF0VcUc9dCp4RmoGQZ-I-39R-6fd3h$ ), 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!VRg7YPaEWbhsLqWY_YeBoNLvcF4aACYM-JRImZg5P6hmK4_DjZNhcqdwvDeuJM_aup1esmaF0VcUc9dCp4RmoGQZ-I-39dQ7hqgK$ ) 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 gorla at di.uniroma1.it Sun May 15 01:49:00 2022 From: gorla at di.uniroma1.it (Daniele Gorla) Date: Sun, 15 May 2022 07:49:00 +0200 Subject: [TYPES/announce] ICTCS'22: Final CFP with deadlines extended 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!XVxiOUfBpkX7FLwOF82vp1Ued4DiGzfkXH-L-2c7FofKw68J3jORMP7QP5v0SUQIeEygHguR5xP1KXQqHI5FJvhw0mTtXKpTlw$ FINAL CALL FOR PAPERS (deadlines extended) ================ 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 (at https://urldefense.com/v3/__https://easychair.org/my/conference?conf=ictcs2022__;!!IBzWLUs!XVxiOUfBpkX7FLwOF82vp1Ued4DiGzfkXH-L-2c7FofKw68J3jORMP7QP5v0SUQIeEygHguR5xP1KXQqHI5FJvhw0mQ4YNxVVw$ ). 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 22nd, 2022 Paper submission: May 25th, 2022 Notification: June 30th, 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!XVxiOUfBpkX7FLwOF82vp1Ued4DiGzfkXH-L-2c7FofKw68J3jORMP7QP5v0SUQIeEygHguR5xP1KXQqHI5FJvhw0mSLwx87jg$ ================================ -------------- next part -------------- An HTML attachment was scrubbed... URL: From stefan.ciobaca at gmail.com Sun May 15 07:13:55 2022 From: stefan.ciobaca at gmail.com (Stefan Ciobaca) Date: Sun, 15 May 2022 14:13:55 +0300 Subject: [TYPES/announce] WPTE 2022 final CFP (deadline: 31 May, publication JLAMP) Message-ID: 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!TcUpBlpiPmFXn_2CaOm7DXqDXZxz0JxRSdQYCvHTYK33fNS6zEyBkm4zddlBgaU8UbCNOsX-sQBOiJbGVKMmL5BTdOyRYRfrNn94Imk$ Submit: https://urldefense.com/v3/__https://easychair.org/conferences/?conf=wpte2022__;!!IBzWLUs!TcUpBlpiPmFXn_2CaOm7DXqDXZxz0JxRSdQYCvHTYK33fNS6zEyBkm4zddlBgaU8UbCNOsX-sQBOiJbGVKMmL5BTdOyRYRfr_d-RbJo$ Deadline: 31 May 2022 (AOE, extended, firm) Publication: post-proceedings as special issue in the Journal of Logical and Algebraic Methods in Programming --------------------------------------------------------------------------- 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 via https://urldefense.com/v3/__https://easychair.org/conferences/?conf=wpte2022__;!!IBzWLUs!TcUpBlpiPmFXn_2CaOm7DXqDXZxz0JxRSdQYCvHTYK33fNS6zEyBkm4zddlBgaU8UbCNOsX-sQBOiJbGVKMmL5BTdOyRYRfr_d-RbJo$ . 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 (including work-in-progress): May 31, 2022 (AoE, extended, firm) 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 antonios at ru.is Sat May 14 14:06:16 2022 From: antonios at ru.is (Antonios Achilleos) Date: Sat, 14 May 2022 18:06:16 +0000 Subject: [TYPES/announce] Open postdoc or PhD position at Reykjavik University, department of Computer Science Message-ID: <5a26210969874c21b1c971c97f34d9ce@ru.is> Mode(l)s of Verificaton and Monitorability Department of Computer Science, Reykjavik University One postdoc or PhD position We invite applications for one postdoc or PhD position at the Department of Computer Science of Reykjavik University. The position is part of a research project funded by the Icelandic Research Fund, under the direction of Antonis Achilleos (Reykjavik University), Luca Aceto (Reykjavik University), and Anna Ingolfsdottir (Reykjavik University) in cooperation with Adrian Francalanza (University of Malta) and Karoliina Lehtinen (LIS, Aix-Marseille). The project continues previous work in the theoretical foundations of runtime verification. Its overarching goal is to better understand the properties and push the limits of monitorability in different settings. For more information on the project, please visit https://urldefense.com/v3/__http://icetcs.ru.is/movemnt/__;!!IBzWLUs!SqnI2v61RR0gCLa766aYuobvISCNStIe7shwCYrwdB-Innk3_gKbVzaoHJ8jKO6GQebsNu6uGqc1AeAR_aH8258PZrWppg$ or contact Antonis Achilleos (email: antonios at ru.is) The successful candidate will benefit from, and contribute to, the research environment at the Icelandic Centre of Excellence in Theoretical Computer Science (ICE-TCS), with research groups on concurrency, logic and semantics, algorithms, and combinatorics. For information about ICE-TCS and its activities, see https://urldefense.com/v3/__http://icetcs.ru.is/__;!!IBzWLUs!SqnI2v61RR0gCLa766aYuobvISCNStIe7shwCYrwdB-Innk3_gKbVzaoHJ8jKO6GQebsNu6uGqc1AeAR_aH825-l0QVXKg$ . Moreover, they will cooperate with Adrian Francalanza and Karoliina Lehtinen during the project work and will benefit from the interaction with their research groups at the University of Malta and LIS, Aix-Marseille. *Qualification requirements* Applicants for the postdoctoral position should have, or be about to defend, a PhD degree in computer science or a closely related field. Moreover, previous knowledge in logic, concurrency theory, or any of the project's related areas, and mathematical competence are desirable. Applicants for the PhD fellowship should have, or be about to obtain, an MSc degree in Computer Science, or closely related fields. Some background in logic, concurrency theory, or some other of the project's related areas, and mathematical competence are desirable. *Remuneration* The PhD position provides a stipend of 412,000 ISK per month before taxes, and the salary for the postdoc position is 605,000 ISK per month before taxes. *Start date and duration* The postdoc position is for one year and can be renewed for one more year, based on mutual agreement. The PhD position is for three years. The intended start date is August 1st 2022, or soon thereafter. *Application details* Interested applicants should send their CV, including a list of publications, in PDF to all the addresses below, together with a statement outlining their suitability for the project and the names of at least two referees. Antonis Achilleos email: antonios at ru.is Luca Aceto email: luca at ru.is Anna Ingolfsdottir email: annai at ru.is Adrian Francalanza email: adrian.francalanza at um.edu.mt Karoliina Lehtinen email: lehtinen at lis-lab.fr Informal inquiries about the project and the conditions of work are very welcome. We will start reviewing applications as soon as they arrive and will continue to accept applications until the position is filled. We strongly encourage interested applicants to send their applications as soon as possible and no later than 19 June 2022. -------------- next part -------------- An HTML attachment was scrubbed... URL: From beniamino.accattoli at inria.fr Mon May 16 10:07:24 2022 From: beniamino.accattoli at inria.fr (Beniamino Accattoli) Date: Mon, 16 May 2022 16:07:24 +0200 (CEST) Subject: [TYPES/announce] PPDP 2022 - 3rd Call for Papers - deadline extended Message-ID: <435849789.10340655.1652710044514.JavaMail.zimbra@inria.fr> [ Apologies for multiple postings ] [ * * Deadline extended: 25.05 abstracts / 01.06 papers * * ] =============================== PPDP 2022 - 3rd Call for Papers =============================== 24th International Symposium on Principles and Practice of Declarative Programming 20-22 September 2022, Tbilisi, Georgia Co-located with LOPSTR 2022 as part of CLAS 2022 The conference will be held as a hybrid (blended) meeting, both in-person and virtual. https://urldefense.com/v3/__https://software.imdea.org/Conferences/PPDP2022/__;!!IBzWLUs!TqIHyMK0-jdkFwOqA4abRqpKs8zTodLg4X8ISgYzDc0NFD3e2nBqU6JeX_jJ9m1zKwrxKYJ8c_X0JwKyBKLIBZ5fwsqfnQtKK1EioZuZozI$ ================================================= Latest news: - Deadline extended - Invited speakers announced. - Conference to be held as blended meeting, in-person and virtual. - Proceedings published by ACM in the ICPS series. - A selection of the best papers will be invited for submission to TPLP as rapid publications. ================================================= Important Dates --------------- - (15.05.2022) AoE title and abstract submission -> Extended to 25.05.2022 - (22.05.2022) AoE paper submission -> Extended to 01.06.2022 - 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!TqIHyMK0-jdkFwOqA4abRqpKs8zTodLg4X8ISgYzDc0NFD3e2nBqU6JeX_jJ9m1zKwrxKYJ8c_X0JwKyBKLIBZ5fwsqfnQtKK1EipkvoJmA$ Submission Categories --------------------- Submissions can be made in three categories: - Research Papers, - System Descriptions, - Experience Reports. Submissions of Research Papers must present original research which is unpublished and not submitted elsewhere. They must not exceed 12 pages ACM sigconf style, 2-column (including figures, but excluding bibliography). See below for further formatting instructions. 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. Format of a submission: For each paper category, you must follow the instructions of the new ACM Primary Article Templates. You must use the LaTeX sigconf proceedings template as the conference organizers are unable to process final submissions in other formats. In case of problems with the templates, please contact ACM's TeX support team at Aptara. Authors should note ACM's statement on author's rights which apply to final papers. Submitted papers should meet the requirements of ACM's plagiarism policy. Final publication will follow the new ACM Primary Article TAPS Publication Workflow. Invited Speakers ---------------- Niki Vazou, IMDEA Software Institute Florian Zuleger, Technische Universitaet Wien Torsten Grust, University of Tuebingen Program Committee ------------------ Beniamino Accattoli, Inria & LIX Ecole 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, Universite 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, Universite Paris-Sud 11, France Carlos Olarte, LIPN, Universite 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 Graham.Hutton at nottingham.ac.uk Tue May 17 03:05:23 2022 From: Graham.Hutton at nottingham.ac.uk (Graham Hutton) Date: Tue, 17 May 2022 07:05:23 +0000 Subject: [TYPES/announce] Assistant Professorships in Nottingham Message-ID: <7C836F2B-992A-4CB0-8B89-E8F82F6F5474@nottingham.ac.uk> Dear all, As part of a strategic expansion, the School of Computer Science at the University of Nottingham is seeking to make multiple new appointments at the Assistant Professor level: https://urldefense.com/v3/__https://tinyurl.com/38f753d5__;!!IBzWLUs!XgdsBN7v5m97ns_L16LPa2JudjAiJwCd2wlqITqo0Ts4JhmwQykdSfXnO9f6oyl9fAcBwKWiOMGUN2VyZtPEXOAsgOGBH6kesC2rCcQdVBV5kQ$ These positions are aimed at early career academics who recently completed or will soon complete their PhD, and have a reduced teaching responsibility for the first three years. Applications in the area of the Functional Programming (FP) lab are strongly encouraged! The FP lab is keen to receive applications from candidates with a strong publication record (e.g. papers in leading venues such as LICS, POPL, ICFP, JFP, TOPLAS, etc) and the potential to secure external funding. The group recently grew its profile in type theory with the appointment of Nicolai Kraus and Ulrik Buchholtz. To complement these appointments, we particularly welcome applications from candidates who would bring further or other areas of expertise. Further information about the FP lab is available from: https://urldefense.com/v3/__https://tinyurl.com/y2ekdkqa__;!!IBzWLUs!XgdsBN7v5m97ns_L16LPa2JudjAiJwCd2wlqITqo0Ts4JhmwQykdSfXnO9f6oyl9fAcBwKWiOMGUN2VyZtPEXOAsgOGBH6kesC2rCcT44Tc-ew$ The deadline for applications is Tuesday 24th May 2022. -- Graham Hutton and Thorsten Altenkirch This message and any attachment are intended solely for the addressee and may contain confidential information. If you have received this message in error, please contact the sender and delete the email and attachment. Any views or opinions expressed by the author of this email do not necessarily reflect the views of the University of Nottingham. Email communications with the University of Nottingham may be monitored where permitted by law. From benoit.montagu at inria.fr Tue May 17 10:00:09 2022 From: benoit.montagu at inria.fr (Benoit Montagu) Date: Tue, 17 May 2022 16:00:09 +0200 Subject: [TYPES/announce] ML Family Workshop 2022: Final Call for Presentations Message-ID: We are happy to invite submissions to the ML Family Workshop 2022, to be held during the ICFP conference week on Thursday, September 15th. The ML family workshop warmly welcomes submission touching on the programming languages traditionally seen as part of the ?ML family? (Standard ML, OCaml, F#, CakeML, SML#, Manticore, MetaOCaml, etc.). The scope of the workshop includes all aspects of the design, semantics, theory, application, implementation, and teaching of the members of the ML family. We also encourage presentations from related languages (such as Haskell, Scala, Rust, Nemerle, Links, Koka, F*, Eff, ATS, etc), to exchange experience of further developing ML ideas. The workshop does not have proceedings, making it the perfect venue to run some ideas with the community or present some work in progress within a friendly environment. The PC has a broad expertise and submissions are 3 pages long: when in doubt, just submit! Currently, the workshop is scheduled to be an in-person event. We will give to the authors of accepted abstracts the opportunity to give their talks remotely if necessary, in case they could not travel. See the detailed CFP online on the ICFP website: https://urldefense.com/v3/__https://icfp22.sigplan.org/home/mlfamilyworkshop-2022*Call-for-Presentations__;Iw!!IBzWLUs!X2x2cN5coqOP7MSY7oxZ66tJNZ62zltJb5gSqrWkukj9cxK7uTFoZ1hjS4ayAwD47MhKA_kgw3vRocdJ2G0n6qS6H8G5saVz9ZDnNyaM$ Important dates --------------- ??? Friday 3th June (any time zone): Abstract submission deadline ??? Tuesday 28th June: Author notification ??? Thursday 15th August: ML Family Workshop Program committee ----------------- ??? Kenichi Asai (Ochanomizu University) ??? Arthur Azevedo de Amorim (Boston University) ??? Dariusz Biernacki (University of Wroc?aw) ??? Stephen Dolan (Jane Street) ??? Kavon Farvardin (Apple) ??? Arma?l Gu?neau (Inria) ??? Sam Lindley (University of Edinburgh) ??? Guido Mart?nez (CIFASIS-CONICET) ??? Keiko Nakata (SAP Innovation Center Potsdam) ??? Lionel Parreaux (Hong Kong University of Science and Technology) ??? Matija Pretnar (University of Ljubljana) ??? Mike Rainey (Carnegie Mellon University) ??? Yann R?gis-Gianas (Nomadic Labs) ??? KC Sivaramakrishnan (IIT Madras and Tarides) ??? Ningning Xie (University of Cambridge) ??? Chair: Beno?t Montagu (Inria) Submission details ------------------ See the online CFP for the details on the expected submission format. Submissions must be uploaded to the workshop submission website https://urldefense.com/v3/__https://ml2022.hotcrp.com/__;!!IBzWLUs!X2x2cN5coqOP7MSY7oxZ66tJNZ62zltJb5gSqrWkukj9cxK7uTFoZ1hjS4ayAwD47MhKA_kgw3vRocdJ2G0n6qS6H8G5saVz9dfT6qcy$ before the submission deadline. From lammich at in.tum.de Tue May 17 10:21:15 2022 From: lammich at in.tum.de (Peter Lammich) Date: Tue, 17 May 2022 16:21:15 +0200 Subject: [TYPES/announce] ICTAC'22 Last Call For Papers Message-ID: <131c927c-12b3-1f31-f3cc-2be021856e4f@in.tum.de> *** apologies for double-posting *** Taking into account the coronavirus pandemic and the war in Ukraine, the conference will be organized as a hybrid event. *************************************************************************** The 19th International Colloquium on Theoretical Aspects of Computing (ICTAC) Held in Tbilisi, Georgia, September 27-29, 2022 https://urldefense.com/v3/__https://viam.science.tsu.ge/clas2022/ictac/__;!!IBzWLUs!Tcj8ggP3XOxC3hb9hem4PkCEona0IZpaO5Rgaa1NUsvwfYAgp03yGnrjHvaG83OgSFIyrb01yQTs4dqmvAeb-vd-0fk1R35F$ Part of Computational Logic Autumn Summit (CLAS 2022) https://urldefense.com/v3/__https://viam.science.tsu.ge/clas2022__;!!IBzWLUs!Tcj8ggP3XOxC3hb9hem4PkCEona0IZpaO5Rgaa1NUsvwfYAgp03yGnrjHvaG83OgSFIyrb01yQTs4dqmvAeb-vd-0erl4vs_$ ***************************************************************************** Overview The ICTAC?conference series aims at bringing together researchers and practitioners from academia, industry and government to present research and exchange ideas and experience addressing challenges in both theoretical aspects of computing and the exploitation of theory through methods and tools for system development. ICTAC?also aims to promote research cooperation between developing and industrial countries. The conference concerns all aspects of theoretical computer science, including, but not limited to: Languages and automata Semantics of programming languages Logic in computer science Lambda calculus, type theory and category theory Domain-specific languages Theories of concurrency and mobility Theories of distributed computing Models of objects and components Coordination models Timed, hybrid, embedded and cyber-physical systems Security and privacy Static analysis Probabilistic and statistical verification Software verification Software testing Runtime verification Program generation and transformation Model checking and theorem proving Applications and case studies AI-enabled software development Theory and methods of trustworthy AI Important Dates Abstract submission: May 21, 2022 Paper Submission: May 28, 2022 Notification: July 24, 2022 Publication We solicit submissions, related to the topics of ICTAC, in the following categories: original research contributions (16 pages max, excluding references); applications and experiences (16 pages max, excluding references); short papers, with original work in progress or with proposals of new ideas and emerging challenges (6 pages max, excluding references); and tool papers (6 pages max, excluding references). All submissions must be original, unpublished, and not submitted concurrently for publication elsewhere. Paper submission is done via EasyChair at https://urldefense.com/v3/__https://easychair.org/conferences/?conf=ictac2022__;!!IBzWLUs!Tcj8ggP3XOxC3hb9hem4PkCEona0IZpaO5Rgaa1NUsvwfYAgp03yGnrjHvaG83OgSFIyrb01yQTs4dqmvAeb-vd-0WjHRl1J$ . Papers must be formatted according to the guidelines for Springer LNCS papers (see https://urldefense.com/v3/__http://www.springer.com/lncs__;!!IBzWLUs!Tcj8ggP3XOxC3hb9hem4PkCEona0IZpaO5Rgaa1NUsvwfYAgp03yGnrjHvaG83OgSFIyrb01yQTs4dqmvAeb-vd-0aTp-UE2$ ), without modifications of margins and other space-saving measures. Authors should therefore consult Springer???s authors??? instructions and use their proceedings templates, either for LaTeX or for Word, for the preparation of their papers. Springer encourages authors to include their ORCIDs in their papers. All accepted papers in categories A-D will appear in the proceedings of the conference that will be published as a volume in Springer's Lecture Notes in Computer Science (LNCS) series. Conference Chairs Besik Dundua, Kutaisi International University, and Tbilisi State University, Georgia Mikheil Rukhaia, Tbilisi State University, Georgia PC Chairs Zhiming Liu, Southwest University in Chongqing, China Corina Pasareanu, NASA Ames Research Center, USA Helmut Seidl, Technical University of Munich, Germany PC Members Luis Barbosa, University of Minho, Portugal Lei Bu, Nanjing University, China Zhenbang Chen, National University of Defense Technology, Changsha, China Yunwei Dong, Northwestern Polytechnical University, China Deepak D'Souza, Indian Institute of Science, Bangalore, India Maribel Fernandez, King's College London, UK Simon Foster, University of York, UK Fei He, Tsinghua University, China Joost-Pieter Katoen, RWTH Aachen University, German Johannes Kinder, Bundeswehr University Munich, Germany Peter Lammich, University of Twente, The Netherlands Guoqiang Li, Shanghai Jiao Tong University, China Yannic Noller, National University of Singapore Colin Paterson, University of York, UK Martina Seidl, Johannes Kepler University Linz, Austria Vaibhav Sharma, University of Minnesota, USA Volker Stolz, H?gskulen p? Vestlandet, Norway Youcheng Sun, Queen's University Belfast, UK Caterina Urban, INRIA, France Heike Wehrheim, Paderborn University, Germany Naijun Zhan, Institute of Software, Chinese Academy of Sciences, China Miaomiao Zhang, Tongji University, China Steering Committee Martin Leucker (Chair), University of L?beck, Germany Zhiming Liu, Southwest University, China Tobias Nipkow, Technical University of Munich, Germany Augusto Sampaio, Universidade Federal de Pernambuco, Brazil Natarajan Shankar, SRI, USA Tarmo Uustalu, Tallinn University of Technology, Estonia -------------- next part -------------- An HTML attachment was scrubbed... URL: From xu at math.lmu.de Tue May 17 16:01:15 2022 From: xu at math.lmu.de (Chuangjie Xu) Date: Tue, 17 May 2022 22:01:15 +0200 Subject: [TYPES/announce] 2nd CfP (deadline 27 May): Autumn school "Proof and Computation" 2022 Message-ID: [Apologies 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!X4jDljxiI6Smb8ID_B7tH5pJmXZVJOTIsRAzXABHGbYOXkWZW7xCi-nxPWY-VGOkFvDLwkQQSs8ogcOfdKAh9BxU0lI$ The fifth 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 maietti at math.unipd.it Wed May 18 03:15:05 2022 From: maietti at math.unipd.it (Maria Emilia Maietti) Date: Wed, 18 May 2022 09:15:05 +0200 Subject: [TYPES/announce] CCC2022 -September 19-23, 2022- call for contributions In-Reply-To: References: Message-ID: CALL FOR? CONTRIBUTIONS: CCC 2022: Continuity, Computability, Constructivity ? From Logic to Algorithms Department of Mathematics and?? ONLINE Padova, Italy, September 19-23, 2022 Conference website??? https://urldefense.com/v3/__https://events.math.unipd.it/ccc2022/__;!!IBzWLUs!Qm1ZVO6Y9ow-9d27CnZIqIhH71BJfLKPstwdZIAwlZvyWlbHexjw-6m21b--nE2kE_H2QXO6Q61GiOAA-LKGlphzoysleeUhWzc$ ============================================== Submission link https://urldefense.com/v3/__https://easychair.org/conferences/?conf=ccc20220__;!!IBzWLUs!Qm1ZVO6Y9ow-9d27CnZIqIhH71BJfLKPstwdZIAwlZvyWlbHexjw-6m21b--nE2kE_H2QXO6Q61GiOAA-LKGlphzoyslD21qSxE$ Submission deadline: ?? August 16, 2022 Nofication of acceptance: ? August 26, 2022 ==================================================== Topics: constructive mathematics constructive analysis computable analysis exact real number computation CCC is a workshop series that brings together researchers applying logical methods to the development of algorithms, with a particular focus on computation with infinite data, where issues of continuity, computability and constructivity play major roles. Specific topics include exact real number computation, computable analysis, effective descriptive set theory, constructive analysis and topology, and related areas. The overall aim is to apply logical methods in these disciplines to provide a sound foundation for obtaining exact and provably correct algorithms for computations with real numbers and other continuous data, which are of increasing importance in safety-critical applications and scientific computation. Participation is welcome in person or online. Previous workshops have been held in Cologne 2009, Trier 2012, Gregynog 2013, Ljubljana 2014, Kochel 2015, Nancy 2017, Faro 2018, Ljubljana 2019, Faro 2020 (online), Birmingham 2021 (online). ===================================================================== Submission Guidelines The workshop invites all contributions relating to computation where issues of continuity, computability and constructivity play major roles. Specific areas of interest include: ??? Exact real number computation ??? Correctness of algorithms on infinite data ??? Computable analysis ??? Complexity of real numbers, real-valued functions, etc. ??? Effective descriptive set theory ??? Domain theory ??? Constructive analysis and topology ??? Constructive foundations ??? Category-theoretic approaches to computation on infinite data ??? Weihrauch degrees ??? Other related areas. Extended abstracts (1-2 pages) should be submitted in pdf format. A post-proceedings volume will be published in the open-access journal Logical Methods in Computer Science. =============================================== Tutorial speakers: ??? Alexander Miquel (Universidad de La Republica, Uruguay) ??? Linda Westrick (Penn State University, USA) Invited speakers: ??? Miko?aj Boja?czyk (Warsaw, Poland) ??? Tatsuji Kawai (JAIST, Japan) ??? Michael Rathjen (Leeds, UK) ??? Andreas Rauh (Oldenburg, Germany) ======================================================== Program Committee ??? Pieter Collins (Maastricht, Netherlands) ??? Achim Jung (Birmingham, UK) ??? Maria Emilia Maietti (Padova, Italy)? (chair) ??? Arno Pauly (Swansea, UK) ??? Alex Simpson (Ljubljana, Slovenia) ??? Holger Thies (Kyoto, Japan) ??? Chuangjie Xu (Munich, Germany) ??? Ning Zhong (Cincinnati, USA) ??? Martin Ziegler (KAIST, Republic of Korea) Organizing committee ??? Francesco Ciraulo (Padua, Italy) ??? Maria Emilia Maietti (Padua, Italy) ??? Samuele Maschio (Padua, Italy) ??? Pietro Sabelli (Padua, Italy) Contact All questions about submissions should be emailed to ccc22 at math.unipd.it From anca at labri.fr Wed May 18 08:12:36 2022 From: anca at labri.fr (Anca Muscholl) Date: Wed, 18 May 2022 14:12:36 +0200 Subject: [TYPES/announce] ICALP 2022 - Call for Participation - Extended early registration ends TODAY Message-ID: <58FB58A8-7E0B-47DF-B331-9DE8015C32FF@labri.fr> Due to multiple requests, the early registration deadline has been extended to May 18. We recommend that participants make their hotel reservations as early as possible since Paris is an attractive destination for tourists during the summer. The 49th EATCS International Colloquium on Automata, Languages, and Programming (ICALP) will take place ** in Paris, France, and online on 4-8 July 2022. ** The 2022 edition has the following special features: - The conference is hybrid. - This will be the 50th birthday of the conference and some special events are planned. - The ICALP Extended Stay Support Scheme (IESSS) is here for helping the organisation of collaborations around the conference. ICALP is the main conference and annual meeting of the European Association for Theoretical Computer Science (EATCS). As usual, ICALP will be preceded by a series of workshops, which will take place on July 4. The 2022 edition will be also the occasion to celebrate the 50th anniversary of both EATCS and the first ICALP, which was first held in 1972 in Rocquencourt, in the Paris area. ============= Important dates and information ============= Website: https://urldefense.com/v3/__https://icalp2022.irif.fr/__;!!IBzWLUs!WJUiQNhnWvLQGhTZlG62Wt_3waVu0YHOUwJdU2V_j6y59vRe5cmsfndyRoxo9AsRF-VVJIJ5XYeTwxJN1MiEEjRh4MM$ Early Registration: May 18 Conference: July 4-8, 2022 Workshops: July 4 ============= Registration ============= For registration, follow this link: https://urldefense.com/v3/__https://icalp2022.irif.fr/?page_id=50__;!!IBzWLUs!WJUiQNhnWvLQGhTZlG62Wt_3waVu0YHOUwJdU2V_j6y59vRe5cmsfndyRoxo9AsRF-VVJIJ5XYeTwxJN1MiEBhh8_1s$ ============= Extended Stay Support Scheme (IESS) ============= For its 49th edition, the ICALP conference offers to its attendees an Extended Stay Support Scheme (IESSS) aiming at enhancing scientific collaborations and diminishing the carbon footprint of scientific research activities. ICALP 2022 attendees are encouraged to combine their visit to Paris with collaborations with local researchers. This support scheme is primarily intended for participants travelling long distances and must be combined with an attendance to ICALP. Upon acceptation, research institutes involved in this mechanism will cover standard expenses (accommodation and traveling fees, plane excluded) and will provide material support for research activities. See https://urldefense.com/v3/__https://icalp2022.irif.fr/?page_id=50__;!!IBzWLUs!WJUiQNhnWvLQGhTZlG62Wt_3waVu0YHOUwJdU2V_j6y59vRe5cmsfndyRoxo9AsRF-VVJIJ5XYeTwxJN1MiEBhh8_1s$ for more information. ============= Invited Speakers ============= Albert Atserias, Universitat Polit?cnica de Catalunya Constantinos Daskalakis, MIT Leslie Ann Goldberg, Oxford University Madhu Sudan, Harvard St?phan Thomass?, ENS Lyon Santosh Vempala, Georgia Tech ============= Awards ============= During the conference, the following awards will be given: - the EATCS award (https://urldefense.com/v3/__https://eatcs.org/index.php/eatcs-award__;!!IBzWLUs!WJUiQNhnWvLQGhTZlG62Wt_3waVu0YHOUwJdU2V_j6y59vRe5cmsfndyRoxo9AsRF-VVJIJ5XYeTwxJN1MiEpCBJQJs$ ), - the G?del prize (https://urldefense.com/v3/__https://eatcs.org/index.php/goedel-prize__;!!IBzWLUs!WJUiQNhnWvLQGhTZlG62Wt_3waVu0YHOUwJdU2V_j6y59vRe5cmsfndyRoxo9AsRF-VVJIJ5XYeTwxJN1MiEFPPWsPI$ ), - the Presburger award (https://urldefense.com/v3/__https://eatcs.org/index.php/presburger__;!!IBzWLUs!WJUiQNhnWvLQGhTZlG62Wt_3waVu0YHOUwJdU2V_j6y59vRe5cmsfndyRoxo9AsRF-VVJIJ5XYeTwxJN1MiEM3iCyeg$ ), - the EATCS distinguished dissertation award (https://urldefense.com/v3/__https://eatcs.org/index.php/dissertation-award__;!!IBzWLUs!WJUiQNhnWvLQGhTZlG62Wt_3waVu0YHOUwJdU2V_j6y59vRe5cmsfndyRoxo9AsRF-VVJIJ5XYeTwxJN1MiESTxTQ8A$ ), - the best papers for Track A and track B, - the best student papers for Track A and track B. ============= Accepted papers ============= See https://urldefense.com/v3/__https://icalp2022.irif.fr/?page_id=85__;!!IBzWLUs!WJUiQNhnWvLQGhTZlG62Wt_3waVu0YHOUwJdU2V_j6y59vRe5cmsfndyRoxo9AsRF-VVJIJ5XYeTwxJN1MiE0s1m6a8$ ============= Workshops ============= See https://urldefense.com/v3/__https://icalp2022.irif.fr/?page_id=46__;!!IBzWLUs!WJUiQNhnWvLQGhTZlG62Wt_3waVu0YHOUwJdU2V_j6y59vRe5cmsfndyRoxo9AsRF-VVJIJ5XYeTwxJN1MiExSo2fGw$ for more information. - Parameterized Approximation Algorithms Workshop - Combinatorial Reconfiguration - Recent Advances on Total Search Problems - Algorithmic Aspects of Temporal Graphs V - Trends in Arithmetic Theories - Structure Meets Power 2022 - Straight-Line Programs, Word Equations and their Interplay - Graph Width Parameters: from Structure to Algorithms From dario.dellamonica at uniud.it Wed May 18 09:40:34 2022 From: dario.dellamonica at uniud.it (Dario Della Monica) Date: Wed, 18 May 2022 15:40:34 +0200 Subject: [TYPES/announce] GandALF 2022 -- Last Call For Papers Message-ID: [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!VAaj7X1mLc69Rm8tfKH4p4mS3Mpim8FPx2kQmIbIucsqUioE_LrKEErE4rNmDygkDEwSmRSXJcvS1r4NiQ10RfnIXwvOEMqsKQUhNwdTWyo$ 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!VAaj7X1mLc69Rm8tfKH4p4mS3Mpim8FPx2kQmIbIucsqUioE_LrKEErE4rNmDygkDEwSmRSXJcvS1r4NiQ10RfnIXwvOEMqsKQUhKEtTD-A$ -------------- next part -------------- An HTML attachment was scrubbed... URL: From mbatty at cantab.net Thu May 19 06:41:43 2022 From: mbatty at cantab.net (Mark Batty) Date: Thu, 19 May 2022 11:41:43 +0100 Subject: [TYPES/announce] Job advert -- Research Fellow in Programming Languages and Systems. University of Kent, UK. Message-ID: University of Kent - The School of Computing Location:Canterbury Salary:?35,326 to ?48,835 Hours:Full Time Contract Type:Permanent Placed On:11th May 2022 Closes:6th June 2022 Job Ref:CEMS-136-22 Closing Date: 23.59 hours BST 09 June 2022 Apply here: https://urldefense.com/v3/__https://www.jobs.ac.uk/job/CPQ519/research-fellow-in-programming-languages-and-systems__;!!IBzWLUs!SG7pyXcxFnjPEfq_x-qYuaed7LnmDF0zsvfxflU3ilNyLWZSU7-IJVF8satEOpUr9X8nUaHugo7hGVPwRBTscWXXRnMIQg$ The School of Computing is looking to recruit a Research Fellow in Programming Languages and Systems. This post will be externally funded through funding secured by group researchers (including the role-holder). Please note that this position will be offered on a permanent basis dependent on funding. There is the possibility of offering the second-placed applicant a fixed-term Research Associate position. The Fellowship post is similar to the role of a postdoctoral researcher, but by virtue of being permanent, it makes it possible to develop research independence through applications to funding bodies. The PLAS group currently holds a variety of externally funded grants from EPSRC (CapC, STARDUST, CAMELOT, Verifying Resource-like Data Use in Programs via Types), Horizon2020 (BeHapi), Innovate UK, NCSC and the Royal Society among others. The Fellow will be responsible for research work funded by external grants within the school. Initially that will entail working on currently running projects, but over time the fellow is expected to take part in new applications led by others within the school, and to seek funding for their own research. The role will require excellent technical and project management skills, applicable to a number of currently running projects, and a vision for an independent research direction. You will form an integral part of the successful PLaS group (ranked 3rd in the UK for Programming Language research -- CSRankings 2020), and play a key role in current research and its future direction As a Research Fellow in PLAS, you will: 1. support group members on the planning of research activities for their funded projects, as well as for scoping and POC studies. 2. help with the carrying out and development of the research activities of the group 3. seek and secure external funding opportunities to help further develop the research goals of the group 4. contribute to internal and external research progress meetings with other investigators and researchers, including the drafting of technical project reports for funders 5. keep abreast of the latest development in the field and ensure these are shared with the group in a variety of ways, i.e. through presentations on research seminars and other media To succeed in this role, you will have: 1. a PhD or equivalent experience in Programming Languages and Systems research 2. a sound knowledge of research methods and processes in the field of computing, specifically in regards to research design and implementation 3. A good publication track-record of publications in top programming languages conferences/journals 4. Extensive knowledge of at least 2 subfields of the PLAS group (compiler development, formal reasoning, concurrency, language design, type systems, semantics, programmer tools) Please apply here: https://urldefense.com/v3/__https://www.jobs.ac.uk/job/CPQ519/research-fellow-in-programming-languages-and-systems__;!!IBzWLUs!SG7pyXcxFnjPEfq_x-qYuaed7LnmDF0zsvfxflU3ilNyLWZSU7-IJVF8satEOpUr9X8nUaHugo7hGVPwRBTscWXXRnMIQg$ Best, Professor Mark Batty School of Computing University of Kent -------------- next part -------------- An HTML attachment was scrubbed... URL: From ventura at ufg.br Thu May 19 18:08:38 2022 From: ventura at ufg.br (D. Ventura) Date: Thu, 19 May 2022 19:08:38 -0300 Subject: [TYPES/announce] Final CfP [deadline extended]: 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!Ur2ylRzJykA7t3aM33W9B056RGJWz3jD7IfY5HAIgwfvAw9puRr4MEZPSrlqCAQxr2kfbZ_yTB32seLapU48QSxWLHRARg$ 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!Ur2ylRzJykA7t3aM33W9B056RGJWz3jD7IfY5HAIgwfvAw9puRr4MEZPSrlqCAQxr2kfbZ_yTB32seLapU48QSx3uwbdDw$ *Workshop will be held as a hybrid meeting (both **virtually** and **in person**)* ======================================================== 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 3rd* June 2022* * *Author notification*: 17th June 2022* 24**th June 2022* * *Contribution for Informal Proceedings*: 1st July 2022 *8th 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!Ur2ylRzJykA7t3aM33W9B056RGJWz3jD7IfY5HAIgwfvAw9puRr4MEZPSrlqCAQxr2kfbZ_yTB32seLapU48QSxnKlqZAQ$ 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. *INVITED SPEAKERS* + Stephanie Balzer , Carnegie Mellon University + Thomas Ehrhard , Universit? Paris Cit? + Giulio Guerrieri , Huawei-Edinburgh Joint Lab + Koko Muroya , RIMS Kyoto University *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 kutsia at risc.jku.at Fri May 20 05:57:26 2022 From: kutsia at risc.jku.at (Temur Kutsia) Date: Fri, 20 May 2022 11:57:26 +0200 Subject: [TYPES/announce] Final CfP: AMAI Special Issue on Symbolic Computation in Software Science Message-ID: <9d27d7b0-856f-65fd-daea-548245b83419@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!Q6S73T5BLGVFAOXM4NPJb7j8Vkm07wsWj3K0DhVlBeZEoBwAKmZxn8n-qg9lucqZxNtkcmOzpCAylybndVyXxsZxhQv8sZrv$ ------------------------------------------------------------------ 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!Q6S73T5BLGVFAOXM4NPJb7j8Vkm07wsWj3K0DhVlBeZEoBwAKmZxn8n-qg9lucqZxNtkcmOzpCAylybndVyXxsZxhcDiiXd8$ . PDF versions of papers should be uploaded at the submission page https://urldefense.com/v3/__https://www.editorialmanager.com/amai__;!!IBzWLUs!Q6S73T5BLGVFAOXM4NPJb7j8Vkm07wsWj3K0DhVlBeZEoBwAKmZxn8n-qg9lucqZxNtkcmOzpCAylybndVyXxsZxhUD3sgr-$ 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 pierre-marie.pedrot at inria.fr Fri May 20 07:08:49 2022 From: pierre-marie.pedrot at inria.fr (=?UTF-8?Q?Pierre-Marie_P=c3=a9drot?=) Date: Fri, 20 May 2022 13:08:49 +0200 Subject: [TYPES/announce] TYPES 2022 -- Second call for participation Message-ID: <291c3ec9-9da1-fa80-70c8-1135c5ae1680@inria.fr> SECOND CALL FOR PARTICIPATION 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 Early registration deadline: **June, 1st 2022** Registration: https://types22.sciencesconf.org/registration/ Registration fees: see below INVITED SPEAKERS Youyou Cong: Composing Music from Types Ekaterina Komendantskaya: Refine and Synthesise: a type-theoretic view on neural network robustness. Sam Lindley: On the expressive power of types. Leonardo de Moura: The Lean 4 theorem prover and programming language PROGRAMME https://types22.inria.fr/programme/ REGISTRATION FEES To facilitate their attendance, TYPES'22 offers a reduced rate for students, available in the registration form. In addition, all registrations performed before June, 1st will be offered a discount. It is possible to register for the satellite events only, which will take place on June 24th and 25th. Such a registration is free, but mandatory for catering purposes. Registering to TYPES'22 implicitly includes registration to satellite events. See the registration page https://types22.sciencesconf.org/registration/ for details. 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. The EuroProofNet Cost Action CA20111 focuses on the same research topics as TYPES and partially sponsors the TYPES Conference. CONTACT Email: types2022 at easychair.org 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) ORGANIZERS 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 asampson at cs.cornell.edu Fri May 20 10:15:05 2022 From: asampson at cs.cornell.edu (Adrian Sampson) Date: Fri, 20 May 2022 10:15:05 -0400 Subject: [TYPES/announce] Nominate the next editor-in-chief of TOPLAS Message-ID: <8468EEA7-4994-4FC6-8AD4-AE6485EC73DE@cs.cornell.edu> Call for Nominations Editor-In-Chief ACM Transactions on Programming Languages and Systems The term of the current Editor-in-Chief (EiC) of the ACM Transactions on Programming Languages and Systems (TOPLAS) is coming to an end, and the ACM Publications Board has set up a nominating committee to assist the Board in selecting the next EiC. TOPLAS was established in 1979 and is the premier journal for reporting recent research advances on programming languages and on systems to assist the task of programming. As of January 2022, TOPLAS is publishing Gold Open Access for an initial period of two years. Nominations, including self-nominations, are invited for a three-year term as TOPLAS EiC, beginning on September 1, 2022. The EiC appointment may be renewed at most one time. This is an entirely voluntary position, but ACM will provide appropriate administrative support. Appointed by the ACM Publications Board, Editors-in-Chief (EiCs) of ACM journals are delegated full responsibility for the editorial management of the journal consistent with the journal's charter and general ACM policies. The Board relies on EiCs to ensure that the content of the journal is of high quality and that the editorial review process is both timely and fair. He/she has final say on acceptance of papers, size of the Editorial Board, and appointment of Associate Editors. A complete list of responsibilities is found in the ACM Volunteer Editors Position Descriptions . Additional information can be found in the following documents: - Rights and Responsibilities in ACM Publishing - ACM's Evaluation Criteria for Editors-in-Chief Nominations should include a vita along with a brief statement of why the nominee should be considered. Self-nominations are encouraged and should include a statement of the candidate's vision for the future development of TOPLAS. The deadline for submitting nominations is July 1, 2022, although nominations will continue to be accepted until the position is filled. Please send all nominations to the nominating committee chair, Jens Palsberg . The search committee members are: - Jens Palsberg (University of California, Los Angeles), *Chair* - Lars Birkedal (Aarhus University) - Azadeh Farzan (University of Toronto) - Bernhard Scholz (University of Sydney) - Chris Hankin (Imperial College London), *ACM Pubs Board Liaison* From namin at alum.mit.edu Fri May 20 12:46:21 2022 From: namin at alum.mit.edu (Nada Amin) Date: Fri, 20 May 2022 12:46:21 -0400 Subject: [TYPES/announce] Call for Papers: Workshop on Type-Driven Development (TyDe) co-located with ICFP Message-ID: The Workshop on Type-Driven Development (TyDe) aims to show how static type information may be used effectively in the development of computer programs. Co-located with ICFP, this workshop brings together leading researchers and practitioners who are using or exploring types as a means of program development. We welcome all contributions, both theoretical and practical, on a range of topics including: - dependently typed programming; - generic programming; - design and implementation of programming languages, exploiting types in novel ways; - exploiting typed data, data dependent data, or type providers; - static and dynamic analyses of typed programs; - tools, IDEs, or testing tools exploiting type information; - pearls, being elegant, instructive examples of types used in the derivation, calculation, or construction of programs. Proceedings and Copyright We will have formal proceedings, published by the ACM. Accepted papers will be included in the ACM Digital Library. Authors must grant ACM publication rights upon acceptance, but may retain copyright if they wish. Authors are encouraged to publish auxiliary material with their paper (source code, test data, and so forth). The proceedings will be freely available for download from the ACM Digital Library from one week before the start of the conference until two weeks after the conference. 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. Submission Details Submissions should fall into one of two categories: - regular research papers (12 pages); - extended abstracts (3 pages). The bibliography will not be counted against the page limits for either category. Regular research papers are expected to present novel and interesting research results, and will be included in the formal proceedings. Extended abstracts should report work in progress that the authors would like to present at the workshop. Extended abstracts will be distributed to workshop attendees but will not be published in the formal proceedings. We welcome submissions from PC members (with the exception of the two co-chairs), but these submissions will be held to a higher standard. Submission is handled through HotCRP: https://urldefense.com/v3/__https://tyde22.hotcrp.com__;!!IBzWLUs!RmyRhqkJYPvrCENB5nFIaIqf3M6EnRVWwBYPq2t7tilN5j4Eu1b0uyAS_ZtWLZhUC_rjYENf9JVp1E2rGcezhkQ58OOABUwE$ All submissions should be in portable document format (PDF) and formatted using the ACM SIGPLAN style guidelines: https://urldefense.com/v3/__https://www.sigplan.org/Resources/Author/__;!!IBzWLUs!RmyRhqkJYPvrCENB5nFIaIqf3M6EnRVWwBYPq2t7tilN5j4Eu1b0uyAS_ZtWLZhUC_rjYENf9JVp1E2rGcezhkQ58ODXSl-W$ Note that submissions should use the new ?acmart? format and the two-column ?sigplan? subformat (not to be confused with the one-column ?acmsmall? subformat). Extended abstracts must be submitted with the label ?Extended Abstract? clearly in the title. Participant Support Student attendees with accepted papers can apply for a SIGPLAN PAC grant to help cover participation-related expenses. PAC also offers other support, such as for child-care expenses during the meeting or for accommodations for members with physical disabilities. For details on the PAC program, see its web page: https://urldefense.com/v3/__https://www.sigplan.org/PAC/__;!!IBzWLUs!RmyRhqkJYPvrCENB5nFIaIqf3M6EnRVWwBYPq2t7tilN5j4Eu1b0uyAS_ZtWLZhUC_rjYENf9JVp1E2rGcezhkQ58DNbCKhH$ Important Dates Submission Deadline: Wed 1 Jun 2022 Author Notification: Fri 1 Jul 2022 Camera-Ready Deadline: Wed 20 Jul 2022 Workshop: Sun 11 Sep 2022 Program Committee Nada Amin (Harvard University, United States) -- co-chair Jean-Philippe Bernardy (University of Gothenburg, Sweden) Oliver Bra?evac (Purdue University, United States) Harley D. Eades III (Augusta University, United States) -- co-chair Pierre-Evariste Dagand (LIP6/CNRS, France) Anitha Gollamudi (UMass Lowell, United States) Gabriel Scherer (INRIA Saclay, France) Jonathan Sterling (Aarhus University, Denmark) Tarmo Uustalu (Reykjavik University, Iceland) Jeremy Yallop (University of Cambridge, United Kingdom) -------------- next part -------------- An HTML attachment was scrubbed... URL: From jes at math.uminho.pt Sun May 22 16:02:07 2022 From: jes at math.uminho.pt (=?UTF-8?Q?Jos=c3=a9_Carlos_Esp=c3=adrito_Santo?=) Date: Sun, 22 May 2022 21:02:07 +0100 Subject: [TYPES/announce] Days in Logic 2022 - Call for participation Message-ID: <9238f488-0b38-42dc-6ad9-8c2c691f143c@math.uminho.pt> CALL FOR PARTICIPATION DAYS IN LOGIC 2022 University of Algarve, Faro, 30 June - 2 July 2022 https://urldefense.com/v3/__https://daysinlogic2022.ualg.pt/__;!!IBzWLUs!TZqyY-rYKZSM__NhmHr5rxEsTt4A0Dv1p-1tVKYibEdTf7fKYsgtU-ArDWh2L4wSlsM-Ky2Sfcb3X41Xd-L465fokgfZjJk$ The 10th edition of Days in Logic will be a hybrid event taking place at the University of Algarve, Faro, but allowing for remote participation. This biennial meeting aims at bringing together logicians, mathematicians, computer scientists and other scientists from Portugal (but also elsewhere) with interest in Logic. It is specially directed to graduate students. The programme consists of three tutorials by invited speakers and contributed talks. Arrangements for virtual participation will be made, but we encourage in-person participation when possible. TUTORIALS BY INVITED SPEAKERS: * "Weihrauch Complexity", by Vasco Brattka?(Universit?t der Bundeswehr M?nchen) * "Satisfiability and its Applications", by Mikol?? Janota?(Czech Technical University in Prague) * "Univalent Combinatorics", by Egbert Rijke?(University of Ljubljana) REGISTRATION Registration is free, but required. Please register on the following link: https://urldefense.com/v3/__https://daysinlogic2022.ualg.pt/registration/__;!!IBzWLUs!TZqyY-rYKZSM__NhmHr5rxEsTt4A0Dv1p-1tVKYibEdTf7fKYsgtU-ArDWh2L4wSlsM-Ky2Sfcb3X41Xd-L465fo4nu4Zbc$ ORGANIZING COMMITTEE Daniel Gra?a (Universidade do Algarve), dgraca at ualg.pt Gilda Ferreira (Universidade Aberta), gmferreira at fc.ul.pt Jos? Esp?rito Santo (Universidade do Minho), jes at math.uminho.pt MORE INFORMATION For details about registration, venue, accomodation, and the programme, please consult: https://urldefense.com/v3/__https://daysinlogic2022.ualg.pt/__;!!IBzWLUs!TZqyY-rYKZSM__NhmHr5rxEsTt4A0Dv1p-1tVKYibEdTf7fKYsgtU-ArDWh2L4wSlsM-Ky2Sfcb3X41Xd-L465fokgfZjJk$ ACKNOWLEDGEMENTS Days in Logic 2022 is supported by the FCT funded research units IT - Instituto de Telecomunica??es CMAFcIO - Universidade de Lisboa CMAT - Universidade do Minho -------------- next part -------------- An HTML attachment was scrubbed... URL: From kutsia at risc.jku.at Wed May 25 08:17:34 2022 From: kutsia at risc.jku.at (Temur Kutsia) Date: Wed, 25 May 2022 14:17:34 +0200 Subject: [TYPES/announce] Deadline extension: AMAI Special Issue on Symbolic Computation in Software Science Message-ID: Due to requests, the submission deadline for the special issue of the Annals of Mathematics and Artificial Intelligence (AMAI) on Symbolic Computation in Software Science has been extended to June 13, 2022. ------------------------------------------------------------------ Call for submissions Annals of Mathematics and Artificial Intelligence Special Issue 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!Vv1BcxHwjZLlst9_0_tRy-C_Cce15maVEF9N32V_mvqvmYE5qMIrRpFnnUxZzbvLCoWsYCIP3IUvAwEe_V_S_Cu7wiToI6Vb$ ------------------------------------------------------------------ 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!Vv1BcxHwjZLlst9_0_tRy-C_Cce15maVEF9N32V_mvqvmYE5qMIrRpFnnUxZzbvLCoWsYCIP3IUvAwEe_V_S_Cu7wkuQbHhx$ . PDF versions of papers should be uploaded at the submission page https://urldefense.com/v3/__https://www.editorialmanager.com/amai__;!!IBzWLUs!Vv1BcxHwjZLlst9_0_tRy-C_Cce15maVEF9N32V_mvqvmYE5qMIrRpFnnUxZzbvLCoWsYCIP3IUvAwEe_V_S_Cu7wrsYjvvf$ by June 13, 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 theodorus.fransen at nuigalway.ie Fri May 27 06:45:09 2022 From: theodorus.fransen at nuigalway.ie (Fransen, Theodorus) Date: Fri, 27 May 2022 10:45:09 +0000 Subject: [TYPES/announce] ESSLLI 2022 - Early Bird Registration extended to 5th June Message-ID: (Apologies for cross-posting) The early bird registration has been extended to 5th June: https://urldefense.com/v3/__https://nuigalwaydatascienceinstitute.clr.events/event/131959:esslli-2022__;!!IBzWLUs!WqsYUaehuzs35_g67zQBSnaOizQ8CooDTYtsqPUqGJ2eGFxT15cPL3-9c12KekFoHzPSjcOgzb7ALXV4TpHm5n9zwnpGAhcf70UjZ-etYrNAOLw$ Registration is now open for the 33rd European Summer School in Logic, Language and Information (ESSLLI), taking place from 8-19 August, 2022 at the National University of Ireland Galway: https://urldefense.com/v3/__https://2022.esslli.eu/__;!!IBzWLUs!WqsYUaehuzs35_g67zQBSnaOizQ8CooDTYtsqPUqGJ2eGFxT15cPL3-9c12KekFoHzPSjcOgzb7ALXV4TpHm5n9zwnpGAhcf70UjZ-etEpcOa4k$ Overview: The European Summer School in Logic, Language and Information (ESSLLI) is a yearly recurring event, organised under the auspices of the Association for Logic, Language and Information (FoLLI), and has been running since 1989. The ESSLLI Summer School provides an interdisciplinary setting in which courses and workshops are offered in logic, linguistics and computer science, also from wider scientific, historical, and philosophical perspectives. ESSLLI attracts around 400 participants from all parts of Europe, as well as from North and Latin America, and Asia. The ESSLLI has become the main meeting place for young researchers and students in logic, linguistics and computer science to discuss current research and to share knowledge. The event is unique in its interdisciplinary set-up, with no equivalents in Europe. Programme: The ESSLLI Summer School offers an exciting two-week programme, consisting of the following: - Workshops in logic, linguistics and computer science - Courses ? foundational, introductory and advanced ? in three areas: - - Language and Computation - - Logic and Computation - - Logic and Language - Student session - Evening lectures - Social activities Registration: Registration for attendees, course lecturers, student session and workshop organisers and speakers is now open. The early-registration deadline has been extended to Sunday 5th June; go to https://urldefense.com/v3/__https://2022.esslli.eu/registration.html__;!!IBzWLUs!WqsYUaehuzs35_g67zQBSnaOizQ8CooDTYtsqPUqGJ2eGFxT15cPL3-9c12KekFoHzPSjcOgzb7ALXV4TpHm5n9zwnpGAhcf70UjZ-et606EKlY$ . ESSLLI is offering affordable accommodation on campus to all participants who book before 27th June. Registrations received after this date will not be able to book accommodation through our portal. -------------- next part -------------- An HTML attachment was scrubbed... URL: From dario.dellamonica at uniud.it Mon May 30 09:16:51 2022 From: dario.dellamonica at uniud.it (Dario Della Monica) Date: Mon, 30 May 2022 15:16:51 +0200 Subject: [TYPES/announce] GandALF 2022 -- Call For Papers [extended deadline] Message-ID: [apologies for multiple copies] extended deadline: June 10, 2022 (paper submission) 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: June 3, 2022 Paper Submission: June 10, 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!Xwnk6nqiP0Hmpugmb4WTZDnjFuIVYwxV5t1-1rzvKWK_THeJHhZl9aXiAATUpVh8kCr4OIBZKupojCme1mPWY5CnN_v_F5wQrq3xOq_sCg8$ 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!Xwnk6nqiP0Hmpugmb4WTZDnjFuIVYwxV5t1-1rzvKWK_THeJHhZl9aXiAATUpVh8kCr4OIBZKupojCme1mPWY5CnN_v_F5wQrq3x53lPk7I$ -------------- next part -------------- An HTML attachment was scrubbed... URL: From daniel.hillerstrom at ed.ac.uk Mon May 30 13:26:24 2022 From: daniel.hillerstrom at ed.ac.uk (=?UTF-8?Q?Daniel_Hillerstr=c3=b6m?=) Date: Mon, 30 May 2022 18:26:24 +0100 Subject: [TYPES/announce] [CFP] HOPE'22: ACM SIGPLAN Workshop on Higher-Order Programming with Effects (3rd CFP) Message-ID: <3392695a-94f3-13dc-0848-3153c136504e@ed.ac.uk> **Deadline June 1st** 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!VlD5CW4m9nMXfhQITkmOhFkXwbSG63BbRJ8aH7uiFnV_bU46d8z7s78afnLTWtlWBcyLLQ1UkQS3hW7BfXASXB-pR7hG0fqJ13HzMBLJiBU$ 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 ventura at ufg.br Tue May 31 09:43:21 2022 From: ventura at ufg.br (D. Ventura) Date: Tue, 31 May 2022 10:43:21 -0300 Subject: [TYPES/announce] Last 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!Q2k_uEdqj8PpwiFOpNNOj0gegS5QxEsY8qgY3To1HZ57zrjPAphID-wDYZf9GGIGetCPhOHbCKO6AMNFyJrhhsjILDB_vA$ 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!Q2k_uEdqj8PpwiFOpNNOj0gegS5QxEsY8qgY3To1HZ57zrjPAphID-wDYZf9GGIGetCPhOHbCKO6AMNFyJrhhsiYArfnzA$ *Workshop will be held as a hybrid meeting (both **virtually** and **in person**)* ======================================================== 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 3rd* June 2022* * *Author notification*: 17th June 2022* 24**th June 2022* * *Contribution for Informal Proceedings*: 1st July 2022 *8th 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!Q2k_uEdqj8PpwiFOpNNOj0gegS5QxEsY8qgY3To1HZ57zrjPAphID-wDYZf9GGIGetCPhOHbCKO6AMNFyJrhhsgB2zZv8w$ 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. *INVITED SPEAKERS* + Stephanie Balzer , Carnegie Mellon University + Thomas Ehrhard , Universit? Paris Cit? + Giulio Guerrieri , Huawei-Edinburgh Joint Lab + Koko Muroya , RIMS Kyoto University *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 Claude.Marche at inria.fr Tue May 31 10:01:10 2022 From: Claude.Marche at inria.fr (Claude Marche) Date: Tue, 31 May 2022 16:01:10 +0200 Subject: [TYPES/announce] Job offer / Researcher-Engineer / Inria, France Message-ID: <3ae1dd90-a0c8-4be5-35c7-1cee376c9df7@inria.fr> Temporary engineer positions at Inria are available for the ``ProofInUse'' consortium. Do not hesitate to forward this announce to anybody possibly interested == ProofInUse in short == The ProofInUse consortium is a laboratory for research and development in the domain of high-assurance software. It is joint between several academic and industrial partners. The general objective of ProofInUse is to provide software verification tools, based on mathematical proof, to industry users. The objective of ProofInUse is to significantly increase the capabilities and performances of verification environments proposed or internally used by the partners. Beyond a common interest in formal verification techniques, the members of ProofInUse share a common interest in the generic environment Why3 for deductive program verification, developed in the Toccata research group. In particular, ProofInUse aims at integration of verification techniques at the state-of-the-art of academic research, via the Why3 environment. See also https://urldefense.com/v3/__https://proofinuse.gitlabpages.inria.fr/__;!!IBzWLUs!RzMT5WDfXHkGQ2klOBFCJFo1Fnha5MnNDAJ-_qDYoAwK3vu30bBmDBO2E156gb7fT25saz3QNUm_yS0FbItbnmpxSoHE64Ke2rGTGAQ$ == Expectations from the candidates == We seek for candidates with as much experience and skills as possible in several domains among : development using the OCaml language ; techniques for evaluation, compilation and/or transformation of programs ; formal methods for software engineering ; formal logics ; static analysis of programs ; computer-assisted theorem proving ; use of formal proof environments. We expect some experience in the field of formal methods of software engineering in a general sense. The typical candidate would be someone who recently defended a master's thesis or a PhD in a related domain. The research part of the job is significant, the work being expected to lead to academic publications, as exemplified by the publications of the former engineers of ProofInUse (see https://urldefense.com/v3/__https://proofinuse.gitlabpages.inria.fr/dissemination.html__;!!IBzWLUs!RzMT5WDfXHkGQ2klOBFCJFo1Fnha5MnNDAJ-_qDYoAwK3vu30bBmDBO2E156gb7fT25saz3QNUm_yS0FbItbnmpxSoHE64KeBmIgeNQ$ ). The development activities include a participation to the development of Why3, for which we are interested in candidates with experience in OCaml programming, or similar functional programming languages, and in the practice of shared development using git. Some skills in the use of a formal proof environment will be a plus. == How to apply The engineer positions should be filled as soon as possible. The primary site for the positions is https://urldefense.com/v3/__https://recrutement.inria.fr/public/classic/en/offres/2022-05025__;!!IBzWLUs!RzMT5WDfXHkGQ2klOBFCJFo1Fnha5MnNDAJ-_qDYoAwK3vu30bBmDBO2E156gb7fT25saz3QNUm_yS0FbItbnmpxSoHE64KemQaMKno$ where you can apply with a CV and a motivation letter. Do not hesitate to contact me directly (Claude.Marche at inria.fr) for more information on the positions. < From benoit.montagu at inria.fr Tue May 31 11:57:08 2022 From: benoit.montagu at inria.fr (Benoit Montagu) Date: Tue, 31 May 2022 17:57:08 +0200 Subject: [TYPES/announce] ML Family Workshop 2022: DEADLINE EXTENSION Message-ID: <2e06de09-c5b7-a3d4-37ce-76bb22334766@inria.fr> To increase your chances of submitting your work to the ML workshop, *the submission deadline is extended by a week*. The new deadline is Friday 10th June (AoE). A quick reminder: - The workshop does not have proceedings, making it the perfect venue ? to run some ideas with the community or present some work in ? progress within a friendly environment. - The work load as an author is low: submissions are only 3 pages long ? (excluding references) - YOU have the power to make the ML workshop a success! - You have one more full week to submit to ? (please register your submission early!) - All the details are here: - The ML workshop is colocated with ICFP 2022 -- Beno?t Montagu, chair of the ML workshop 2022 From danel.ahman at fmf.uni-lj.si Wed Jun 1 04:12:59 2022 From: danel.ahman at fmf.uni-lj.si (Danel Ahman) Date: Wed, 1 Jun 2022 10:12:59 +0200 Subject: [TYPES/announce] ICFP 2022 Student Research Competition: Final Call for Submissions Message-ID: <411BD1D5-61C8-4756-8D6E-29C309AAC57B@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!RsfduHvUiUuBXee_30czo6qCKF2rQU5VB6OKuvRyHkN_3dNj_y6YssOGqFr_u1AxfVK_o2ukr7HYYsvfRUgpJBYKAu05kORveRd4hUohLA$ 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!RsfduHvUiUuBXee_30czo6qCKF2rQU5VB6OKuvRyHkN_3dNj_y6YssOGqFr_u1AxfVK_o2ukr7HYYsvfRUgpJBYKAu05kORveRelg6r87Q$ . 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!RsfduHvUiUuBXee_30czo6qCKF2rQU5VB6OKuvRyHkN_3dNj_y6YssOGqFr_u1AxfVK_o2ukr7HYYsvfRUgpJBYKAu05kORveRcHqqEfqg$ . 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!RsfduHvUiUuBXee_30czo6qCKF2rQU5VB6OKuvRyHkN_3dNj_y6YssOGqFr_u1AxfVK_o2ukr7HYYsvfRUgpJBYKAu05kORveReCte8l2g$ ### 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 stephan.merz at loria.fr Wed Jun 1 04:24:52 2022 From: stephan.merz at loria.fr (Stephan Merz) Date: Wed, 1 Jun 2022 10:24:52 +0200 Subject: [TYPES/announce] two funded PhD positions at Inria Nancy Message-ID: <0FB8816E-8400-44E9-BEEE-1B5D7120BAFE@loria.fr> Two PhD positions funded by the ANR projects BLaSST and ICSPA on subjects around formal proofs for set-based specification languages are available at Inria Nancy. Automated Reasoning for Set Theory (Stephan Merz, Sophie Tourret) https://urldefense.com/v3/__https://jobs.inria.fr/public/classic/fr/offres/2022-04898__;!!IBzWLUs!UBojhm9so1CW4cg0H9b5fcRYmCe0GK2rsn-6q5HVHbtNwDb4E3ESnFVhwhfIP-cRDyBzABiQ63QP_6ZBiDTR0Gh6mI1Z98jDvVDLww$ The main objective is to take advantage of recent progress in automated reasoning for fragments of higher-order logic, and to further contribute to them, specifically for proof obligations generated by the B method. Formalization of Set Theory and Proof Checking (Stephan Merz, Gilles Dowek) https://urldefense.com/v3/__https://jobs.inria.fr/public/classic/fr/offres/2022-04909__;!!IBzWLUs!UBojhm9so1CW4cg0H9b5fcRYmCe0GK2rsn-6q5HVHbtNwDb4E3ESnFVhwhfIP-cRDyBzABiQ63QP_6ZBiDTR0Gh6mI1Z98g0wPiTJQ$ The thesis will study encoding the set theory of the specification language TLA+ in Dedukti, with the objectives of checking proofs obtained by the TLA+ proof system TLAPS, as well as of enabling interoperability with specifications written in the B language. More details on the two subjects, as well as information about how to apply, are available at the URLs indicated above. The theses are meant to start in the fall of 2022, the exact starting date is negotiable. I will be very happy to answer any question about the two thesis offers. Stephan Merz From daniel.hillerstrom at ed.ac.uk Wed Jun 1 13:18:26 2022 From: daniel.hillerstrom at ed.ac.uk (=?UTF-8?Q?Daniel_Hillerstr=c3=b6m?=) Date: Wed, 1 Jun 2022 18:18:26 +0100 Subject: [TYPES/announce] [CFP] HOPE'22: ACM SIGPLAN Workshop on Higher-Order Programming with Effects (DEADLINE EXTENSION) Message-ID: The deadline has been extended by a week to enable more people to submit their work. The new deadline is *Wednesday June 8, 2022 AoE*. 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!SMmgqgsczR86_nTxQeKz40GX2eMPDkH2OgrBofPKQqu-RYQkWtVTBiePt0AlCfUnSqggMhbHl63pjJ5V_Bikoy2uQFw1cP7e8z-sE8g91ys$ 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 8th, 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 harley.eades at gmail.com Wed Jun 1 15:42:43 2022 From: harley.eades at gmail.com (Harley D. Eades III) Date: Wed, 1 Jun 2022 15:42:43 -0400 Subject: [TYPES/announce] Deadline Extension: TyDe 2022 Message-ID: See below for the new submission deadline! Call for Papers: Workshop on Type-Driven Development (TyDe) co-located with ICFP The Workshop on Type-Driven Development (TyDe) aims to show how static type information may be used effectively in the development of computer programs. Co-located with ICFP, this workshop brings together leading researchers and practitioners who are using or exploring types as a means of program development. We welcome all contributions, both theoretical and practical, on a range of topics including: - dependently typed programming; - generic programming; - design and implementation of programming languages, exploiting types in novel ways; - exploiting typed data, data dependent data, or type providers; - static and dynamic analyses of typed programs; - tools, IDEs, or testing tools exploiting type information; - pearls, being elegant, instructive examples of types used in the derivation, calculation, or construction of programs. Proceedings and Copyright We will have formal proceedings, published by the ACM. Accepted papers will be included in the ACM Digital Library. Authors must grant ACM publication rights upon acceptance, but may retain copyright if they wish. Authors are encouraged to publish auxiliary material with their paper (source code, test data, and so forth). The proceedings will be freely available for download from the ACM Digital Library from one week before the start of the conference until two weeks after the conference. 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. Submission Details Submissions should fall into one of two categories: - regular research papers (12 pages); - extended abstracts (3 pages). The bibliography will not be counted against the page limits for either category. Regular research papers are expected to present novel and interesting research results, and will be included in the formal proceedings. Extended abstracts should report work in progress that the authors would like to present at the workshop. Extended abstracts will be distributed to workshop attendees but will not be published in the formal proceedings. We welcome submissions from PC members (with the exception of the two co-chairs), but these submissions will be held to a higher standard. Submission is handled through HotCRP: https://urldefense.com/v3/__https://tyde22.hotcrp.com__;!!IBzWLUs!S9m_Iq7basDLHR31GofLtyQCp751V3k_Cegvq11WksoVacdDPDLILM1TrpHS2icOkBA-gDgH1fCzoNR4RDevVm95D0oJpEpuDMnZ$ All submissions should be in portable document format (PDF) and formatted using the ACM SIGPLAN style guidelines: https://urldefense.com/v3/__https://www.sigplan.org/Resources/Author/__;!!IBzWLUs!S9m_Iq7basDLHR31GofLtyQCp751V3k_Cegvq11WksoVacdDPDLILM1TrpHS2icOkBA-gDgH1fCzoNR4RDevVm95D0oJpO6vOpkd$ Note that submissions should use the new ?acmart? format and the two-column ?sigplan? subformat (not to be confused with the one-column ?acmsmall? subformat). Extended abstracts must be submitted with the label ?Extended Abstract? clearly in the title. Participant Support Student attendees with accepted papers can apply for a SIGPLAN PAC grant to help cover participation-related expenses. PAC also offers other support, such as for child-care expenses during the meeting or for accommodations for members with physical disabilities. For details on the PAC program, see its web page: https://urldefense.com/v3/__https://www.sigplan.org/PAC/__;!!IBzWLUs!S9m_Iq7basDLHR31GofLtyQCp751V3k_Cegvq11WksoVacdDPDLILM1TrpHS2icOkBA-gDgH1fCzoNR4RDevVm95D0oJpFl_0xH4$ Important Dates *Submission Extension*: Wed 8 Jun 2022 Author Notification: Fri 1 Jul 2022 Camera-Ready Deadline: Wed 20 Jul 2022 Workshop: Sun 11 Sep 2022 Program Committee Nada Amin (Harvard University, United States) -- co-chair Jean-Philippe Bernardy (University of Gothenburg, Sweden) Oliver Bra?evac (Purdue University, United States) Harley D. Eades III (Augusta University, United States) -- co-chair Pierre-Evariste Dagand (LIP6/CNRS, France) Anitha Gollamudi (UMass Lowell, United States) Gabriel Scherer (INRIA Saclay, France) Jonathan Sterling (Aarhus University, Denmark) Tarmo Uustalu (Reykjavik University, Iceland) Jeremy Yallop (University of Cambridge, United Kingdom) -------------- next part -------------- An HTML attachment was scrubbed... URL: From theodorus.fransen at nuigalway.ie Fri Jun 3 08:17:53 2022 From: theodorus.fransen at nuigalway.ie (Fransen, Theodorus) Date: Fri, 3 Jun 2022 12:17:53 +0000 Subject: [TYPES/announce] ESSLLI 2022 - Early Bird Registration extended once more, to 12th June Message-ID: (Apologies for cross-posting) The early bird registration for ESSLLI 2022 has been extended once more, to 12th June: https://urldefense.com/v3/__https://nuigalwaydatascienceinstitute.clr.events/event/131959:esslli-2022__;!!IBzWLUs!VDPu1cTORoA7hzClfxJ2rhGWaNu9TY_CIJ1F5hfvbUZTo9UsRUYZt_6ZomImxQjTjPLm5cY-FgQtkL1J5uF0FKO3m-6y4FPPylilf1Tt3fedFR8$ This will be the 33rd edition of the European Summer School in Logic, Language and Information (ESSLLI), taking place from 8-19 August, 2022 at the National University of Ireland Galway: https://urldefense.com/v3/__https://2022.esslli.eu/__;!!IBzWLUs!VDPu1cTORoA7hzClfxJ2rhGWaNu9TY_CIJ1F5hfvbUZTo9UsRUYZt_6ZomImxQjTjPLm5cY-FgQtkL1J5uF0FKO3m-6y4FPPylilf1Ttq6-TDe0$ *Overview* The European Summer School in Logic, Language and Information (ESSLLI) is a yearly recurring event, organised under the auspices of the Association for Logic, Language and Information (FoLLI), and has been running since 1989. The ESSLLI Summer School provides an interdisciplinary setting in which courses and workshops are offered in logic, linguistics and computer science, also from wider scientific, historical, and philosophical perspectives. ESSLLI attracts around 400 participants from all parts of Europe, as well as from North and Latin America, and Asia. The ESSLLI has become the main meeting place for young researchers and students in logic, linguistics and computer science to discuss current research and to share knowledge. The event is unique in its interdisciplinary set-up, with no equivalents in Europe. *Programme* The ESSLLI Summer School offers an exciting two-week programme, consisting of the following: - Workshops in logic, linguistics and computer science - Courses ? foundational, introductory and advanced ? in three areas: - - Language and Computation - - Logic and Computation - - Logic and Language - Student session - Evening lectures - Social activities *Registration* Registration for attendees, course lecturers, student session and workshop organisers and speakers is now open. The early-registration deadline has been extended to Sunday 12th June; go to https://urldefense.com/v3/__https://2022.esslli.eu/registration.html__;!!IBzWLUs!VDPu1cTORoA7hzClfxJ2rhGWaNu9TY_CIJ1F5hfvbUZTo9UsRUYZt_6ZomImxQjTjPLm5cY-FgQtkL1J5uF0FKO3m-6y4FPPylilf1Tt0EeiUzw$ . ESSLLI is offering affordable accommodation on campus to all participants who book before 27th June. Registrations received after this date will not be able to book accommodation through our portal. -------------- next part -------------- An HTML attachment was scrubbed... URL: From sperber at deinprogramm.de Fri Jun 3 13:45:50 2022 From: sperber at deinprogramm.de (Michael Sperber) Date: Fri, 03 Jun 2022 19:45:50 +0200 Subject: [TYPES/announce] CfP deadline extension June 8 - ACM Workshop on Functional Art, Music, Modelling and Design 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 8 https://urldefense.com/v3/__https://functional-art.org/2022/__;!!IBzWLUs!X0BWTWAMaEQ80zfvkvohpxUfhrm-qm1BVd2XDhMkK2Gye6YeYIMlCEZDng1CV16BI_0cmMDnsf_X-1O0b6TmNTx0WorKA7BdzByQ$ =============================================================================== Key Dates --------- Submission deadline June 8 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!X0BWTWAMaEQ80zfvkvohpxUfhrm-qm1BVd2XDhMkK2Gye6YeYIMlCEZDng1CV16BI_0cmMDnsf_X-1O0b6TmNTx0WorKA8ntYlB1$ ), 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!X0BWTWAMaEQ80zfvkvohpxUfhrm-qm1BVd2XDhMkK2Gye6YeYIMlCEZDng1CV16BI_0cmMDnsf_X-1O0b6TmNTx0WorKA8ntYlB1$ ), 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!X0BWTWAMaEQ80zfvkvohpxUfhrm-qm1BVd2XDhMkK2Gye6YeYIMlCEZDng1CV16BI_0cmMDnsf_X-1O0b6TmNTx0WorKAwlJ-3At$ ) 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 kaposi.ambrus at gmail.com Mon Jun 6 02:22:56 2022 From: kaposi.ambrus at gmail.com (Ambrus Kaposi) Date: Mon, 6 Jun 2022 08:22:56 +0200 Subject: [TYPES/announce] Call for STSMs, deadline 1 July 2022 Message-ID: COST Action CA20111 EuroProofNet Open call for Short-Term Scientific Missions (STSMs) Dear Action members, The next STSM deadline is: 1st July 2022 Notification: 8th July. We are especially looking for applications from WG4 on the construction, management and (re)use of big libraries of formal proofs *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. Find all the details concerning application on https://urldefense.com/v3/__https://europroofnet.github.io/grants__;!!IBzWLUs!Qw8mfb7E0BuPZYTyra4AnCJfGaIuCnzJ_Ek-Cpd78pCoRyGd5wjjsujCp2lICZn1czseGGfrf_vAcoXPax_pkfvGzWLY_IgljiD1lg$ . Write an email to us if you have any questions.Best wishes, Danijela Simic and Ambrus Kaposi EuroProofNet STSM Coordinators -------------- next part -------------- An HTML attachment was scrubbed... URL: From cmezzina at gmail.com Mon Jun 6 05:00:23 2022 From: cmezzina at gmail.com (Claudio Mezzina) Date: Mon, 6 Jun 2022 11:00:23 +0200 Subject: [TYPES/announce] Call for Participation (RC 2022) Message-ID: Call for Participation 14th Conference on Reversible Computation (RC 2022) https://urldefense.com/v3/__https://reversible-computation-2022.github.io/__;!!IBzWLUs!S6db3LpCiWrZq02QtArrLRQGOm3-ive7SbWc2l7i9sNYPS8O0rNSytypJZhdGZZopg1lhvUVo7AreaBLdYzMrZW5h4t5qeI$ ** in Urbino, Italy, on 5-6 July 2022. ** ** The conference will be physically held in Urbino, with a small support for online participation** The Conference on Reversible Computation will bring together researchers from computer science, mathematics, engineering, and physics to discuss new developments and directions for future research in the emerging area of Reversible Computation. This particularly includes applications of reversibility in quantum computation. Research papers, tool demonstrations, and work-in-progress reports are within the scope of the conference. == CONTACT For any inquiry about physical / online participation please contact the chairs at revcomp2022 at gmail.com -------------- next part -------------- An HTML attachment was scrubbed... URL: From fredrik.nordvall-forsberg at strath.ac.uk Tue Jun 7 02:51:14 2022 From: fredrik.nordvall-forsberg at strath.ac.uk (Fredrik Nordvall Forsberg) Date: Tue, 7 Jun 2022 07:51:14 +0100 Subject: [TYPES/announce] Applied Category Theory 2022: Call for Participation Message-ID: CALL FOR PARTICIPATION 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!QBLWb3ZtIHTutsY-ASVcBGP5mlvnbPIk4N0eWfjOlclZcbJ0PyHTBxOP_h14JpYiOBAw5ZsHudRWbpvX1F75zlo9d7zR_sv0XcXUh8K0ScgmSg$ The 5th International Conference on Applied Category Theory will take place at the University of Strathclyde from 18 to 22 July 2022. This conference follows previous events at Cambridge (2021), MIT (2020), Oxford (2019) and Leiden (2018). HYBRID FORMAT The conference will be fully hybrid, that is, it will be possible for both the audience and presenters to participate remotely over Zoom, if preferred. REGISTRATION We are asking in-person participants to register and pay a nominal registration fee of GB?20 (about US$25) at the following link: https://urldefense.com/v3/__https://onlineshop.strath.ac.uk/conferences-and-events/science-faculty/computer-and-information-science/5th-international-conference-on-applied-category-theory-act-2022__;!!IBzWLUs!QBLWb3ZtIHTutsY-ASVcBGP5mlvnbPIk4N0eWfjOlclZcbJ0PyHTBxOP_h14JpYiOBAw5ZsHudRWbpvX1F75zlo9d7zR_sv0XcXUh8L8iqqMsg$ If the fee is a financial burden for you, please contact us. Online attendance will be free, although we ask that you nevertheless register using the above link. This will allow us to keep track of the numbers of participants, send out zoom links, etc. The university's Covid regulations change unpredictably, and we still don't know what the capacity of the room will be. In the event that we are over-subscribed, we have some side rooms where participants can watch the livestream together while still participating normally in coffee breaks etc. The reason for the registration fee is to give us the option to limit participation if it becomes necessary, and if that happens then places will be first-come-first-served except for accepted speakers. Registration closes: Sunday 10 July FINANCIAL SUPPORT We have a budget for financial assistance for participants thanks to our sponsors, for which priority will be given to accepted speakers, PhD students and early career researchers. Please contact the organisers if this would be useful to you, including information about your status, and your estimated costs. Financial support application deadline: Friday 10 June Anywhere on Earth Financial support notification: Monday 13 June TRAVEL AND ACCOMMODATION: Central Glasgow has many hotels and Airbnbs, but can be busy in the summer months. The conference will be held in the McCance building on the Strathclyde campus: https://urldefense.com/v3/__https://www.openstreetmap.org/way/86419875__;!!IBzWLUs!QBLWb3ZtIHTutsY-ASVcBGP5mlvnbPIk4N0eWfjOlclZcbJ0PyHTBxOP_h14JpYiOBAw5ZsHudRWbpvX1F75zlo9d7zR_sv0XcXUh8J8Lz0XYg$ The nearest hotel is the Premier Inn, about 30 seconds walk away. Glasgow is well served by trains in the UK (e.g. London Euston is 4.5 hours away), and can be reached from the European continent via a Eurostar train to London. Note that advance train tickets can be considerably cheaper in the UK. Glasgow has an international airport, and is also quite easily reachable from Edinburgh airport. Please see https://urldefense.com/v3/__https://msp.cis.strath.ac.uk/act2022/practical.html__;!!IBzWLUs!QBLWb3ZtIHTutsY-ASVcBGP5mlvnbPIk4N0eWfjOlclZcbJ0PyHTBxOP_h14JpYiOBAw5ZsHudRWbpvX1F75zlo9d7zR_sv0XcXUh8IVQxTW2A$ for more information. We look forward to welcoming you in Glasgow! -- The organisers Jules Hedges (jules.hedges at strath.ac.uk) Fredrik Nordvall Forsberg (fredrik.nordvall-forsberg at strath.ac.uk) Jade Master (jade.master at strath.ac.uk) James Fairbanks (fairbanksj at ufl.edu) From icfp.publicity at googlemail.com Tue Jun 7 04:34:21 2022 From: icfp.publicity at googlemail.com (ICFP Publicity) Date: Tue, 7 Jun 2022 16:34:21 +0800 Subject: [TYPES/announce] ICFP 2022: Call for Tutorials, Panels, and Discussions Message-ID: CALL FOR TUTORIAL, PANEL, AND DISCUSSION PROPOSALS ICFP 2022 27th ACM SIGPLAN International Conference on Functional Programming Sun 11 - Fri 16 September 2022 Ljubljana, Slovenia https://urldefense.com/v3/__https://icfp22.sigplan.org/__;!!IBzWLUs!RIYjYhX-p3kAjoee8mk3ljkI3mZoKw9qgDhnyPP9inZ5dtxLYniHmG_q9ZqLdqCuVfXOxxA4B22S8UZduvxOdbyuz53z3bPaHradr7oQmI4$ The 27th ACM SIGPLAN International Conference on Functional Programming will be held on September 11-16, 2022 in Ljubljana, Slovenia. ICFP provides a forum for researchers and developers to hear about the latest work on the design, implementations, principles, and uses of functional programming. Proposals are invited for tutorials, lasting approximately 3 hours each, to be presented during ICFP and its co-located workshops and other events. The tutorials may target an audience who is interested in commercial uses of functional programming, but we also welcome tutorials whose primary audience is researchers rather than practitioners. Tutorials may focus either on a concrete technology or on a theoretical or mathematical tool. Ideally, tutorials will have a concrete result, such as "Learn to do X with Y" rather than "Learn language Y". Just like last year, following the success of the #ShutDownPL event, we are also inviting proposals for panels and discussions on topics of broader interest to the PL community. Tutorials, panels, and discussions may occur before or after ICFP, co-located with the associated workshops, on September 11 or September 15-16. ---------------------------------------------------------------------- Submission details Deadline for submission: June 24st, 2022 Notification of acceptance: July 15th, 2022 Prospective organizers of tutorials are invited to submit a completed tutorial proposal form in plain text format to the ICFP 2022 workshop co-chairs (Arthur Azevedo de Amorim and Zoe Paraskevopoulou), via email to icfp-workshops-2022 at googlegroups.com by June 24st, 2022. Please note that this is a firm deadline. Organizers will be notified if their event proposal is accepted by July 8th, 2022. The proposal form is available at: https://urldefense.com/v3/__http://www.icfpconference.org/icfp2022-files/icfp22-panel-form.txt__;!!IBzWLUs!RIYjYhX-p3kAjoee8mk3ljkI3mZoKw9qgDhnyPP9inZ5dtxLYniHmG_q9ZqLdqCuVfXOxxA4B22S8UZduvxOdbyuz53z3bPaHradr4myp2I$ https://urldefense.com/v3/__http://www.icfpconference.org/icfp2022-files/icfp22-tutorials-form.txt__;!!IBzWLUs!RIYjYhX-p3kAjoee8mk3ljkI3mZoKw9qgDhnyPP9inZ5dtxLYniHmG_q9ZqLdqCuVfXOxxA4B22S8UZduvxOdbyuz53z3bPaHradbG2aE2I$ ---------------------------------------------------------------------- Selection committee The proposals will be evaluated by a committee comprising the following members of the ICFP 2022 organizing committee. Tutorials Co-Chair: Arthur Azevedo de Amorim (Boston University) Tutorials Co-Chair: Zoe Paraskevopoulou (Northeastern University) General Chair: Andrej Bauer (University of Ljubljana) Program Chair: Zena M. Ariola (University of Oregon) ---------------------------------------------------------------------- Further information Any queries should be addressed to the tutorial co-chairs (Arthur Azevedo de Amorim and Zoe Paraskevopoulou), via email to icfp-workshops-2022 at googlegroups.com. From andreeac at comp.nus.edu.sg Tue Jun 7 07:27:10 2022 From: andreeac at comp.nus.edu.sg (Andreea Costea) Date: Tue, 07 Jun 2022 14:27:10 +0300 Subject: [TYPES/announce] APLAS 2022 Call for Papers Message-ID: CALL FOR PAPERS 20th Asian Symposium on Programming Languages and Systems (APLAS 2022) Dec 5-Dec 22, 2022 Auckland, New Zealand (co-located with SPLASH 2022) https://urldefense.com/v3/__https://conf.researchr.org/home/aplas-2022__;!!IBzWLUs!XY8a-GXmhdL68TzuptxFsEgKTmuH1JjtcNXFqWpnUVi5Po4bKkx6pa4Zqqwi6wUet1ggKhNZKnywR8zSkvQwJQTefhpK06hSJ5UJ6gk$ Paper Submission Deadline: June 16, 2022, AoE APLAS aims to stimulate programming language research by providing a forum for the presentation of latest results and the exchange of ideas in programming languages and systems. APLAS is based in Asia but is an international forum that serves the worldwide programming languages community. We solicit submissions in the form of regular research papers describing original scientific research results, including system development and case studies. Among others, solicited topics include: * programming paradigms and styles: functional programming; object-oriented programming; probabilistic programming; logic programming; constraint programming; extensible programming languages; programming languages for systems code; novel programming paradigms; * methods and tools to specify and reason about programs and languages: programming techniques; meta-programming; domain-specific languages; proof assistants; type systems; dependent types; program logics, static and dynamic program analysis; language-based security; model checking; testing; * programming language foundations: formal semantics; type theory; logical foundations; category theory; automata; effects; monads and comonads; recursion and corecursion; continuations and effect handlers; program verification; memory models; abstract interpretation; * methods and tools for implementation: compilers; program transformations; rewriting systems; partial evaluation; virtual machines; refactoring; intermediate languages; run-time environments; garbage collection and memory management; tracing; profiling; build systems; program synthesis; * concurrency and distribution: process algebras; concurrency theory; session types; parallel programming; service-oriented computing; distributed and mobile computing; actor-based languages; verification and testing of concurrent and distributed systems; * applications and emerging topics: programming languages and PL methods in education, security, privacy, database systems, computational biology, signal processing, graphics, human-computer interaction, computer-aided design, artificial intelligence and machine learning; case studies in program analysis and verification. Submissions should not exceed 17 pages, excluding bibliography in the Springer LNCS format. The accepted papers will be allowed to use one extra page for the content to accommodate feedback from the reviews in the final paper versions. The review process of APLAS 2022 is double-anonymous, with a rebuttal phase. APLAS 2022 will have post-paper-acceptance voluntary artefact evaluation (new in 2022!). Authors of accepted will be welcome to submit artefacts for evaluation after paper notification. The outcome will not alter the paper acceptance decision. Submit your paper at https://urldefense.com/v3/__https://aplas2022.hotcrp.com__;!!IBzWLUs!XY8a-GXmhdL68TzuptxFsEgKTmuH1JjtcNXFqWpnUVi5Po4bKkx6pa4Zqqwi6wUet1ggKhNZKnywR8zSkvQwJQTefhpK06hS15Viksc$ Call for AEC nominations: https://urldefense.com/v3/__https://conf.researchr.org/track/aplas-2022/aplas-2022-aec*Reviewer-Information__;Iw!!IBzWLUs!XY8a-GXmhdL68TzuptxFsEgKTmuH1JjtcNXFqWpnUVi5Po4bKkx6pa4Zqqwi6wUet1ggKhNZKnywR8zSkvQwJQTefhpK06hSP_mJ9QA$ Important Dates: * Paper Submission Deadline: 16 Jun 2022, AoE * Author Response Period: Mon 1 - Wed 3 Aug 2022 * Author Notification: 15 Aug 2022 Programme Committee: Anders Miltner, UT Austin Andrzej S. Murawski, University of Oxford Anton Podkopaev, Higher School of Economics Aquinas Hobor, University College London Arie Gurfinkel, University of Waterloo Beniamino Accattoli, Inria Casper Bach Poulsen, Delft University of Technology Elena Zucca, University of Genova Eric Koskinen, Stevens Institute of Technology Farzaneh Derakhshan, Carnegie Mellon University Ilya Sergey, National University of Singapore (PC Chair) Isao Sasano, Shibaura Institute of Technology Jan de Muijnck-Hughes, University of Glasgow Jihyeok Park, Oracle Labs Marco Gaboardi, Boston University Marco Patrignani, University of Trento Meenakshi D'Souza, IIIT Bangalore Nengkun Yu, University of Technology Sydney Ondrej Leng?l, Brno University of Technology Pierre-Marie P?drot, Inria Rumyana Neykova, Brunel University London ?Shachar Itzhaky?, Technion Thi Thu Ha Doan, University of Freiburg Umang Mathur, National University of Singapore Xuan Bach Le, Singapore Management University Youyou Cong, Tokyo Institute of Technology Zhenjiang Hu, Peking University Artefact Evaluation Committee Co-Chairs: Arpita Dutta, National University of Singapore Jan de Muijnck-Hughes, University of Glasgow From rybal at microsoft.com Wed Jun 8 09:48:42 2022 From: rybal at microsoft.com (Andrey Rybalchenko) Date: Wed, 8 Jun 2022 13:48:42 +0000 Subject: [TYPES/announce] Post-doc at MSR Cambridge UK in constraint solving/program verification and synthesis/scheduling for AI/ML systems Message-ID: We are hiring a post-doctoral researcher to collaborate on automatic tools for development and deployment of cloud-scale AI/ML systems. There is a wealth of research opportunities and challenges in scheduling and optimization, constraint solving, program synthesis, local search, and other areas. Join us! https://urldefense.com/v3/__https://careers.microsoft.com/us/en/job/1354399/Full-time-Opportunities-Researcher-Cloud-Infrastructure__;!!IBzWLUs!RlG1p-ATX16XwCegzoAczuuUF_3JURtReo3txE7lxP8XN2Uy7kwAZCXz5X5o94bluOBVy2ThP2Z_8C4EKKcaeej2NRVPLA$ Contact: Andrey Rybalchenko (rybal at microsoft.com) -------------- next part -------------- An HTML attachment was scrubbed... URL: From h.basold at liacs.leidenuniv.nl Thu Jun 9 05:38:25 2022 From: h.basold at liacs.leidenuniv.nl (Henning Basold) Date: Thu, 9 Jun 2022 11:38:25 +0200 Subject: [TYPES/announce] Call for TYPES Steering Committee Nominations Message-ID: <57d55dcd-eb8c-1b2d-0f72-a737bebb5981@liacs.leidenuniv.nl> Dear colleagues, The steering committee of the TYPES conference series is looking for two new members to join us for three years. There are interesting challenges for the future of our beloved TYPES conference, for which we need people with a heart and ideas for the conference series! For instance will we have to handle challenges arising from the growing size of the TYPES community, the need for conferences with online elements and other aspects of academic life. Please consider nominating someone or yourself to join the steering committee. If you nominate someone else, then please check beforehand whether that person is in principle willing to join the SC. We will hold the elections of the new members during the general assembly on 21 June during TYPES 2022 in Nantes. Every nominee should briefly introduce oneself during the general assembly. If a nominee cannot be present there, we can also set up a video call, play a recording or if neither is possible present some slides for the nominee. Please send nominations and requests for video calls/playback via email to Henning Basold before Tuesday, 21 June, 12:00 (CEST). Nominations of people present can also be placed during the general assembly. Keep in mind that last minute nominations do not allow the nominee to prepare themselves though. Please forward this call to anyone who might be interested in joining the TYPES SC. In particular, we could use a bit more diversity in the composition of our members! Kind regards, The TYPES SC ------------------- www.types.name -------------- next part -------------- A non-text attachment was scrubbed... Name: OpenPGP_signature Type: application/pgp-signature Size: 665 bytes Desc: OpenPGP digital signature URL: From david.baelde at lsv.ens-cachan.fr Thu Jun 9 08:15:09 2022 From: david.baelde at lsv.ens-cachan.fr (David Baelde) Date: Thu, 09 Jun 2022 14:15:09 +0200 Subject: [TYPES/announce] Engineer and postdoc positions in France: proof assistant for crypto protocols Message-ID: Dear all, We are looking for engineers and postdocs to work on Squirrel, a proof assistant dedicated to proving cryptographic protocols. We have a broad range of projects in mind, ranging from pure OCaml development to involved protocol formalizations, with several theoretical questions in between. If you'd like to work on some of these aspects for one or more years, please get in touch with us! More details can be found here: https://urldefense.com/v3/__https://squirrel-prover.github.io/positions.pdf__;!!IBzWLUs!WXXyUPl3Ps5iEBpUhoFZGcf4r0v3Px8yj8zhU_JVSMCpycICrZvLR713B19J09BOhdA0W5iTvyjGaL8gko_Cs_hbxFmWJDu7zFB2IMvWsl670g$ Best regards, David Baelde From elaine.pimentel at gmail.com Sun Jun 12 11:42:52 2022 From: elaine.pimentel at gmail.com (Elaine Pimentel) Date: Sun, 12 Jun 2022 16:42:52 +0100 Subject: [TYPES/announce] CSL 2023 -- 2nd cfp Message-ID: ======================= CSL 2023 University of Warsaw, Poland February 13-16, 2023 ======================= 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!REA19NOXwPd5v_BBRsWG2wzqYRXg71arS5HATgjqaw5yVsas6XObwgo9tR4MJi0TsHJT8buiNB3XRSNN2y_3ia3hzjXDBu-yebJ0rl5z$ . It is an interdisciplinary conference, spanning across both basic and application oriented research in mathematical logic and computer science. CSL 2023 will be held in the University of Warsaw on February 13-16, 2023 ( https://urldefense.com/v3/__https://csl2023.mimuw.edu.pl/__;!!IBzWLUs!REA19NOXwPd5v_BBRsWG2wzqYRXg71arS5HATgjqaw5yVsas6XObwgo9tR4MJi0TsHJT8buiNB3XRSNN2y_3ia3hzjXDBu-yebJmL2PV$ ) Submission guidelines ===================== Submitted papers must be in English and must provide sufficient detail to allow the Program Committee to assess the merits of the paper. Full proofs may appear in a clearly marked technical appendix which will be read at the reviewers? discretion. Authors are strongly encouraged to include a well written introduction which is directed at all members of the PC. The papers should be submitted via easychair: https://urldefense.com/v3/__https://easychair.org/conferences/?conf=csl2023__;!!IBzWLUs!REA19NOXwPd5v_BBRsWG2wzqYRXg71arS5HATgjqaw5yVsas6XObwgo9tR4MJi0TsHJT8buiNB3XRSNN2y_3ia3hzjXDBu-yeYoTQ9cx$ The CSL 2023 conference proceedings will be published in Leibniz International Proceedings in Informatics (LIPIcs), see https://urldefense.com/v3/__https://submission.dagstuhl.de/documentation/authors__;!!IBzWLUs!REA19NOXwPd5v_BBRsWG2wzqYRXg71arS5HATgjqaw5yVsas6XObwgo9tR4MJi0TsHJT8buiNB3XRSNN2y_3ia3hzjXDBu-yeXhzb-vx$ . Authors are invited to submit contributed papers of no more than 15 pages in LIPIcs style (not including references), presenting unpublished work fitting the scope of the conference. Papers may not be submitted concurrently to another conference with refereed proceedings. The PC chairs should be informed of closely related work submitted to a conference or a journal. Papers authored or co-authored by members of the PC are not allowed. At least one of the authors of each accepted paper is expected to attend the conference in person to present their papers. Important dates =============== Abstract submission: July 9, 2022 (AoE) Paper submission: July 16, 2022 (AoE) Notification: September 30, 2022 Conference: February 13-16, 2023 Invited Speakers ================ Claudia Faggian (Universit? de Paris, France) Nina Gierasimczuk (Danish Technical University, Denmark) Dale Miller (Inria Saclay, France) Micha? Pilipczuk (University of Warsaw, Poland) Davide Sangiorgi (University of Bologna, Italy) Helena-Rasiowa-Award ==================== The Helena Rasiowa Award is the best student paper award for the CSL conference series, starting from CSL 2022. The award will be given to the best paper (as decided by the PC) written solely by students or for which students were the main contributors. A student in this context is any person who is currently studying for a degree or whose PhD award date is less than one year prior to the first day of the conference. Read more about the contribution of Helena Rasiowa to logic and computer science, and their interplay, here: https://urldefense.com/v3/__https://www.eacsl.org/helena-rasiowa-award-2/helena-rasiowa-award/__;!!IBzWLUs!REA19NOXwPd5v_BBRsWG2wzqYRXg71arS5HATgjqaw5yVsas6XObwgo9tR4MJi0TsHJT8buiNB3XRSNN2y_3ia3hzjXDBu-yeb0GtF5G$ . List of topics ============== - automated deduction and interactive theorem proving - constructive mathematics and type theory - equational logic and term rewriting - automata and games, game semantics - modal and temporal logic - model checking - decision procedures - logical aspects of computational complexity - finite model theory - computational proof theory - logic programming and constraints - lambda calculus and combinatory logic - domain theory - categorical logic and topological semantics - database theory - specification, extraction and transformation of programs - logical aspects of quantum computing - logical foundations of programming paradigms - verification and program analysis - linear logic - higher-order logic - nonmonotonic reasoning Program Committee ================= Matteo Acclavio (University of Luxembourg, Luxembourg) Patricia Bouyer-Decitre (LSV, CNRS & ENS Paris-Saclay, France) Agata Ciabattoni (TU-Wien, Austria) Diana Costa (University of Lisbon, Portugal) Gilles Dowek (INRIA & ENS Paris-Saclay, France) Mart?n Escard? (University of Birmingham, UK) Rajeev Gor? (The Australian National University, Australia) Giulio Guerrieri (Huawei Edinburgh Research Centre, UK) Shin-ya Katsumata (National Institute of Informatics, Japan) Delia Kesner (Universit? de Paris, France) Sandra Kiefer (RWTH Aachen University, Germany) Bartek Klin (University of Oxford, UK, co-chair) Naoki Kobayashi (The University of Tokyo, Japan) Stepan Kuznetsov (HSE University, Russia) Martin L?ck (Leibniz Universit?t Hannover, Germany) Meena Mahajan (The Institute of Mathematical Sciences, India) Filip Murlak (University of Warsaw, Poland) Daniele Nantes (University of Bras?lia, Brazil) Elaine Pimentel (UCL, UK, co-chair) Paolo Pistone (University of Bologna, Italy) Ana Sokolova (University of Salzburg, Austria) Lutz Stra?burger (Inria Saclay ? ?le-de-France, France) Pascal Schweitzer (TU Darmstadt, Germany) Martin Zimmermann (Aalborg University, Denmark) Yoni Zohar (Bar Ilan University, Israel) Organizing Committee ==================== Lorenzo Clemente, Wojciech Czerwi?ski, Rados?aw Pi?rkowski (University of Warsaw) Contact ======== Please send all questions about submissions to the PC co-chairs: csl2023 at easychair.org -------------- next part -------------- An HTML attachment was scrubbed... URL: From anuj.dawar at cl.cam.ac.uk Fri Jun 10 07:05:20 2022 From: anuj.dawar at cl.cam.ac.uk (Anuj Dawar) Date: Fri, 10 Jun 2022 12:05:20 +0100 Subject: [TYPES/announce] FSTTCS 2022 - Call for Papers Message-ID: <711b2660-448a-91ab-163d-721000716481@cl.cam.ac.uk> FSTTCS 2022 - Call for Papers ----------------------------- https://urldefense.com/v3/__https://www.fsttcs.org.in/2022/__;!!IBzWLUs!Xi2rl3carLlls0e83TjKzOh8YTNSBNijbhLsh9cT_t5v7z0MlVBH3TYZC0DpOKUIi8f7ov36R0bhYNZXYUNUeXmXR9rkmqpxwopMy6E$ FSTTCS 2022 is the 42nd conference on Foundations of Software Technology and Theoretical Computer Science. It is organised by IARCS, the Indian Association for Research in Computing Science, in association with ACM India. It is a forum for presenting original results in foundational aspects of Computer Science and Software Technology. FSTTCS 2022 will be held in IIT Madras during December 18?20, 2022. List of Topics ----------- Track A ------ Algebraic Complexity Algorithms and Data Structures Algorithmic Graph Theory and Combinatorics Approximation Algorithms Combinatorial Optimization Communication Complexity Computational Biology Computational Complexity Computational Geometry Computational Learning Theory Cryptography and Security Data Streaming and Sublinear algorithms Economics and Computation Parallel, Distributed and Online Algorithms Parameterized Complexity Proof Complexity Quantum Computing Randomness in Computing Theoretical Aspects of Mobile and High-Performance Computing Track B ------ Automata, Games and Formal Languages Logic in Computer Science Modal and Temporal Logics Models of Concurrent, Distributed and Mobile Systems Models of Timed, Reactive, Hybrid and Stochastic Systems Model Theory Principles and Semantics of Programming Languages Program Analysis and Transformation Security protocols Specification, Verification and Synthesis Theorem Proving and Decision Procedures Invited Speakers ------------- Patricia Bouyer-Decitre (CNRS & ENS Paris-Saclay) Irit Dinur (Weizmann Institute) Anupam Gupta (Carnegie Mellon) Akash Lal (Microsoft Research) Rahul Santhanam (University of Oxford) Submission Guidelines ------------------ Submissions must be in electronic form via EasyChair (using the following link: https://urldefense.com/v3/__https://easychair.org/my/conference?conf=fsttcs2022__;!!IBzWLUs!Xi2rl3carLlls0e83TjKzOh8YTNSBNijbhLsh9cT_t5v7z0MlVBH3TYZC0DpOKUIi8f7ov36R0bhYNZXYUNUeXmXR9rkmqpxKkynjdE$ ) in the LIPIcs LaTeX style which is available here: https://urldefense.com/v3/__https://submission.dagstuhl.de/documentation/authors__;!!IBzWLUs!Xi2rl3carLlls0e83TjKzOh8YTNSBNijbhLsh9cT_t5v7z0MlVBH3TYZC0DpOKUIi8f7ov36R0bhYNZXYUNUeXmXR9rkmqpx9XOJTIk$ . Submissions must not exceed 15 pages (excluding bibliography), but may include a clearly marked appendix containing technical details. The appendix will be read only at the discretion of the program committee. Simultaneous submissions to journals or other conferences with published proceedings are disallowed. Accepted papers will be published as proceedings of the conference in the ?Leibniz International Proceedings in Informatics (LIPIcs)? as a free, open, electronic archive with access to all. Authors will retain full rights over their work. The accepted papers will be published under a ?CC-BY license?. For an accepted paper to be included in the proceedings, one of the authors must commit to presenting the paper at the conference. Important Dates Submission deadline: July 14, 2022 AoE (firm) Notification to authors: September 16, 2022 FSTTCS 2022: December 18?20, 2022. Programme Committee ------------------ Track A ------ Venkatesan Guruswami (University of California, Berkeley) ? Co-chair V. Arvind (The Institute of Mathematical Sciences) Divesh Aggarwal (National University of Singapore) Diptarka Chakraborty (National University of Singapore) Radu Curticapean (IT University of Copenhagen) Sumegha Garg (Harvard University) Badih Ghazi (Google Research) Tom Gur (University of Warwick) Euiwoong Lee (University of Michigan) Debmalya Panigrahi (Duke University) Pravesh Kothari (Carnegie Mellon University) Nicole Megow (Universit?t Bremen) Prajakta Nimbhorkar (Chennai Mathematical Institute) Rishi Saket (Google Research, India) Ramprasad Saptharishi (Tata Institute of Fundamental Research) Rakesh Venkat (Indian Institute of Technology, Hyderabad) David Wajc (Stanford University) Amir Yehudayoff (Technion, Israel) Meirav Zahavi (Ben-Gurion University, Israel) Track B ------ Anuj Dawar (University of Cambridge) ? Co-chair Ashutosh Trivedi (University of Colorado Boulder) Deepak D?Souza (Indian Institute of Science) Igor Walukiewicz (Universit? de Bordeaux, France) Jonni Virtema (University of Sheffield, UK) Laura Bozzelli (University of Naples, Italy) Laure Daviaud (City University of London) Maribel Fernandez (King's College London) Mohamed Faouzi Atig (Uppsala University, Sweden) Natasha Alechina (Utrecht University, Netherlands) Nathan Lhote (Aix-Marseille University, France) Olaf Beyersdorff (Friedrich Schiller University Jena, Germany) Radha Jagadeesan (DePaul University) Shaull Almagor (Technion, Israel) Shibashis Guha (Tata Institute of Fundamental Research) Supratik Chakraborty (Indian Institute of Technology, Bombay) Organizing Committee Meghana Nasre (IIT Madras) ? co-chair Chandrashekhar Sahasrabudhe (ACM India, Member) Jayalal Sarma (IIT Madras) ? co-chair Contact Information All questions about submissions should be emailed to the PC chairs: anuj.dawar at cl.cam.ac.uk or venkatg at berkeley.edu From Neil.JR.Ross at Dal.Ca Mon Jun 13 05:27:05 2022 From: Neil.JR.Ross at Dal.Ca (Julien Ross) Date: Mon, 13 Jun 2022 09:27:05 +0000 Subject: [TYPES/announce] PLanQC 2022: Final call for submissions and student travel support Message-ID: PLanQC 2022: Programming Languages for Quantum Computing Final Call for Submissions & Student Travel Support We invite members of the programming languages and quantum computing communities to submit talk proposals for the 3rd International Workshop on Programming Languages for Quantum Computing (PLanQC 2022), co-located this September with ICFP in Ljubljana, Slovenia. PLanQC aims to bring together researchers from the fields of programming languages and quantum information, exposing the programming languages community to the unique challenges of programming quantum computers. It will promote the development of tools to assist in the process of programming quantum computers, as they exist today and as they are likely to exist in the near to distant future. Submissions to PLanQC should take the form of 2-5 page abstracts (single-column, 11pt acmsmall style, not including references), with links to larger preprints when appropriate. Work in progress is welcome. We hope to make PLanQC maximally accessible to the programming languages community. Thus, abstracts should cover cutting edge ideas and results, but not be opaque to new, potential entrants to quantum computing coming from programing languages. Abstracts will be reviewed for quality and relevance to the workshop, and accepted authors will be invited to give talks or poster presentations. We will not be publishing formal proceedings, but the extended abstracts, along with links (where available) to full papers will be posted to the website of the workshop. Invited speakers: ? Dominique Unruh, University of Tartu ? Charles Yuan, MIT Workshop topics include (but are not limited to): ? High-level quantum programming languages ? Verification tools for quantum programs ? Novel quantum programming abstractions ? Quantum circuit and program optimizations ? Hardware-aware circuit compilation and routing ? Error handling, mitigation, and correction ? Instruction sets for quantum hardware ? Other techniques from traditional programming languages (e.g., types, compilation/optimization, foreign function interfaces) applied to the domain of quantum computation. ------------------------------------------------------------------------- Student support: Limited travel support is available to students wishing to attend PLanQC. Further information and can be found on the workshop website: https://urldefense.com/v3/__https://icfp22.sigplan.org/home/planqc-2022*Travel-Support-for-Students__;Iw!!IBzWLUs!XwU_gI8J4CO19RhZ3i_nbZdhnhrflwYfoMnv2cpRI0d-Pa5vfNOWHIn1tVbk-SPV99b4a1yRQL9OW0q-uEdqUZOzYXA-cCEgBkPw$ ------------------------------------------------------------------------- Important dates: ? Submission deadline 20 June 2022 (anywhere on earth) ? Notification 1 August 2022 ? Workshop 15 September 2022 ------------------------------------------------------------------------- Important links: ? Website: https://urldefense.com/v3/__https://icfp22.sigplan.org/home/planqc-2022__;!!IBzWLUs!XwU_gI8J4CO19RhZ3i_nbZdhnhrflwYfoMnv2cpRI0d-Pa5vfNOWHIn1tVbk-SPV99b4a1yRQL9OW0q-uEdqUZOzYXA-cCHNCiK7$ ? Submission: https://urldefense.com/v3/__https://planqc2022.hotcrp.com/__;!!IBzWLUs!XwU_gI8J4CO19RhZ3i_nbZdhnhrflwYfoMnv2cpRI0d-Pa5vfNOWHIn1tVbk-SPV99b4a1yRQL9OW0q-uEdqUZOzYXA-cO0YRlII$ ------------------------------------------------------------------------- Program Committee: Matthew Amy, Simon Fraser University Robert Booth, The University of Edinburgh Olivia Di Matteo, University of British Columbia Yufei Ding, UC Santa Barbara Ross Duncan, Cambridge Quantum Computing Ltd Peng (Frank) Fu, Dalhousie University Kesha Hietala, University of Maryland Kohei Kishida, University of Illinois Urbana-Champaign Aleks Kissinger, University of Oxford Bert Lindenhovius, Tulane University Robert Rand, University of Chicago Mathys Rennela, Inria Neil Julien Ross (chair), Dalhousie University Sam Staton, University of Oxford Mathias Soeken, Microsoft Dominique Unruh, University of Tartu Beno?t Valiron, Universit? Paris-Saclay, CNRS, CentraleSup?lec, LMF Vladimir Zamdzhiev, Inria, LORIA, Universit? de Lorraine Organizing Committee: Matt Amy, Simon Fraser University Ross Duncan, Cambridge Quantum Computing Robert Rand, University of Chicago Neil Julien Ross, Dalhousie University -------------- next part -------------- An HTML attachment was scrubbed... URL: From daniele.nantes at gmail.com Mon Jun 13 12:22:57 2022 From: daniele.nantes at gmail.com (Daniele Nantes) Date: Mon, 13 Jun 2022 17:22:57 +0100 Subject: [TYPES/announce] WiL 2022 - Call for Participation Message-ID: Are you a woman working in logic? Please join us on July 31 at WiL, give a talk, and enjoy a day with Women in Logic! * Everybody is welcome! There is some funding available for participants! * Please apply here: https://urldefense.com/v3/__https://forms.gle/4uxFdTrt4sNYsYp29__;!!IBzWLUs!XDft_dsbTx-ADN4HL8gRU42-95WwIS3xiOj484MfyrZDDWKzCkUTsMOaqqfdPKV4XlFHRnHThpx8GUP0yTFw9zGWfKhWrrOCl84IbFw$ Registration: https://urldefense.com/v3/__https://www.floc2022.org/registration__;!!IBzWLUs!XDft_dsbTx-ADN4HL8gRU42-95WwIS3xiOj484MfyrZDDWKzCkUTsMOaqqfdPKV4XlFHRnHThpx8GUP0yTFw9zGWfKhWrrOClXidsTk$ ----------------------------------------------------------------------------------------- First Call for Participation WiL 2022: 6th Women in Logic Workshop July 31, 2022 part of FLoC 2022 https://urldefense.com/v3/__https://sites.google.com/g.uporto.pt/wil2022__;!!IBzWLUs!XDft_dsbTx-ADN4HL8gRU42-95WwIS3xiOj484MfyrZDDWKzCkUTsMOaqqfdPKV4XlFHRnHThpx8GUP0yTFw9zGWfKhWrrOCaXuw2m4$ ----------------------------------------------------------------------------------------- Women in Logic 2022 is a satellite event of the 8th Federated Logic Conference (FLoC 2022) to be held in Haifa, Israel, from July 31 to August 12, 2022. The Women in Logic workshop (WiL) provides an opportunity to increase awareness of the valuable contributions made by women in the area of logic in computer science. Its main purpose is to promote the excellent research done by women, with the ultimate goal of increasing their visibility and representation in the community. Our aim is to: - provide a platform for female researchers to share their work and achievements; - increase the feelings of community and belonging, especially among junior faculty, post-docs, and students through positive interactions with peers and more established faculty; - establish new connections and collaborations; - foster a welcoming culture of mutual support and growth within the logic research community. We believe these aspects will benefit women working in logic and computer science, particularly early-career researchers. Previous versions of Women in Logic (Reykjav?k 2017, Oxford 2018, Vancouver 2019, Paris 2020, and Rome 2021) were very successful in showcasing women's work and as catalysts for a recognition of the need for change in the community. Topics of interest include but are not limited to: automata theory, automated deduction, categorical models and logics, concurrency and distributed computation, constraint programming, constructive mathematics, database theory, decision procedures, description logics, domain theory, finite model theory, formal aspects of program analysis, formal methods, foundations of computability, games and logic, higher-order logic, lambda and combinatory calculi, linear logic, logic in artificial intelligence, logic programming, logical aspects of bioinformatics, logical aspects of computational complexity, logical aspects of quantum computation, logical frameworks, logics of programs, modal and temporal logics, model checking, probabilistic systems, process calculi, programming language semantics, proof theory, real-time systems, reasoning about security and privacy, rewriting, type systems and type theory, and verification. INVITED SPEAKERS * Dana Fisman (Ben-Gurion University of the Negev) * Delia Kesner (IRIF - Universit? de Paris) IMPORTANT DATES Abstract submission deadline: May 29, 2022 Notification: June 17, 2022 Contribution for Informal Proceedings: June 29, 2022 Workshop: July 31, 2022 ORGANIZING AND PROGRAM COMMITTEE * Maria Aloni (University of Amsterdam) * Sandra Alves (Co-chair, University of Porto) * Lourdes Del Carmen Gonz?lez Huesca (Universidad Nacional Aut?noma de M?xico) * Amy Felty (University of Ottawa) * Sandra Kiefer (Co-chair, Max Planck Institute for Software Systems) * Daniele Nantes (Co-chair, University of Bras?lia/ Imperial College London) * Valeria de Paiva (Topos Institute) * Elaine Pimentel (University College London) * Simona Ronchi Della Rocca (Universit? di Torino) * Renate A. Schmidt (University of Manchester) * Ana Sokolova (University of Salzburg) * Femke Van Raamsdonk (University of Amsterdam) * Rineke Verbrugge (University of Groningen) -- 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!XDft_dsbTx-ADN4HL8gRU42-95WwIS3xiOj484MfyrZDDWKzCkUTsMOaqqfdPKV4XlFHRnHThpx8GUP0yTFw9zGWfKhWrrOCesMvstA$ -------------- next part -------------- An HTML attachment was scrubbed... URL: From Luigia.Petre at abo.fi Mon Jun 13 16:00:15 2022 From: Luigia.Petre at abo.fi (Luigia Petre) Date: Mon, 13 Jun 2022 20:00:15 +0000 Subject: [TYPES/announce] FME Tutorial series lecture this week, June 17, at 3 pm CET: Dr Tim Nelson (Brown University, US) on "Building Formal Methods Classes for Everybody" Message-ID: <1a2a9eb9182946828248d3f5761abe55@abo.fi> Dear all, The FME Tutorial series continues! This week we have the pleasure of listening to Dr Tim Nelson's (Brown University, US) lecture on Friday June 17, 2022, at 3 pm CET. His talk is entitled "Building Formal Methods Classes for Everybody". The abstract of Dr Nelson's lecture is here: We think math and logic are beautiful and essential. If you teach a formal methods class, you probably agree. Some of our students, perhaps the most visible to us, also feel that way. But what about the other 90%, the students who aren?t inclined to take our classes or any non-required ?theory? class at all? If formal methods really are essential, we owe every student an opportunity to explore them, discover useful ideas, and maybe even fall in love. Some people derisively respond to a more inclusive class by assuming it will coddle students. On the contrary, these students have their own strengths and abilities that we can and should design rigorous content around. After all, many of them will build the technologies we all use every day, so deepening their view of formalism satisfies both moral and selfish imperatives. This talk will cover the design space of such a course: pedagogy, tool choice (sometimes building our own!), assignment design, and even TA hiring. I?ll talk about things that have worked well for us, other things that didn?t, and what we learned along the way. 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!VM5bFBUo6f-WYoWibb6Crb6VLTIJIUffRRTXNGPo1mKyE9PrNrihU26A_Q3BCmdMKYD8OUlH4sFizZvYewqwPFQ-SFe-cS7IQs1b$ . Please note that we have a speaker every month from now on until October!! PS2: the June 2022 lecture is scheduled exceptionally on the 17th of the month, instead of the usual last Friday of the month, due to the summer holidays of some of the involved academics. __ Luigia Petre, Docent, PhD Faculty of Science and Engineering ?bo Akademi University, Finland https://urldefense.com/v3/__http://www.users.abo.fi/lpetre__;!!IBzWLUs!VM5bFBUo6f-WYoWibb6Crb6VLTIJIUffRRTXNGPo1mKyE9PrNrihU26A_Q3BCmdMKYD8OUlH4sFizZvYewqwPFQ-SFe-cUumMt3h$ -------------- next part -------------- An HTML attachment was scrubbed... URL: From ifl21.publicity at gmail.com Mon Jun 13 16:25:08 2022 From: ifl21.publicity at gmail.com (Pieter Koopman) Date: Mon, 13 Jun 2022 13:25:08 -0700 Subject: [TYPES/announce] CALL FOR PAPERS - IFL22 - The 34th Symposium on Implementation and Application of Functional Languages Message-ID: *CALL FOR PAPERS - The 34th Symposium on Implementation and Application of Functional Languages* *Important dates* Draft paper submission: 7th of August 2022 Draft paper notification: 9th of August 2022 Registration deadline: 12th of August 2022 Symposium: 31th of August to 2nd of September *Scope* The goal of the IFL symposia is to bring together researchers actively engaged in the implementation and application of functional and function-based programming languages. IFL 2022 will be a venue for researchers to present and discuss new ideas and concepts, work in progress, and publication-ripe results related to the implementation and application of functional languages and function-based programming. Topics of interest to IFL include, but are not limited to: * language concepts * type systems, type checking, type inferencing * compilation techniques * staged compilation * run-time function specialization * run-time code generation * partial evaluation * abstract interpretation * metaprogramming * generic programming * automatic program generation * array processing * concurrent/parallel programming * concurrent/parallel program execution * embedded systems * web applications * embedded domain specific languages * security * novel memory management techniques * run-time profiling performance measurements * debugging and tracing * virtual/abstract machine architectures * validation, verification of functional programs * tools and programming techniques * industrial applications *Submissions and peer-review* Following IFL tradition, IFL 2022 will use a post-symposium review process to produce the formal proceedings. Before the symposium authors submit draft papers. These draft papers will be screened by the program chair to make sure that they are within the scope of IFL. The draft papers will be made available to all participants at the symposium. Each draft paper is presented by one of the authors at the symposium. After the symposium, a formal review process will take place, conducted by the program committee. Reviewing is single blind. There will be at least 3 reviews per paper. The reviewers have 6 weeks to write their reviews. For the camera-ready version the authors can make minor revisions which are accepted without further reviewing. *Where* IFL 2022 will be held physically in Copenhagen, Denmark, arranged by DIKU at the University of Copenhagen. See the IFL 2022 website at https://urldefense.com/v3/__https://ifl22.github.io/__;!!IBzWLUs!WTrAoUz_QOp-Rfl-OaNMM0WWet9o9m0UJyiEanAutR2fWoXtHqifxI4BFhY4K1BGMqmLa5EqjRSFq82sQRwUpTaR5DYCM-XiJ_yUaUEh$ for more information. [image: beacon] -------------- next part -------------- An HTML attachment was scrubbed... URL: From ohad.kammar at ed.ac.uk Tue Jun 14 07:57:02 2022 From: ohad.kammar at ed.ac.uk (KAMMAR Ohad) Date: Tue, 14 Jun 2022 11:57:02 +0000 Subject: [TYPES/announce] CfP: SPLASH Onward! 2022 Message-ID: Hi everyone, Please see call below from Onward! (part of SPLASH). Please also share far and wide. Yours, Ohad. ---------------------------------------------------------------------------------------------------------- Onward! Papers, part of SPLASH 2022 https://urldefense.com/v3/__https://2022.splashcon.org/track/splash-2022-Onward-papers__;!!IBzWLUs!QCwOlKUv37z7ACk460A5x_OCdgFEcYjY00OOEvv4Hf2RfpymYVeCUbN5ap4BlCoe3MnkQcbV7Y-ZxmUm0FTUJ8KuxjCvcTf3krZH$ Onward! is a premier multidisciplinary conference focused on everything to do with programming and software: including processes, methods, languages, communities and applications. Onward! is more radical, more visionary and more open than other conferences to ideas that are well-argued but not yet proven. We welcome different ways of thinking about, approaching and reporting on programming language and software engineering research. # The Character of Onward! Onward! Papers is looking for grand visions and new paradigms that could make a big difference in how we will one day build software. But it is not looking for research-as-usual papers?conferences like OOPSLA are the place for that. Those conferences require rigorous validation such as theorems or empirical experiments, which are necessary for scientific progress, but which typically preclude discussion of early-stage ideas. Onward! papers must also supply some degree of validation because mere speculation is not a good basis for progress. However, Onward! accepts less rigorous methods of validation such as compelling arguments, exploratory implementations, and substantial examples. The use of worked-out examples to support new ideas is strongly encouraged. For additional information, clarification, or answers to questions please contact David Tolpin the PC Chair via onward at splashcon.org. 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 stevez at seas.upenn.edu Tue Jun 14 15:42:05 2022 From: stevez at seas.upenn.edu (Steve Zdancewic) Date: Tue, 14 Jun 2022 15:42:05 -0400 Subject: [TYPES/announce] Certified Programs and Proofs (CPP) 2023 Call for Papers Message-ID: <7ba8c72c-96dc-a0a9-8282-f42495dc0b51@seas.upenn.edu> Certified Programs and Proofs (CPP) is an international conference on practical and theoretical topics in all areas that consider formal verification and certification as an essential paradigm for their work. CPP spans areas of computer science, mathematics, logic, and education. CPP 2023 (https://urldefense.com/v3/__https://popl23.sigplan.org/home/CPP-2023__;!!IBzWLUs!XhzhuWbmKJz6BH4W-V5el9VAVfqQr4-ktnJt-OCMajRL7mUX-Wno6CS9kFcd77Ru-aRLx4sBkOY19nEwK4UVjuzAN5nuiTnpEqM$ ) will be held on 16-17 January 2023 and will be co-located with POPL 2023 in Boston, Massachusetts, United States. CPP 2023 is sponsored by ACM SIGPLAN, in cooperation with ACM SIGLOG. CPP 2023 will welcome contributions from all members of the community. The CPP 2023 organizers will strive to enable both in-person and remote participation, in cooperation with the POPL 2023 organizers. IMPORTANT DATES * Abstract Submission Deadline: 14 September 2022 at 23:59 AoE (UTC-12h) * Paper Submission Deadline: 21 September 2022 at 23:59 AoE (UTC-12h) * Notification (tentative): 21 November 2022 * Camera Ready Deadline (tentative): 12 December 2022 * Conference: 16-17 January 2023 Deadlines expire at the end of the day, anywhere on earth. Abstract and submission deadlines are strict and there will be no extensions. DISTINGUISHED PAPER AWARDS Around 10% of the accepted papers at CPP 2023 will be designated as Distinguished Papers. This award highlights papers that the CPP program committee thinks should be read by a broad audience due to their relevance, originality, significance and clarity. TOPICS OF INTEREST We welcome submissions in research areas related to formal certification of programs and proofs. The following is a non-exhaustive list of topics of interest to CPP: * certified or certifying programming, compilation, linking, OS kernels, runtime ? systems, security monitors, and hardware; * certified mathematical libraries and mathematical theorems; * proof assistants (e.g, ACL2, Agda, Coq, Dafny, F*, HOL4, HOL Light, Idris, ? Isabelle, Lean, Mizar, Nuprl, PVS, etc); * new languages and tools for certified programming; * program analysis, program verification, and program synthesis; * program logics, type systems, and semantics for certified code; * logics for certifying concurrent and distributed systems; * mechanized metatheory, formalized programming language semantics, and logical ? frameworks; * higher-order logics, dependent type theory, proof theory, logical systems, ? separation logics, and logics for security; * verification of correctness and security properties; * formally verified blockchains and smart contracts; * certificates for decision procedures, including linear algebra, polynomial ? systems, SAT, SMT, and unification in algebras of interest; * certificates for semi-decision procedures, including equality, first-order ? logic, and higher-order unification; * certificates for program termination; * formal models of computation; * mechanized (un)decidability and computational complexity proofs; * formally certified methods for induction and coinduction; * integration of interactive and automated provers; * logical foundations of proof assistants; * applications of AI and machine learning to formal certification; * user interfaces for proof assistants and theorem provers; * teaching mathematics and computer science with proof assistants. SUBMISSION GUIDELINES Prior to the paper submission deadline, the authors should upload their anonymized paper in PDF format through the HotCRP system at https://urldefense.com/v3/__https://cpp2023.hotcrp.com__;!!IBzWLUs!XhzhuWbmKJz6BH4W-V5el9VAVfqQr4-ktnJt-OCMajRL7mUX-Wno6CS9kFcd77Ru-aRLx4sBkOY19nEwK4UVjuzAN5nufV8zYik$ The submissions must be written in English and provide sufficient detail to allow the program committee to assess the merits of the contribution. They must be formatted following the ACM SIGPLAN Proceedings format using the acmart style with the sigplan option, which provides a two-column style, using 10 point font for the main text, and a header for double blind review submission, i.e., \documentclass[sigplan,10pt,anonymous,review]{acmart}\settopmatter{printfolios=true,printccs=false,printacmref=false} The submitted papers should not exceed 12 pages, including tables and figures, but excluding bibliography and clearly marked appendices. The papers should be self-contained without the appendices. Shorter papers are welcome and will be given equal consideration. Submissions not conforming to the requirements concerning format and maximum length may be rejected without further consideration. CPP 2023 will employ a lightweight double-blind reviewing process following the process from previous years. To facilitate this, the submissions must adhere to two rules: (1) author names and institutions must be omitted, and (2) references to authors? own related work should be in the third person (e.g., ??? not "We build on our previous work ..." but rather "We build on the work of ??? ..."). The purpose of this process is to help the PC and external reviewers come to an initial judgment about the paper without bias, not to make it impossible for them to discover the authors if they were to try. Nothing should be done in the name of anonymity that weakens the submission or makes the job of reviewing it more difficult. In particular, important background references should not be omitted or anonymized. In addition, authors are free to disseminate their ideas or draft versions of their papers as usual. For example, authors may post drafts of their papers on the web or give talks on their research ideas. Note that POPL 2023 itself will employ full double-blind reviewing, which differs from the light-weight CPP process.? This FAQ from previous SIGPLAN conference addresses many common concerns: https://urldefense.com/v3/__https://popl20.sigplan.org/track/POPL-2020-Research-Papers*Submission-and-Reviewing-FAQ__;Iw!!IBzWLUs!XhzhuWbmKJz6BH4W-V5el9VAVfqQr4-ktnJt-OCMajRL7mUX-Wno6CS9kFcd77Ru-aRLx4sBkOY19nEwK4UVjuzAN5nut8EsKp8$ We strongly encourage the authors to provide any supplementary material that supports the claims made in the paper, such as proof scripts or experimental data. This material must be uploaded at submission time, as an archive, not via a URL. Two forms of supplementary material may be submitted: (1) Anonymous supplementary material is made available to the reviewers before they submit their first-draft reviews. (2) Non-anonymous supplementary material is made available to the reviewers after they have submitted their first-draft reviews and have learned the identity of the authors. Please use anonymous supplementary material whenever possible, so that it can be taken into account from the beginning of the reviewing process. The submitted papers must adhere to the SIGPLAN Republication Policy (https://urldefense.com/v3/__https://www.sigplan.org/Resources/Policies/Republication/__;!!IBzWLUs!XhzhuWbmKJz6BH4W-V5el9VAVfqQr4-ktnJt-OCMajRL7mUX-Wno6CS9kFcd77Ru-aRLx4sBkOY19nEwK4UVjuzAN5nuds4qrYs$ ) and the ACM Policy on Plagiarism (https://urldefense.com/v3/__https://www.acm.org/publications/policies/plagiarism__;!!IBzWLUs!XhzhuWbmKJz6BH4W-V5el9VAVfqQr4-ktnJt-OCMajRL7mUX-Wno6CS9kFcd77Ru-aRLx4sBkOY19nEwK4UVjuzAN5numumPesI$ ). Concurrent submissions to other conferences, journals, workshops with proceedings, or similar forums of publication are not allowed. The PC chairs should be informed of closely related work submitted to a conference or journal in advance of submission. One author of each accepted paper is expected to present it at the (possibly virtual) conference. PUBLICATION, COPYRIGHT AND OPEN ACCESS The CPP 2023 proceedings will be published by the ACM, and authors of accepted papers will be required to choose one of the following publication options: (1) Author retains copyright of the work and grants ACM a non-exclusive ??? permission-to-publish license and, optionally, licenses the work under a ??? Creative Commons license. (2) Author retains copyright of the work and grants ACM an exclusive ??? permission-to-publish license. (3) Author transfers copyright of the work to ACM. For authors who can afford it, we recommend option (1), which will make the paper Gold Open Access, and also encourage such authors to license their work under the CC-BY license. ACM will charge you an article processing fee for this option (currently, US$700), which you have to pay directly with the ACM. For everyone else, we recommend option (2), which is free and allows you to achieve Green Open Access, by uploading a preprint of your paper to a repository that guarantees permanent archival such as arXiv or HAL. This is anyway a good idea for timely dissemination even if you chose option 1. The official CPP 2023 proceedings will also be available via SIGPLAN OpenTOC (https://urldefense.com/v3/__http://www.sigplan.org/OpenTOC/*cpp__;Iw!!IBzWLUs!XhzhuWbmKJz6BH4W-V5el9VAVfqQr4-ktnJt-OCMajRL7mUX-Wno6CS9kFcd77Ru-aRLx4sBkOY19nEwK4UVjuzAN5nuxwdHDhw$ ). For ACM?s take on this, see their Copyright Policy (https://urldefense.com/v3/__http://www.acm.org/publications/policies/copyright-policy__;!!IBzWLUs!XhzhuWbmKJz6BH4W-V5el9VAVfqQr4-ktnJt-OCMajRL7mUX-Wno6CS9kFcd77Ru-aRLx4sBkOY19nEwK4UVjuzAN5nuWdRdgjg$ ) and Author Rights (https://urldefense.com/v3/__http://authors.acm.org/main.html__;!!IBzWLUs!XhzhuWbmKJz6BH4W-V5el9VAVfqQr4-ktnJt-OCMajRL7mUX-Wno6CS9kFcd77Ru-aRLx4sBkOY19nEwK4UVjuzAN5nuvPiTaXo$ ). PROGRAM COMMITTEE Steve Zdancewic, University of Pennsylvania, USA (co-chair) Brigitte Peintka, McGill University, Canada (co-chair) Reynald Affeldt, AIST, Japan Tej Chajed, MIT, USA Koen Claessen, Chalmers, Sweden Ranald Clouston, ANU, Australia Leonardo de Moura, Microsoft Research, USA Xinyu Feng, Nanjing University, China Denis Firsov, Tallinn University/GuardTime, Estonia Yannick Forster, Inria Nantes, France Milos Gligoric, UT Austin, USA Stephane Graham-Lengrand, SRI, USA Elsa Gunter, Univerisity of Illinois Urbana-Champaign, USA Chris Hawblitzel, Microsoft Research, US Chantal Keller , Universit? Paris Saclay, France Marie Kerjean, CNRS, France Yoonseung Kim, Seoul National University, Korea Kenji Maillard, INRIA, France C?sar Mu?oz, Amazon Web Services, USA Lawrence Paulson, Cambridge, UK Pierre-Marie P?drot, INRIA, France Anja Petkovi? Komel, TU Wien, Vienna Cl?ment Pit-Claudel, EPFL, France Christine Rizkallah, University of Melbourne, Australia Cody Roux, AWS, USA Kazuhiko Sakaguchi, University of Tsukuba, Japan Anna Slobodova, Intel, USA Aaron Stump, University of Iowa, US Ren? Thiemann, University of Innsbruck, Austria Amin Timany, Aarhus University, Denmark Josef Urban, CIIRC (Prague), Czech Republic Viktor Vafeiadis, MPI-SWS, Germany Yuting Wang, Shanghai Jiao Tong University, China Tjark Weber, Uppsala University, Sweden ORGANIZERS Dmitriy Traytel, University of Copenhagen, Denmark (conference co-chair) Robbert Krebbers, Radboud University, Netherlands (conference co-chair) Brigitte Peintka, McGill University, Canada (PC co-chair) Steve Zdancewic, University of Pennsylvania, United States (PC co-chair) CONTACT For any questions please contact the two PC chairs: Steve Zdancewic Brigitte Pientka From alastair.donaldson at imperial.ac.uk Fri Jun 17 07:02:46 2022 From: alastair.donaldson at imperial.ac.uk (Donaldson, Alastair F) Date: Fri, 17 Jun 2022 11:02:46 +0000 Subject: [TYPES/announce] Postdoc position on specification and verification of heterogeneous systems at Imperial Message-ID: Hi all John Wickerson and I have an opening for a two year postdoc on specification and verification of heterogeneous systems, and their programming languages. See here for details. I'd be very grateful if you should share this with folks who might be interested. Feel free to contact either me or John if you're interested in applying and would like to chat informally first. Thanks! Ally -------------- next part -------------- An HTML attachment was scrubbed... URL: From clemens.grabmayer at gssi.it Fri Jun 17 09:05:06 2022 From: clemens.grabmayer at gssi.it (Clemens Grabmayer) Date: Fri, 17 Jun 2022 15:05:06 +0200 Subject: [TYPES/announce] TERMGRAPH 2022 Workshop: First Call for Participation Message-ID: ======================================================================== First Call for Participation TERMGRAPH 2022 Twelfth International Workshop on Computing with Terms and Graphs https://urldefense.com/v3/__http://termgraph.org.uk/2022__;!!IBzWLUs!S7Vv9VcxaSe_YePwWfRPGwFH7FrQgYBc4vt7xazILA2_WUdeDL33gbpWclEos0U7b7yO-6vAgIYV4Do9Pknats9eiQxWnhJuLiI5upy6pg$ Technion, Haifa, Israel Monday, 1st August 2022 A Workshop that is part of FLoC 2022 ======================================================================== We invite participation for TERMGRAPH 2022, a satellite workshop of the 8th Federated Logic Conference (FLoC 2022) to be held in Haifa, Israel, from July 31 to August 12, 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. The aim of our 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. Program: -------- We will have two invited talks (by Joerg Endrullis and by Delia Kesner), and 5 presentations about regular contributions. The preliminary schedule is as follows: 09.05 Opening of the workshop 09.15 - 10.15 Delia Kesner (invited talk): A Computational Interpretation of Girard's Intuitionistic Proof Nets 11.00 - 11.30 Tikhon Pshenitsyn: Transformation of DPO Grammars into Hypergraph Lambek Grammars With The Conjunctive Kleene Star 11.30 - 12.00 Vincent van Oostrom: Greedily Decomposing Proof Terms for String Rewriting into Multistep Derivations by Topological Multisorting 12.00 - 12.30 Roy Overbeek and Joerg Endrullis: A PBPO+ Graph Rewriting Tutorial 14.15 - 15.15 J?rg Endrullis (invited talk): PBPO+ Graph Rewriting in Context 16.00 - 16.30 Tim Kr?uter, Harald K?nig, Adrian Rutle, and Yngve Lamo: Formalization and analysis of BPMN using graph grammars 16.30 - 17.00 Stephen Mell, Osbert Bastani, and Steve Zdancewic: Ideograph: A Language for Expressing and Manipulating Structured Data 17.00 - 17.25 room for discussions 17.25 closing of the workshop Any changes if necessary will be announced via the webpage https://urldefense.com/v3/__http://termgraph.org.uk/2022__;!!IBzWLUs!S7Vv9VcxaSe_YePwWfRPGwFH7FrQgYBc4vt7xazILA2_WUdeDL33gbpWclEos0U7b7yO-6vAgIYV4Do9Pknats9eiQxWnhJuLiI5upy6pg$ Registration for FLoC: ---------------------- Via the FLoC webpage: https://urldefense.com/v3/__https://www.floc2022.org/registration__;!!IBzWLUs!S7Vv9VcxaSe_YePwWfRPGwFH7FrQgYBc4vt7xazILA2_WUdeDL33gbpWclEos0U7b7yO-6vAgIYV4Do9Pknats9eiQxWnhJuLiJ04JDG_A$ 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 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 lcaires at fct.unl.pt Sat Jun 18 16:48:01 2022 From: lcaires at fct.unl.pt (Luis Caires) Date: Sat, 18 Jun 2022 21:48:01 +0100 Subject: [TYPES/announce] Tenure-track Assistant Professor Position Open at NOVA University Lisbon (PL \/ SE) In-Reply-To: References: Message-ID: The Software Systems Group at the Department of Informatics, NOVA School of Science and Technology, NOVA University Lisbon is opening a ttenure-track Assistant Professor position in all ares of ?Software and its Engineering? and ?Theory of Computation? (as defined in the ACM Computing Classification System 2012). Software Systems Group at NOVA focus broadly on software and its engineering, in advanced education (BSc, MSc and PhD) and research. Key research themes include finding higher-level ways to specify, model, build and compose heterogeneous systems and data sources, ensuring they are efficient, dependable and trustworthy (to service providers and users), while enabling global accessibility, supporting rapid development, deployment and continuous evolution. We aggregate a broad expertise in programming languages principles, design and implementation, algorithms, and software engineering, allowing us to address a wide scope of research issues. We investigate new foundations, new software development methods, new language concepts, new reasoning and formal verification principles, and develop systems, prototypes and tools. Some of our research is developed in collaboration with other lab groups and external academic and industrial partners. Active research topics include software engineering and language-based approaches to concurrency, security, resource control, green and sustainable computing, modularity, usability, and agility, and their integration in software development environments. We are open to new areas and topics as well. We have a strong international presence in the Programming Languages and Software Engineering communities, delivered highly cited seminal contributions, and position as the national software group with the broader and higher impact in software research (e.g., record at ICSE, POPL, ESOP, ICFP, ECOOP, OOPSLA, VLDB, MODELS, CAiSE, RE, TSE, ASE, JSS, JSQ, Inf&C, TCS, JFP). Lisbon is a very nice place to live in all accounts, and currently a rising star city for everything related to research and innovation, with a thriving academic environment. Detailed info for the call here: https://urldefense.com/v3/__https://www.fct.unl.pt/sites/default/files/documentos/concursos/public_notice_715_2022.pdf__;!!IBzWLUs!Rr_lnp0lrESp7nEwTd1-uW9t5Ie7rbeohPhC1-g0stw1A9O6YDQ_kxyhEsNfx73D8qbSOIOjptlsaGCLTcHo8FyT2j76JW1csg$ Contact Luis Caires (lcaires at fct.unl.pt) for any further information. -- Best regards, Luis Caires Director of NOVA Laboratory for Computer Science and Informatics Departamento de Inform?tica FCT Universidade Nova de Lisboa https://urldefense.com/v3/__http://ctp.di.fct.unl.pt/*lcaires__;fg!!IBzWLUs!Rr_lnp0lrESp7nEwTd1-uW9t5Ie7rbeohPhC1-g0stw1A9O6YDQ_kxyhEsNfx73D8qbSOIOjptlsaGCLTcHo8FyT2j6P6HllHQ$ -------------- next part -------------- An HTML attachment was scrubbed... URL: From kkmicins at syr.edu Sat Jun 18 20:41:11 2022 From: kkmicins at syr.edu (Kristopher K Micinski) Date: Sun, 19 Jun 2022 00:41:11 +0000 Subject: [TYPES/announce] POPL 2023 Call for Papers -- deadline Thursday, July 7th, AoE Message-ID: POPL 2023 Call for Papers (https://urldefense.com/v3/__https://popl23.sigplan.org/__;!!IBzWLUs!VP4EW7X-xDHpvDblx6Bi0qUuzxybxXxCyIRaOjq_sTyywVwUl1PpsaulV1x10OinU-srb0iYcZYLsgzlLKn776V5ydeRsRjg$ ) PACMPL Issue POPL 2023 seeks contributions on all aspects of programming languages and programming systems, both theoretical and practical. Authors of papers published in PACMPL Issue POPL 2023 will be invited to present their work in the POPL conference in January 2023, which is sponsored by ACM SIGPLAN, in cooperation with ACM SIGACT and ACM SIGLOG. # Important Dates Thu 07 Jul 2022: Submission Deadline Tue 06 Sep 2022: Start of Author Response period Fri 09 Sep 2022: End of Author Response period Tue 27 Sep 2022: Notification of Conditional Acceptance Wed 26 Oct 2022: Deadline for submission of revisions Mon 07 Nov 2022: Notification of Final Acceptance Thu 10 Nov 2022: Camera-Ready Deadline Wed 18 - Fri 20 Jan 2023: Conference For the fiftieth POPL and the 50th anniversary of POPL, we will be back where POPL #1 happened: Boston, Massachusetts. Location: Boston Park Plaza, Boston, USA General chair: Andrew Myers Program chair: Amal Ahmed Program Committee members: https://urldefense.com/v3/__https://popl23.sigplan.org/committee/POPL-2023-popl-research-papers-program-committee__;!!IBzWLUs!VP4EW7X-xDHpvDblx6Bi0qUuzxybxXxCyIRaOjq_sTyywVwUl1PpsaulV1x10OinU-srb0iYcZYLsgzlLKn776V5ySzq6Ygc$ Full CFP: https://urldefense.com/v3/__https://popl23.sigplan.org/track/POPL-2023-popl-research-papers*POPL-2023-Call-for-Papers__;Iw!!IBzWLUs!VP4EW7X-xDHpvDblx6Bi0qUuzxybxXxCyIRaOjq_sTyywVwUl1PpsaulV1x10OinU-srb0iYcZYLsgzlLKn776V5ye-F3vTD$ NEW THIS YEAR: POPL 2023 will use a double-blind reviewing process (instead of the lightweight double-blind process used in recent years). This means that identities of authors will not be visible to reviewers until after acceptance decisions have been made. For authors, the main change is that there is no option to upload non-anonymized supplementary material; only anonymized supplementary material may be submitted. # Scope Principles of Programming Languages (POPL) is a forum for the discussion of all aspects of programming languages and programming systems. Both theoretical and experimental papers are welcome, on topics ranging from formal frameworks to experience reports. We seek submissions that make principled, enduring contributions to the theory, design, understanding, implementation, or application of programming languages. # Evaluation Criteria The Review Committee will evaluate the technical contribution of each submission as well as its accessibility to both experts and the general POPL audience. All papers will be judged on significance, originality, relevance, correctness, and clarity. Each paper must explain its scientific contribution in both general and technical terms, identifying what has been accomplished, explaining why it is significant, and comparing it with previous work. Advice on writing technical papers can be found on the SIGPLAN author information page. Deadlines and formatting requirements will be strictly enforced. # Evaluation Process NEW THIS YEAR: POPL 2023 will use a double-blind reviewing process (instead of the lightweight double-blind process used in recent years). This means that identities of authors will not be visible to reviewers until after conditional-acceptance decisions have been made. For authors, the main change is that there is no option to upload non-anonymized supplementary material; only _anonymized_ supplementary material may be submitted. Also new this year: POPL 2023 will have three Associate Chairs who will help the PC Chair monitor reviews, solicit external expert reviews for submissions when there is not enough expertise on the committee, and facilitate reviewer discussions. As in previous years, authors will have a multi-day period to respond to reviews, as indicated in the Important Dates table. Responses are optional. A response must be concise, addressing specific points raised in the reviews; in particular, it must not introduce new technical results. Reviewers will write a short reaction to these author responses. The Review Committee (RC) will discuss papers electronically and, new this year, also during two days of synchronous, face-to-face, virtual Review Committee meetings. There will be no physical RC meeting; this will avoid the time, cost, and environmental impact of transporting an increasingly large committee to one point on the globe. There is no formal External Review Committee, though experts outside the committee will be consulted. Reviews will be accompanied by a short summary of the reasons behind the committee's decision with the goal of clarifying the reasons behind the decision. To conform with ACM requirements for journal publication, all POPL papers will be conditionally accepted; authors will be required to submit a short description of the changes made to the final version of the paper, including how the changes address any requirements imposed by the Review Committee. That the changes are sufficient will be confirmed by the original reviewers prior to acceptance to POPL. Authors of conditionally accepted papers must submit a satisfactory revision to the Review Committee by the requested deadline or risk rejection. # Double-Blind Reviewing POPL 2023 will use double-blind reviewing. This means that author names and affiliations must be omitted from the submission. Additionally, if the submission refers to prior work done by the authors, that reference should be made in third person. These are firm submission requirements. Any supplementary material must also be anonymized. The FAQ on Double-Blind Reviewing(https://urldefense.com/v3/__https://popl23.sigplan.org/track/POPL-2023-popl-research-papers*FAQ-on-Double-Blind-Reviewing__;Iw!!IBzWLUs!VP4EW7X-xDHpvDblx6Bi0qUuzxybxXxCyIRaOjq_sTyywVwUl1PpsaulV1x10OinU-srb0iYcZYLsgzlLKn776V5ySdcaONJ$ ) clarifies the policy for the most common scenarios. But there are many gray areas and trade-offs. If you have any doubts about how to interpret the double-blind rules, please contact the Program Chair. Make sure to contact the Program Chair for complex cases that are not fully covered by the FAQ. # Submission Guidelines The following two points are easy to overlook: - Conflicts: Each author of a submission has to log into the submission system and properly declare all potential conflicts of interest in the author profile form. A conflict caught late in the reviewing process leads to a voided review which may be infeasible to replace. - Anonymity: POPL 2023 will employ a double-blind reviewing process. Make sure that your submitted paper is fully anonymized. Prior to the paper submission deadline, the authors will upload their full anonymized paper. Each paper should have no more than 25 pages of text, excluding bibliography, using the new ACM Proceedings format. # Artifact Evaluation for Accepted Papers Authors of conditionally accepted papers will be invited to formally submit supporting materials to the Artifact Evaluation process. Artifact Evaluation is run by a separate committee whose task is to assess how the artifacts support the work described in the papers. Artifact submission is strongly encouraged but voluntary and will not influence the final decision regarding the papers. Papers that go through the Artifact Evaluation process successfully will receive a seal of approval printed on the papers themselves. Authors of accepted papers are encouraged to make these materials publicly available upon publication of the proceedings, by including them as "source materials" in the ACM Digital Library. # Copyright, Publication, and Presentation As a Gold Open Access journal, PACMPL is committed to making peer-reviewed scientific research free of restrictions on both access and (re-)use. Authors are strongly encouraged to support libre open access by licensing their work with the Creative Commons Attribution 4.0 International (CC BY) license, which grants readers liberal (re-)use rights. Authors of accepted papers will be required to choose one of the following publication rights: - Author licenses the work with a Creative Commons license, retains copyright, and (implicitly) grants ACM non-exclusive permission to publish (suggested choice). - Author retains copyright of the work and grants ACM a non-exclusive permission to publish license. - Author retains copyright of the work and grants ACM an exclusive permission to publish license. - Author transfers copyright of the work to ACM. These choices follow from ACM Copyright Policy and ACM Author Rights, corresponding to ACM's "author pays" option. While PACMPL may ask authors who have funding for open-access fees to voluntarily cover the article processing charge (currently, US$400), payment is not required for publication. PACMPL and SIGPLAN continue to explore the best models for funding open access, focusing on approaches that are sustainable in the long-term while reducing short-term risk. All papers will be archived by the ACM Digital Library. Authors will have the option of including supplementary material with their paper. The official publication date is the date the proceedings are made available in the ACM Digital Library. This date may be up to two weeks prior to the first day of the conference. The official publication date affects the deadline for any patent filings related to published work. Authors of accepted papers are required to give a short talk (roughly 25 minutes long) at the conference, according to the conference schedule. # Distinguished Paper Awards At most 10% of the accepted papers of POPL 2023 will be designated as Distinguished Papers. This award highlights papers that the POPL Review Committee thinks should be read by a broad audience due to their relevance, originality, significance and clarity. The selection of the distinguished papers will be made based on the final version of the paper and through a second review process. From catalin.hritcu at gmail.com Mon Jun 20 04:46:41 2022 From: catalin.hritcu at gmail.com (Catalin Hritcu) Date: Mon, 20 Jun 2022 10:46:41 +0200 Subject: [TYPES/announce] Professor positions at Ruhr University Bochum Message-ID: Dear colleagues, The Faculty of Computer Science at Ruhr University Bochum (Germany) has several open full professor positions , which can also be filled by an assistant/associate professor with tenure track to full professorship. The positions are part of a concerted effort to foster collaborations with the recently established Max Planck Institute for Security and Privacy (MPI-SP) . *Programming Languages* and *Foundations of Computer Science* are two of the explicit interest areas for these positions. The application deadline is 29 July 2022. More details below. Kind regards, Catalin Hritcu Tenured Faculty at MPI-SP and co-opted by the Faculty of Computer Science at Ruhr University Bochum *Professorships in Computer Science* The Faculty of Computer Science at Ruhr University Bochum (Germany) has several tenure-track or tenured openings. The positions are part of a concerted effort to strengthen the existing faculty and to foster collaborations with the recently established Max Planck Institute for Security and Privacy (MPI-SP) . We welcome outstanding applicants from all areas of computer science, including *but not limited to*: ? Foundations of Computer Science ? Programming Languages ? Software Engineering ? Data Science (Data Mining, Machine Learning, Big Data) ? Computer Architecture Appointments will be made for full professorship, or as assistant/associate professorship with tenure track to full professorship. Salaries and working conditions are internationally competitive. The Ruhr-University offers a vibrant environment for computer science research. We offer opportunities for collaboration with MPI-SP and the Cluster of Excellence ?Cyber Security in the Age of Large-Scale Adversaries (CASA)? . There is also ample opportunity to interact with Bochum?s well-developed start-up community, which includes a dedicated incubator. Our working language is English, knowledge of German is not required. Ruhr-University Bochum offers a family-friendly environment. Candidates are expected to show: ? An interest and commitment to building up the computer science faculty, ? the willingness to engage in interdisciplinary scientific work, and ? leadership experience. Candidates are asked to apply with the following documents: curriculum vitae, research and teaching statement, copies of diplomas (in official English or German translation), list of publications, and list of own third-party funding. Applications in PDF format should be sent by July 29, 2022, to the Dean of the Faculty of Computer Science at Ruhr-University Bochum, Alexander May, e-mail: career at casa.rub.de . The official job ad can be found here https://urldefense.com/v3/__https://jobs.ruhr-uni-bochum.de/jobposting/586ac694779bd2eb1182486fc78c712a4ea899480?ref=homepage__;!!IBzWLUs!Q7cb-7bRFbAfmBSphbeqTcuahYY8UeSxCQPCtuUA2bVY5l75_lGr1rYM1ACMcDNHIJwf8YPIfrrb-htO0rVUPZa_Q86-EspTY3AcunQ$ -------------- next part -------------- An HTML attachment was scrubbed... URL: From ralf.kuesters at sec.uni-stuttgart.de Mon Jun 20 05:27:01 2022 From: ralf.kuesters at sec.uni-stuttgart.de (Ralf Kuesters) Date: Mon, 20 Jun 2022 11:27:01 +0200 Subject: [TYPES/announce] IEEE CSF 2022: Call for Participation - Early Bird Registration Ends Today! Message-ID: The 35th IEEE Computer Security Foundations Symposium will be hosted at the Technion in Haifa, Israel as part of the Federated Logic Conference (FLOC 2022) during 7 ? 10 August 2022, with affiliated workshops on August 11 and 12. The program is online https://urldefense.com/v3/__https://www.ieee-security.org/TC/CSF2022/program.html__;!!IBzWLUs!SxmgNpmBernry4w87cjtsBMssjF4aJGH3iSCovGvx7CpGipjjoOlMdaAd_3CWSUD28TFCVRWz2oDPWAaKNUyLkZt_4vE9y4V8fErEO-wL9IWrF8cBA$ Registration is open. Early bird registration ends today! Registration is through FLOC 2022: https://urldefense.com/v3/__https://www.floc2022.org/registration__;!!IBzWLUs!SxmgNpmBernry4w87cjtsBMssjF4aJGH3iSCovGvx7CpGipjjoOlMdaAd_3CWSUD28TFCVRWz2oDPWAaKNUyLkZt_4vE9y4V8fErEO-wL9KRnL30tA$ See the CSF 2022 web site for more information: https://urldefense.com/v3/__https://www.ieee-security.org/TC/CSF2022/index.html__;!!IBzWLUs!SxmgNpmBernry4w87cjtsBMssjF4aJGH3iSCovGvx7CpGipjjoOlMdaAd_3CWSUD28TFCVRWz2oDPWAaKNUyLkZt_4vE9y4V8fErEO-wL9IESqsKkw$ Looking forward to an exciting conference! -- 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!SxmgNpmBernry4w87cjtsBMssjF4aJGH3iSCovGvx7CpGipjjoOlMdaAd_3CWSUD28TFCVRWz2oDPWAaKNUyLkZt_4vE9y4V8fErEO-wL9I8Z2QmrQ$ Phone: +49 (0) 711 685 88283 -------------- next part -------------- _______________________________________________ CSF-attendees mailing list CSF-attendees at mail-infsec.cs.uni-saarland.de https://mail-infsec.cs.uni-saarland.de/mailman/listinfo/csf-attendees Unsubscribe: https://mail-infsec.cs.uni-saarland.de/mailman/options/csf-attendees/ralf.kuesters%40sec.uni-stuttgart.de?password=vuowibpe&unsub=1&unsubconfirm=1 From Neil.JR.Ross at Dal.Ca Mon Jun 20 06:15:34 2022 From: Neil.JR.Ross at Dal.Ca (Julien Ross) Date: Mon, 20 Jun 2022 10:15:34 +0000 Subject: [TYPES/announce] PLanQC 2022: Submission Deadline Extension Message-ID: PLanQC 2022: Programming Languages for Quantum Computing Submission deadline extension (new deadline: June 24 2022 aoe) We invite members of the programming languages and quantum computing communities to submit talk proposals for the 3rd International Workshop on Programming Languages for Quantum Computing (PLanQC 2022), co-located this September with ICFP in Ljubljana, Slovenia. PLanQC aims to bring together researchers from the fields of programming languages and quantum information, exposing the programming languages community to the unique challenges of programming quantum computers. It will promote the development of tools to assist in the process of programming quantum computers, as they exist today and as they are likely to exist in the near to distant future. Submissions to PLanQC should take the form of 2-5 page abstracts (single-column, 11pt acmsmall style, not including references), with links to larger preprints when appropriate. Work in progress is welcome. We hope to make PLanQC maximally accessible to the programming languages community. Thus, abstracts should cover cutting edge ideas and results, but not be opaque to new, potential entrants to quantum computing coming from programing languages. Abstracts will be reviewed for quality and relevance to the workshop, and accepted authors will be invited to give talks or poster presentations. We will not be publishing formal proceedings, but the extended abstracts, along with links (where available) to full papers will be posted to the website of the workshop. Invited speakers: ? Dominique Unruh, University of Tartu ? Charles Yuan, MIT Workshop topics include (but are not limited to): ? High-level quantum programming languages ? Verification tools for quantum programs ? Novel quantum programming abstractions ? Quantum circuit and program optimizations ? Hardware-aware circuit compilation and routing ? Error handling, mitigation, and correction ? Instruction sets for quantum hardware ? Other techniques from traditional programming languages (e.g., types, compilation/optimization, foreign function interfaces) applied to the domain of quantum computation. ------------------------------------------------------------------------- Student support: Limited travel support is available to students wishing to attend PLanQC. Further information and can be found on the workshop website: https://urldefense.com/v3/__https://icfp22.sigplan.org/home/planqc-2022*Travel-Support-for-Students__;Iw!!IBzWLUs!RQQSdcz0gYKEJKTicsTMkFdhRX94169PecAuzqLhaRUo2m_ZTzEViRKBm3yCFEU6JoNC1e1irELPQkaeOGwnZN-l7K3E359Fu-o9$ ------------------------------------------------------------------------- Important dates: ? Submission deadline 24 June 2022 (anywhere on earth) ? Notification 1 August 2022 ? Workshop 15 September 2022 ------------------------------------------------------------------------- Important links: ? Website: https://urldefense.com/v3/__https://icfp22.sigplan.org/home/planqc-2022__;!!IBzWLUs!RQQSdcz0gYKEJKTicsTMkFdhRX94169PecAuzqLhaRUo2m_ZTzEViRKBm3yCFEU6JoNC1e1irELPQkaeOGwnZN-l7K3E30Pj2Axd$ ? Submission: https://urldefense.com/v3/__https://planqc2022.hotcrp.com/__;!!IBzWLUs!RQQSdcz0gYKEJKTicsTMkFdhRX94169PecAuzqLhaRUo2m_ZTzEViRKBm3yCFEU6JoNC1e1irELPQkaeOGwnZN-l7K3E33AYSPZa$ ------------------------------------------------------------------------- Program Committee: Matthew Amy, Simon Fraser University Robert Booth, The University of Edinburgh Olivia Di Matteo, University of British Columbia Yufei Ding, UC Santa Barbara Ross Duncan, Cambridge Quantum Computing Ltd Peng (Frank) Fu, Dalhousie University Kesha Hietala, University of Maryland Kohei Kishida, University of Illinois Urbana-Champaign Aleks Kissinger, University of Oxford Bert Lindenhovius, Tulane University Robert Rand, University of Chicago Mathys Rennela, Inria Neil Julien Ross (chair), Dalhousie University Sam Staton, University of Oxford Mathias Soeken, Microsoft Dominique Unruh, University of Tartu Beno?t Valiron, Universit? Paris-Saclay, CNRS, CentraleSup?lec, LMF Vladimir Zamdzhiev, Inria, LORIA, Universit? de Lorraine Organizing Committee: Matt Amy, Simon Fraser University Ross Duncan, Cambridge Quantum Computing Robert Rand, University of Chicago Neil Julien Ross, Dalhousie University -------------- next part -------------- An HTML attachment was scrubbed... URL: From m.roggenbach at swansea.ac.uk Tue Jun 21 06:34:58 2022 From: m.roggenbach at swansea.ac.uk (Markus Roggenbach) Date: Tue, 21 Jun 2022 10:34:58 +0000 Subject: [TYPES/announce] SEFM Summer School 2022 Message-ID: Dear Friends and Colleagues, Today, I would like to draw your attention to the SEFM Summer School 2022, affiliated with the SEFM Conference 2022 in Berlin, Germany. The school addresses various topics of software engineering of dependable systems, their verification, how to guarantee their security, and how to design autonomous and self-adaptive systems. At the SEFM Summer School, four internationally renowned researchers will present courses that provide an introduction, an overview of current techniques, and perspectives within their areas of specialisation for PhD students in Computer Science, namely: Dirk Beyer (Ludwig-Maximilians-Universit?t M?nchen, Germany): Software Verification Eduard Enoiu (M?lardalen University, Sweden): Security Testing Michael Fisher (University of Manchester, UK): Design and Verification of Reliable Autonomous Systems Danny Weyns (Katholieke Universiteit Leuven, Belgium; and Linnaeus University Sweden): Designing Self-adaptive Systems You can find more details on these courses on the Summer School?s Web Page https://urldefense.com/v3/__https://sefm-summerschool-22.github.io__;!!IBzWLUs!R6XiyEMPxxMrnb1lqF1l8kOjW_TzmE67rRNGbJBfriT6wZ1d7b_foiVuTQtFcjv1MQmJTBwhFKgLZDe3E7NI84ZmPTzvNwf7iDw6Mtljeg$ The Summer School will happen 21.9. - 24.9.2022, the week just before the SEFM main conference. Fees are ?500 per student (including lunches, refreshments, and a Summer School dinner). Please be so kind as to encourage your students to participate, and to distribute this call to possibly interested people. With kind regards, Markus Roggenbach Swansea University, UK -------------- next part -------------- An HTML attachment was scrubbed... URL: From emilio.tuosto at gssi.it Wed Jun 22 07:16:27 2022 From: emilio.tuosto at gssi.it (Emilio Tuosto) Date: Wed, 22 Jun 2022 13:16:27 +0200 Subject: [TYPES/announce] 2 Year postdoc position Message-ID: <85bb4ae8-deef-9c14-b692-76065fd8b887@gssi.it> dear colleagues I'd be most grateful if you could circulate the call for position among your collaborators. The GSSI has an opening for a 2-years postdoctoral research grant (in partnership with the IMT School for Advanced Studies of Lucca) on software quality and related aspects. The successful candidate will develop techniques for formal specification and computer-aided verification of quality-related properties (including safety and performance among others), with applications to complex and critical software systems?. Total annual gross salary: ? 45.000,00 (gross amount before taxes, including taxes owed by the Institution). The call is available at https://urldefense.com/v3/__https://www.gssi.it/albo-ufficiale-online-gssi/item/18391-call-for-postdoctoral-and-technological-research-fellowships-june-2022__;!!IBzWLUs!Q4Ekc-OFqAt8Hf70WRVJFmwiRNobmAitKZwIfmuVymu3Lco7b9ES_GffuyLASjGkRXgNylvhne6Qd3xMXZZhGjhIuOUSoXW2hlXZTQ$ Interested candidates can get in touch with me. Thanks eM -- ************************************************************ Emilio Tuosto Gran Sasso Science Institute Department of Computer Science ORCID: 0000-0002-7032-3281 Viale F. Crispi, 7 - 67100 L'Aquila (Italy) Office: Palazzo Mariani P1-N Phone: +39 0862 428 0312 homepage -> https://urldefense.com/v3/__https://cs.gssi.it/emilio.tuosto/__;!!IBzWLUs!Q4Ekc-OFqAt8Hf70WRVJFmwiRNobmAitKZwIfmuVymu3Lco7b9ES_GffuyLASjGkRXgNylvhne6Qd3xMXZZhGjhIuOUSoXWugHuGBw$ ************************************************************ From kaposi.ambrus at gmail.com Sun Jun 26 17:33:21 2022 From: kaposi.ambrus at gmail.com (Ambrus Kaposi) Date: Sun, 26 Jun 2022 23:33:21 +0200 Subject: [TYPES/announce] Call for STSMs, deadline 1 July 2022 In-Reply-To: References: Message-ID: COST Action CA20111 EuroProofNet Open call for Short-Term Scientific Missions (STSMs) Dear Action members, The next STSM deadline is: 1st July 2022 Notification: 8th July. We are especially looking for applications from WG4 on the construction, management and (re)use of big libraries of formal proofs *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. Find all the details concerning application on https://urldefense.com/v3/__https://europroofnet.github.io/grants__;!!IBzWLUs!ViJvCPyxjbK2LZN42PHoDfSFGct0u-ykr4CAQ-qaAuwP6_DJdJNuZQrpl27w_Nblu4B9yJxiS8rLYs83F-PWVlyo7tXX7RAFI5pT0g$ . Write an email to us if you have any questions.Best wishes, Danijela Simic and Ambrus Kaposi EuroProofNet STSM Coordinators -------------- next part -------------- An HTML attachment was scrubbed... URL: From anuj.dawar at cl.cam.ac.uk Mon Jun 27 09:20:35 2022 From: anuj.dawar at cl.cam.ac.uk (Anuj Dawar) Date: Mon, 27 Jun 2022 14:20:35 +0100 Subject: [TYPES/announce] STACS 2023 - first call for papers Message-ID: STACS 2023 - First call for papers --------------------------- The 40th International Symposium on Theoretical Aspects of Computer Science is planned to take place from 7 March to 10 March 2023 in Hamburg, Germany. For the first time, STACS 2023 will consist of two tracks, A and B, to facilitate the work of the program committee(s). Track A is dedicated to algorithms and data structures, complexity and games. Track B will cover automata, logic, semantics and theory of programming. LISTS OF TOPICS Authors are invited to submit papers presenting original and unpublished research on theoretical aspects of computer science. Typical areas include: Track A: * algorithms and data structures, including: design of parallel, distributed, approximation, parameterized and randomized algorithms; analysis of algorithms and combinatorics of data structures; computational geometry, cryptography, algorithms for machine learning, algorithmic game theory, quantum algorithms * complexity, including: computational and structural complexity theory, parameterized complexity, randomness in computation Track B: * automata and formal languages, including: automata theory, games, algebraic and categorical methods, coding theory, models of computation, computability * logic in computer science, including: finite model theory, database theory, semantics, type systems, program analysis, specification & verification, rewriting and deduction, learning theory, logical aspects of complexity These lists are not exhaustive. In particular, both tracks also welcome submissions about current challenges. PROGRAM COMMITTEE CHAIRS Track A: - Petra Berenbrink (Universit?t Hamburg, Germany) - Mamadou Moustapha Kante (Universit? Clermont Auvergne, France) Track B: - Patricia Bouyer-Decitre (CNRS, France) - Anuj Dawar (University of Cambridge, UK) SUBMISSIONS Submissions will be through EasyChair. Authors are invited to submit an extended abstract or full paper with at most 12 pages (excluding the title page and the references section) to the appropriate track. The title page consists of the title of the paper and the abstract, but *no* author information. The first section of the paper should start on the next page. The PCs reserve the right to reassign a paper to a different track. The usage of pdflatex and the LIPIcs style file (see https://urldefense.com/v3/__http://www.dagstuhl.de/en/publications/lipics__;!!IBzWLUs!RIxJV6fSolJsxrLU6NrfQH3hp3r49w7Na8SWgLqVOpGpLLMFQ1WX8BeyBYRzNYvC9Z_e2VoLINQle9P2LjuTiursI4wgso6TvByJE-Q$ ) are mandatory; no changes to font size, page geometry, etc. are permitted. Submissions not in the correct format or submitted after the deadline will not be considered. The paper should contain a succinct statement of the issues and of their motivation, a summary of the main results, and a brief explanation of their significance, accessible to non-specialist readers. Proofs omitted due to space constraints must be put into an appendix, to be read by the program committee members at their discretion. Simultaneous submission to other conferences with published proceedings or to journals is not allowed. PC members are excluded from submitting. As in the previous two years, STACS 2023 will employ a lightweight double-blind reviewing process: submissions should not reveal the identity of the authors in any way. The purpose of the double-blind reviewing is to help PC members and external reviewers come to an initial judgment about the paper without bias, not to make it impossible for them to discover the authors if they were to try. Nothing should be done in the name of anonymity that weakens the submission or makes the job of reviewing the paper more difficult. In particular, important references should not be omitted or anonymized. In addition, authors should feel free to disseminate their ideas or draft versions of their paper as they normally would. For example, authors may post drafts of their papers on the web, submit them to arXiv, and give talks on their research ideas. There will be a rebuttal period for authors, see below for the dates. Authors will receive the reviews of their submissions (via EasyChair) and have three days to submit rebuttals (via EasyChair). These rebuttals become part of the PC discussions, but entail no specific responses. At least one author of each accepted paper is expected to register at the conference. For authors who cannot present their paper in person a possibility for remote presentation will be offered. PROCEEDINGS Accepted papers will be published in the proceedings of the symposium. As usual, these proceedings will appear in the Leibniz International Proceedings in Informatics (LIPIcs) series, based at Schloss Dagstuhl. This guarantees perennial, free and easy electronic access, while the authors retain the rights over their work. With their submission, authors consent to sign a license authorizing the program committee chairs to organize the electronic publication of their paper, provided the paper is accepted. IMPORTANT DATES * Deadline for submissions: September 25, 2022 (AoE) * Rebuttal: November 14-16, 2022 * Author notification: December 4, 2022 * Final version: January 8, 2023 * STACS 2023: March 7-10, 2023 CONTACT INFORMATION Web: stacs-conf.org Email: petra.berenbrink at uni-hamburg.de From shankar at csl.sri.com Mon Jun 27 12:17:11 2022 From: shankar at csl.sri.com (Natarajan Shankar) Date: Mon, 27 Jun 2022 09:17:11 -0700 Subject: [TYPES/announce] Call for virtual participation in Isaac Newton Institute workshop on Vistas in Verification (July 4 to 8, 2022) Message-ID: <95b06324-bdbf-2962-4ab9-19ee70949f50@csl.sri.com> Hello all, We?d like to publicise the Isaac Newton Institute Workshop `Vistas in Verified Software? in Cambridge UK on **4th July to 8th July**, both live and virtual. The programme has a great line-up of speakers; details at https://urldefense.com/v3/__https://www.newton.ac.uk/event/vs2w01/__;!!IBzWLUs!SGmHcmWEYBcIby5ZoVEreDvfk1stSghDouhYTwmrKwtiLKRyMMs8GRF1ObcX2gW_Mgdw4LV0pu-8Xy_Q-rETvOCgLJrBp_4$ and below. We welcome lively virtual participation in the workshop. ?If you would like to attend **virtually**, please contact Teresa Carbajo Garcia, t.carbajo-garcia at imperial.ac.uk, ?by **12 o?clock UK time** on Thursday 30th June. You will then get the zoom details on Friday from the Isaac Newton Institute. Best wishes, Shankar + co-organizers Speakers: * Andrey Rybalchenko /Microsoft (UK)/ * Andrew Appel /Princeton University/ * David Basin /ETH Zurich/ * Dirk Beyer /Ludwig-Maximilians-Universit?t M?nchen/ * Cristian Cadar /Imperial College London/ * Byron Cook /Amazon; University College London/ * Sergey Bratus, DARPA * Philippa Gardner /Imperial College London/ * Timothy Griffin and Mukesh Tiwari /University of Cambridge; Cambridge Computer Laboratory/ * Thomas Henzinger /IST Austria/ * Bart Jacobs /KU Leuven/ * Neel Krishnaswami /University of Cambridge/ * Daniel Kroening /University of Oxford/ * Viktor Kuncak /EPFL - Ecole Polytechnique F?d?rale de Lausanne; IST Austria/ * Gregory Malecha /Bed Rock Systems/ * Bernhard M?ller /Universit?t Augsburg/ * Peter M?ller /ETH Z?rich/ * Mooly Sagiv /Tel Aviv University/ * /Z/hong Shao,/Yale University/ * Peter Sewell /University of Cambridge/ * Nikhil Swamy /Microsoft (USA)/ * Caterina Urban /INRIA/ * Moshe Vardi /Rice University/ * Philip Wadler /University of Edinburgh/ Organisers: * Azadeh Farzan /University of Toronto/ * Philippa Gardner /Imperial College London/ * Kim Larsen/, Aalborg/ * Xavier Leroy /Coll?ge de France; INRIA/ * Peter O'Hearn, /Facebook/ * Ken McMillan,/UT Austin/ * Leonardo de Moura, MIcrosoft/Research / * Peter Sewell /University of Cambridge/ * Natarajan Shankar /SRI International/ * Moshe Vardi /Rice University/ -------------- next part -------------- An HTML attachment was scrubbed... URL: From cmezzina at gmail.com Wed Jun 29 06:04:31 2022 From: cmezzina at gmail.com (Claudio Mezzina) Date: Wed, 29 Jun 2022 12:04:31 +0200 Subject: [TYPES/announce] RC2022 call for online attendance Message-ID: ============RC2022 call for online attendance============ The 14th Conference on Reversible Computation (RC 2022) will be held in Urbino on 5-6 July https://urldefense.com/v3/__https://reversible-computation-2022.github.io/__;!!IBzWLUs!WBSYsew0G6CwovinwZv97gf3IQBpK0yuxm4Kb-La7y3h8v4wU5RG3RTNOE1zOibgFJ3XKl0zj4e2DGy1YMOU8wD3Bn5V0go$ Invited talks: - Robert O'Callahan (lead developer of rr https://urldefense.com/v3/__https://rr-project.org/__;!!IBzWLUs!WBSYsew0G6CwovinwZv97gf3IQBpK0yuxm4Kb-La7y3h8v4wU5RG3RTNOE1zOibgFJ3XKl0zj4e2DGy1YMOU8wD3s4ug4es$ ): Reverse Execution In The rr Debugger - Vincent van Wingerden (Microsoft Europe): an introduction to Azure Quantum and the Microsoft QDK If you are interested and would like to attend the conference online, then please register (free of charge), at your earliest convenience but not later than Monday 4th July, at this link: https://urldefense.com/v3/__https://tinyurl.com/p2f86yyh__;!!IBzWLUs!WBSYsew0G6CwovinwZv97gf3IQBpK0yuxm4Kb-La7y3h8v4wU5RG3RTNOE1zOibgFJ3XKl0zj4e2DGy1YMOU8wD3Xe54DCQ$ or follow the instruction at https://urldefense.com/v3/__https://reversible-computation-2022.github.io/__;!!IBzWLUs!WBSYsew0G6CwovinwZv97gf3IQBpK0yuxm4Kb-La7y3h8v4wU5RG3RTNOE1zOibgFJ3XKl0zj4e2DGy1YMOU8wD3Bn5V0go$ -------------- next part -------------- An HTML attachment was scrubbed... URL: From elaine.pimentel at gmail.com Wed Jun 29 12:00:51 2022 From: elaine.pimentel at gmail.com (Elaine Pimentel) Date: Wed, 29 Jun 2022 18:00:51 +0200 Subject: [TYPES/announce] CSL 2023 -- Final cfp Message-ID: ======================= CSL 2023 University of Warsaw, Poland February 13-16, 2023 ======================= 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!TsC3X-Wb5kVpCb_MRhvJFyPs5UGHCRW56Nu1YDAksqJwS1PCjzJo2ro8l_4YSnkNbPMA_63Rec5puYCUXlm5MWZZnCk7j8_ufn9SRj3k$ . It is an interdisciplinary conference, spanning across both basic and application oriented research in mathematical logic and computer science. CSL 2023 will be held in the University of Warsaw on February 13-16, 2023 ( https://urldefense.com/v3/__https://csl2023.mimuw.edu.pl/__;!!IBzWLUs!TsC3X-Wb5kVpCb_MRhvJFyPs5UGHCRW56Nu1YDAksqJwS1PCjzJo2ro8l_4YSnkNbPMA_63Rec5puYCUXlm5MWZZnCk7j8_ufpYMvu9C$ ) Submission guidelines ===================== Submitted papers must be in English and must provide sufficient detail to allow the Program Committee to assess the merits of the paper. Full proofs may appear in a clearly marked technical appendix which will be read at the reviewers? discretion. Authors are strongly encouraged to include a well written introduction which is directed at all members of the PC. The papers should be submitted via easychair: https://urldefense.com/v3/__https://easychair.org/conferences/?conf=csl2023__;!!IBzWLUs!TsC3X-Wb5kVpCb_MRhvJFyPs5UGHCRW56Nu1YDAksqJwS1PCjzJo2ro8l_4YSnkNbPMA_63Rec5puYCUXlm5MWZZnCk7j8_ufg6jXzwg$ The CSL 2023 conference proceedings will be published in Leibniz International Proceedings in Informatics (LIPIcs), see https://urldefense.com/v3/__https://submission.dagstuhl.de/documentation/authors__;!!IBzWLUs!TsC3X-Wb5kVpCb_MRhvJFyPs5UGHCRW56Nu1YDAksqJwS1PCjzJo2ro8l_4YSnkNbPMA_63Rec5puYCUXlm5MWZZnCk7j8_ufmNWabR9$ . Authors are invited to submit contributed papers of no more than 15 pages in LIPIcs style (not including references), presenting unpublished work fitting the scope of the conference. Papers may not be submitted concurrently to another conference with refereed proceedings. The PC chairs should be informed of closely related work submitted to a conference or a journal. Papers authored or co-authored by members of the PC are not allowed. At least one of the authors of each accepted paper is expected to attend the conference in person to present their papers. Important dates =============== Abstract submission: July 9, 2022 (AoE) Paper submission: July 16, 2022 (AoE) Notification: September 30, 2022 Conference: February 13-16, 2023 Invited Speakers ================ Claudia Faggian (Universit? de Paris, France) Nina Gierasimczuk (Danish Technical University, Denmark) Dale Miller (Inria Saclay, France) Micha? Pilipczuk (University of Warsaw, Poland) Davide Sangiorgi (University of Bologna, Italy) Helena-Rasiowa-Award ==================== The Helena Rasiowa Award is the best student paper award for the CSL conference series, starting from CSL 2022. The award will be given to the best paper (as decided by the PC) written solely by students or for which students were the main contributors. A student in this context is any person who is currently studying for a degree or whose PhD award date is less than one year prior to the first day of the conference. Read more about the contribution of Helena Rasiowa to logic and computer science, and their interplay, here: https://urldefense.com/v3/__https://www.eacsl.org/helena-rasiowa-award-2/helena-rasiowa-award/__;!!IBzWLUs!TsC3X-Wb5kVpCb_MRhvJFyPs5UGHCRW56Nu1YDAksqJwS1PCjzJo2ro8l_4YSnkNbPMA_63Rec5puYCUXlm5MWZZnCk7j8_ufg0AnVh7$ . List of topics ============== - automated deduction and interactive theorem proving - constructive mathematics and type theory - equational logic and term rewriting - automata and games, game semantics - modal and temporal logic - model checking - decision procedures - logical aspects of computational complexity - finite model theory - computational proof theory - logic programming and constraints - lambda calculus and combinatory logic - domain theory - categorical logic and topological semantics - database theory - specification, extraction and transformation of programs - logical aspects of quantum computing - logical foundations of programming paradigms - verification and program analysis - linear logic - higher-order logic - nonmonotonic reasoning Program Committee ================= Matteo Acclavio (University of Luxembourg, Luxembourg) Patricia Bouyer-Decitre (LSV, CNRS & ENS Paris-Saclay, France) Agata Ciabattoni (TU-Wien, Austria) Diana Costa (University of Lisbon, Portugal) Alejandro D?az-Caro (Universidad Nacional de Quilmes, Argentina) Mart?n Escard? (University of Birmingham, UK) Rajeev Gor? (Vienna University of Technology, Austria, Polish Academy of Science, Poland) Giulio Guerrieri (Huawei Edinburgh Research Centre, UK) Shin-ya Katsumata (National Institute of Informatics, Japan) Delia Kesner (Universit? de Paris, France) Sandra Kiefer (RWTH Aachen University, Germany) Bartek Klin (University of Oxford, UK, co-chair) Naoki Kobayashi (The University of Tokyo, Japan) Stepan Kuznetsov (HSE University, Russia) Martin L?ck (Leibniz Universit?t Hannover, Germany) Meena Mahajan (The Institute of Mathematical Sciences, India) Filip Murlak (University of Warsaw, Poland) Daniele Nantes (University of Bras?lia, Brazil) Elaine Pimentel (UCL, UK, co-chair) Paolo Pistone (University of Bologna, Italy) Ana Sokolova (University of Salzburg, Austria) Lutz Stra?burger (Inria Saclay ? ?le-de-France, France) Pascal Schweitzer (TU Darmstadt, Germany) Martin Zimmermann (Aalborg University, Denmark) Yoni Zohar (Bar Ilan University, Israel) Organizing Committee ==================== Lorenzo Clemente, Wojciech Czerwi?ski, Rados?aw Pi?rkowski (University of Warsaw) Contact ======== Please send all questions about submissions to the PC co-chairs: csl2023 at easychair.org -------------- next part -------------- An HTML attachment was scrubbed... URL: From elenatalita at gmail.com Fri Jul 1 12:25:43 2022 From: elenatalita at gmail.com (Elena Di Lavore) Date: Fri, 1 Jul 2022 19:25:43 +0300 Subject: [TYPES/announce] SYCO 9 - Call for submissions - Deadline 1 August Message-ID: ----------------------------------------- CALL FOR SUBMISSIONS NINTH SYMPOSIUM ON COMPOSITIONAL STRUCTURES (SYCO 9) Como, Italy 8-9 September 2022 Submission deadline: Monday 1 August 2022 https://urldefense.com/v3/__https://www.cl.cam.ac.uk/events/syco/9/__;!!IBzWLUs!XhUP11v6Rr19OtAYfkMOhHGebykn7oHgJYXtvFUIGgGaqpRHNswr8iuOSJ9Zg4BxvNVO2blqpcg4smsPlG0NU5hzyFnD42j8NAY$ ----------------------------------------- The Symposium on Compositional Structures (SYCO) is an interdisciplinary series of meetings aiming to support the growing community of researchers interested in the phenomenon of compositionality, from both applied and abstract perspectives, and in particular where category theory serves as a unifying common language. Previous SYCO events have been held in Birmingham, Strathclyde, Oxford, Chapman, Leicester and Tallinn. We welcome submissions from researchers across computer science, mathematics, physics, philosophy, and beyond, with the aim of fostering friendly discussion, disseminating new ideas, and spreading knowledge between fields. Submission is encouraged for both mature research and work in progress, and by both established academics and junior researchers, including students. Submissions is easy, with no formatting or page restrictions. The meeting does not have proceedings, so work can be submitted even if it has been submitted or published elsewhere. You could submit work-in-progress, or a recently completed paper, or even a PhD or Masters thesis. While no list of topics could be exhaustive, SYCO welcomes submissions with a compositional focus related to any of the following areas, in particular from the perspective of category theory: - logical methods in computer science, including classical and quantum programming, type theory, concurrency, natural language processing and machine learning; - graphical calculi, including string diagrams, Petri nets and reaction networks; - languages and frameworks, including process algebras, proof nets, type theory and game semantics; - abstract algebra and pure category theory, including monoidal category theory, higher category theory, operads, polygraphs, and relationships to homotopy theory; - quantum algebra, including quantum computation and representation theory; - tools and techniques, including rewriting, formal proofs and proof assistants, and game theory; - industrial applications, including case studies and real-world problem descriptions. ** IMPORTANT DATES ** All deadlines are 23:59 Anywhere on Earth. Submission deadline: Monday 1 August Author notification: Monday 8 August 2022 Symposium dates: Thursday 8 and Friday 9 September 2022 ** SUBMISSION INSTRUCTIONS ** Submissions are by EasyChair, via the SYCO 9 submission page: https://urldefense.com/v3/__https://easychair.org/my/conference?conf=syco9__;!!IBzWLUs!XhUP11v6Rr19OtAYfkMOhHGebykn7oHgJYXtvFUIGgGaqpRHNswr8iuOSJ9Zg4BxvNVO2blqpcg4smsPlG0NU5hzyFnDDed8Cbs$ Submission is easy, with no format requirements or page restrictions. The meeting does not have proceedings, so work can be submitted even if it has been submitted or published elsewhere. Think creatively: you could submit a recent paper, or notes on work in progress, or even a recent Masters or PhD thesis. In the event that more good-quality submissions are received than can be accommodated in the timetable, the programme committee may choose to *defer* some submissions to a future meeting, rather than reject them. Deferred submissions can be re-submitted to any future SYCO meeting, where they will not need peer review, and where they will be prioritised for inclusion in the programme. Meetings will be held sufficiently frequently to avoid a backlog of deferred papers. If you have a submission which was deferred from a previous SYCO meeting, it will not automatically be considered for SYCO 9; you still need to submit it again through EasyChair. When submitting, append the words "DEFERRED FROM SYCO X" to the title of your paper, replacing "X" with the appropriate meeting number. There is no need to attach any documents. ** PROGRAMME COMMITTEE ** The PC chair is John van de Wetering, Radboud University. The Programme Committee will be announced soon. ** STEERING COMMITTEE ** Ross Duncan, University of Strathclyde Chris Heunen, University of Edinburgh Dominic Horsman, University of Oxford Aleks Kissinger, University of Oxford Samuel Mimram, ?cole Polytechnique Simona Paoli, University of Aberdeen Mehrnoosh Sadrzadeh, University College London Pawel Sobocinski, Tallinn University of Technology Jamie Vicary, University of Cambridge -------------- next part -------------- An HTML attachment was scrubbed... URL: From radu.iosif at univ-grenoble-alpes.fr Fri Jul 1 13:09:00 2022 From: radu.iosif at univ-grenoble-alpes.fr (RADU IOSIF) Date: Fri, 1 Jul 2022 19:09:00 +0200 (CEST) Subject: [TYPES/announce] Advancing Separation Logic 2022, July 31, Haifa, Israel -- Call for Participation Message-ID: <672217163.936191.1656695340435.JavaMail.zimbra@univ-grenoble-alpes.fr> Workshop on Advances in Separation Logics (ASL 2022), Haifa, Israel, July 31st 2022 Homepage: https://urldefense.com/v3/__https://asl-workshop.github.io/asl22/__;!!IBzWLUs!Sqqhg-MpymJXTlbQS8YfB3jsHESkjw5AH7N9hBNFFhIMS0JvtVxWwk5lQp36BmOdSw-naSAgDuoPW9FcYWA3X0QUPxubcnK25QvR8PjdGeIgd44$ Program: https://urldefense.com/v3/__https://easychair.org/smart-program/FLoC2022/ASL-index.html__;!!IBzWLUs!Sqqhg-MpymJXTlbQS8YfB3jsHESkjw5AH7N9hBNFFhIMS0JvtVxWwk5lQp36BmOdSw-naSAgDuoPW9FcYWA3X0QUPxubcnK25QvR8Pjd4f8xrdU$ Keynote Speakers * Philippa Gardner, Imperial College London * Ralf Jung, MIT CSAIL ASL 2022 is a workshop affiliated to IJCAR 2022 at FLOC 2022. In-person registration is done via the FLOC 2022 registration link: https://urldefense.com/v3/__https://www.floc2022.org/registration__;!!IBzWLUs!Sqqhg-MpymJXTlbQS8YfB3jsHESkjw5AH7N9hBNFFhIMS0JvtVxWwk5lQp36BmOdSw-naSAgDuoPW9FcYWA3X0QUPxubcnK25QvR8Pjd9Vr7GuA$ Virtual participation is free of charge but requires registration via the following link: https://urldefense.com/v3/__https://asl2022.rsvpify.com/__;!!IBzWLUs!Sqqhg-MpymJXTlbQS8YfB3jsHESkjw5AH7N9hBNFFhIMS0JvtVxWwk5lQp36BmOdSw-naSAgDuoPW9FcYWA3X0QUPxubcnK25QvR8PjdDP4ag-I$ 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 cmezzina at gmail.com Sat Jul 2 12:04:39 2022 From: cmezzina at gmail.com (Claudio Mezzina) Date: Sat, 2 Jul 2022 18:04:39 +0200 Subject: [TYPES/announce] EXPRESS/SOS 2022 final call for Papers Message-ID: =========================================== FINAL 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!UOQGGfPPx-HAD3SpoWyAQL3N5bqcIlZZqVBQTwyRRkRvKQYLAqRNfJjhxPcKdBdW5U9YvAy-pywtAnY8KhX5RcrfghOulNU$ 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!UOQGGfPPx-HAD3SpoWyAQL3N5bqcIlZZqVBQTwyRRkRvKQYLAqRNfJjhxPcKdBdW5U9YvAy-pywtAnY8KhX5RcrfgsN-YxU$ ). 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!UOQGGfPPx-HAD3SpoWyAQL3N5bqcIlZZqVBQTwyRRkRvKQYLAqRNfJjhxPcKdBdW5U9YvAy-pywtAnY8KhX5RcrfPQehbSY$ 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 8, 2022 (extended) - 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 bahareh1812 at gmail.com Mon Jul 4 05:46:41 2022 From: bahareh1812 at gmail.com (Bahareh Afshari) Date: Mon, 4 Jul 2022 11:46:41 +0200 Subject: [TYPES/announce] Autumn School & Workshop on Proof Theory, Utrecht (The Netherlands), 7-12 Nov 2022 Message-ID: 4th International Autumn School on Proof Theory Utrecht, November 7-10, 2022 https://urldefense.com/v3/__http://www.proofsociety.org/autumn-school-2022/__;!!IBzWLUs!Q2h98e-2TIEUou1OoViD5LTvQcfsMQAoqjt2t34z-9KDWCfWjWwS77xJeqSpGWrLQhbf26GajZ2-CQVw9IJf1Fg45JuhF-McV0U$ Workshop on Proof Theory Utrecht, November 11-12, 2022 https://urldefense.com/v3/__http://www.proofsociety.org/workshop-2022/__;!!IBzWLUs!Q2h98e-2TIEUou1OoViD5LTvQcfsMQAoqjt2t34z-9KDWCfWjWwS77xJeqSpGWrLQhbf26GajZ2-CQVw9IJf1Fg45JuhIqwwwK0$ The 4th International Autumn School on Proof Theory in Utrecht is arranged under the auspices of The Proof Society and organised by the universities of Amsterdam and Utrecht. The Proof Society has recently been formed to support the notion of proof in its broadest sense, through a series of suitable activities; to be therefore inclusive in reaching out to all scientific areas which consider proof as an object in their studies; to enable the community to shape its future by identifying, formulating and communicating its most important goals; to actively promote proof to increase its visibility and representation. The aim of the Autumn school is to cover basic and advanced topics in proof theory. The focus of the fourth edition will be computational content of proofs, sequent calculi, proof complexity, proof theory of set theory, and philosophical aspects of proof. Other areas will be represented through research talks at the following workshop. The intended audience is advanced master students, PhD students, postdocs and experienced researchers in mathematics, computer science and philosophy. The Autumn school is co-located with a workshop on proof theory in Utrecht (11-12 November). We invite proposals for contributed talks at the workshop. These can be on published or unpublished work, as well as work in progress. The best talk presented by a student will receive an award from The Proof Society. IMPORTANT DATES ========================== 7 August: Deadline for ASL student awards 5 September: Deadline for submission of contributed workshop talks 7 September: Registration opens 15 September: Notification of acceptance of contributed talks 14 October: Early registration deadline 7-10 November: Autumn School 11-12 November: Workshop Scientific Programme ========================== The Autumn school will provide five courses: - Computational Content of Proofs by Ulrich Berger (Swansea University) - Proof-theoretic Semantics by Bogdan Dicher (University of Lisbon) - Labelled Sequent Calculi by Marianna Girlando (University of Amsterdam) - Proof Complexity by Raheleh Jalali (Utrecht University) - Proof Theory of Set Theory by Michael Rathjen (University of Leeds) Workshop Speakers ========================== - Benno van den Berg (University of Amsterdam) - Marta B?lkov? (Czech Academy of Sciences) - Sebastian Enqvist (Stockholm University) - Stefan Hetzl (TU Wien) - Hajime Ishihara (Japan Advanced Institute of Science and Technology) - Gerhard J?ger (University of Bern) Registration ========================== Standard: 300 (includes conference dinner) PhD students: 200 (includes conference dinner) Other students: 80 More information about registration will be available from the website soon. ASL Student travel award ========================== Student ASL members may apply for (limited) ASL travel to attend 2022 TPS events by submitting an application three months prior to the meeting. To apply, please visit the link below and follow the instructions https://urldefense.com/v3/__https://aslonline.org/student-travel-awards/__;!!IBzWLUs!Q2h98e-2TIEUou1OoViD5LTvQcfsMQAoqjt2t34z-9KDWCfWjWwS77xJeqSpGWrLQhbf26GajZ2-CQVw9IJf1Fg45Juhh1PwxGQ$ Programme Committee ========================== Bahareh Afshari, University of Amsterdam & University of Gothenburg (chair) Matthias Baaz, TU Wien Arnold Beckmann, Swansea University Lev Beklemishev, Steklov Mathematical Institute Balthasar Grabmayr, University of Haifa Rosalie Iemhoff, Utrecht University Joost Joosten, University of Barcelona Antonina Kolokolova, Memorial University of Newfoundland Norbert Preining, Mercari Inc. Andreas Weiermann, University of Ghent Local organising committee ========================== Bahareh Afshari, University of Amsterdam (co-chair) Raheleh Jalali, Utrecht University Rosalie Iemhoff, Utrecht University (co-chair) Robin Martinot, Utrecht University Robert Passman, University of Amsterdam Sponsors ========================== Association for Symbolic Logic Department of Philosophy, Utrecht University Institute for Logic, Language and Computation, University of Amsterdam Kurt G?del Society -------------- next part -------------- An HTML attachment was scrubbed... URL: From alcsc at dtu.dk Mon Jul 4 03:52:15 2022 From: alcsc at dtu.dk (Alceste Scalas) Date: Mon, 4 Jul 2022 09:52:15 +0200 Subject: [TYPES/announce] PhD scholarship: Hybrid Verification of Distributed Applications Message-ID: <028c7058-c38e-13e5-2681-7733a93147dd@dtu.dk> 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 hybrid (static+runtime) verification of concurrent and distributed applications (details below). * Application deadline: 31 August 2022 * Expected starting date: 1 October 2022 (negotiable) * For inquiries, please contact: Alceste Scalas - https://urldefense.com/v3/__https://people.compute.dtu.dk/alcsc__;!!IBzWLUs!TBOgx2ZnTQdYPSkzoXlgSqflHNRwSNBxJDo2It00HoswmVqAaBLG3j752MgY8OV2o8SZvuO0LKrgZDIQE7CKwOKWaGBu$ * Application link with complete details: https://urldefense.com/v3/__https://www.dtu.dk/english/about/job-and-career/vacant-positions/job?id=87335293-12a4-4547-9a94-35607ce111fe__;!!IBzWLUs!TBOgx2ZnTQdYPSkzoXlgSqflHNRwSNBxJDo2It00HoswmVqAaBLG3j752MgY8OV2o8SZvuO0LKrgZDIQE7CKwL1yxuAz$ The project is funded by DFF.dk, and is in collaboration with Motorola Solutions Danmark A/S, the University of Malta, and Imperial College London. It is an excellent opportunity to be involved in advanced research on concurrent and distributed systems, with important practical applications. *PROJECT DESCRIPTION* The project goal is to develop new methods and tools to verify the correctness of distributed applications, by combining static verification (e.g. type-checking) and runtime verification (monitoring). We will tackle scenarios where heterogeneous software components are expected to interact correctly but cannot be fully verified before deployment: this is a common scenario in microservices, IoT, and edge computing. The main research questions are: how can we model these heterogeneous systems? How can we combine static and runtime verification, and what guarantees can we achieve? Can we implement these research results as prototype tools to aid software development? *RESPONSIBILITIES AND QUALIFICATIONS* If you join this project, you will become a member of the DTU Compute research section on Software Systems Engineering. 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 academic collaborators? universities. Links: * https://urldefense.com/v3/__https://www.compute.dtu.dk/english/research/research-sections/software-systems-engineering__;!!IBzWLUs!TBOgx2ZnTQdYPSkzoXlgSqflHNRwSNBxJDo2It00HoswmVqAaBLG3j752MgY8OV2o8SZvuO0LKrgZDIQE7CKwMPDb7lJ$ * https://urldefense.com/v3/__https://www.compute.dtu.dk/english/phd__;!!IBzWLUs!TBOgx2ZnTQdYPSkzoXlgSqflHNRwSNBxJDo2It00HoswmVqAaBLG3j752MgY8OV2o8SZvuO0LKrgZDIQE7CKwAiyeTiD$ Your main tasks within this project will be: * become familiar with state-of-the-art research in formal methods for concurrent and distributed systems, including verification via type- checking (behavioural types) and monitoring; * study relevant industrial use cases and scenarios; * explore new methods to ensure the correctness of distributed systems. 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) and/or for distributed systems (e.g. process calculi, model checking). 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 good programming skills (preferably including functional programming). To begin the PhD position, 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 can apply prior to obtaining the degree, providing the expected graduation date. *ASSESSMENT AND FURTHER DETAILS* The assessment of the applicants will take place in early September 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!TBOgx2ZnTQdYPSkzoXlgSqflHNRwSNBxJDo2It00HoswmVqAaBLG3j752MgY8OV2o8SZvuO0LKrgZDIQE7CKwHrikyl0$ 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!TBOgx2ZnTQdYPSkzoXlgSqflHNRwSNBxJDo2It00HoswmVqAaBLG3j752MgY8OV2o8SZvuO0LKrgZDIQE7CKwKaxflTO$ 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!TBOgx2ZnTQdYPSkzoXlgSqflHNRwSNBxJDo2It00HoswmVqAaBLG3j752MgY8OV2o8SZvuO0LKrgZDIQE7CKwMPDb7lJ$ 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!TBOgx2ZnTQdYPSkzoXlgSqflHNRwSNBxJDo2It00HoswmVqAaBLG3j752MgY8OV2o8SZvuO0LKrgZDIQE7CKwPjc_R5r$ -- Alceste Scalas - https://urldefense.com/v3/__https://people.compute.dtu.dk/alcsc__;!!IBzWLUs!TBOgx2ZnTQdYPSkzoXlgSqflHNRwSNBxJDo2It00HoswmVqAaBLG3j752MgY8OV2o8SZvuO0LKrgZDIQE7CKwOKWaGBu$ Associate Professor @ DTU Compute - Section for Software Systems Engineering Technical University of Denmark Building 321, Room 010 2800 Kgs. Lyngby From jan.bessai at tu-dortmund.de Mon Jul 4 08:41:44 2022 From: jan.bessai at tu-dortmund.de (Jan Bessai) Date: Mon, 4 Jul 2022 14:41:44 +0200 Subject: [TYPES/announce] Call for Papers: Unsound - Sources of Unsoundness in Verification Message-ID: <20220704124144.4v2r4c5gur2k7fnp@shmt> ================================================================== First Call for Papers Unsound: 1st Workshop on Sources of Unsoundness in Verification at SPLASH 2022 https://urldefense.com/v3/__https://2022.splashcon.org/home/unsound-2022__;!!IBzWLUs!RSU2B-G6Tz2AaU1APXSM_OoCc_NORbroCSRpslw_qYJG8C4H9czPJJ0KGxxRNo37T-CumeLSwHPU8sVemMLW_FZ_DMbNUZUSDp_GTIXK$ Software and proof verification has grown significantly in the last 15 years. Growth has come to the point where verification systems are complex and manually proving the soundness of those verification systems sometimes exceeds what a single research group can understand and verify as correct. Even formally defining soundness can be challenging and its definition is varying from system to system. Specific research groups can have very specific notions of soundness they focus on, but those can diverge from what the users expect, especially if the users come from a different verification environment or they are approaching verification for the first time. Participants to Unsound will be able to share their experience and exploits on how different verification tools can either be broken or expose confusing behavior, likely to be unexpected by users. We think this would be greatly beneficial not only because it will help all of us to iron out those unsoundnesses but also because it will facilitate understanding of the foundational differences between the assumptions of the various research lines. The current academic environment encourages us to talk about the success case of our work. In this workshop we want to address and learn from failure cases and we want to reinforce the bedrock of our understanding. In practice, when we divert our focus to a specific aspect of verification we may (understandably) be less precise. For example, a line of research focusing on aliasing control in OO may be less precise when considering the implication in other areas, like termination. We believe that learning from the issues of many verification projects can broaden the attention of researchers to topics which so far escaped their focused area of research; e.g., from only type correctness to also avoiding stack overflows. We believe that this environment would be particularly beneficial for young researchers that are in search of open questions in verification. This may provide a motivation to deep dive into the details of any particular tool, or to expand their individual area of expertise to get a wider and more objective and critical view of the whole area of verification. We also wonder if in our fast expansion we accidentally glossed over some fundamental issue in verification, and if our mistake has now become engraved into the established wisdom and it is sometimes uncritically assumed as a valid reasoning stepping stone. We are particularly interested in sources of unsoundness that are accidentally shared by many different unrelated research lines, and to develop an understanding on why this is the case. The workshop would be its first instance and is meant to be welcoming for both people with strong theoretical skills, as well as people who just like hacking things. We do not expect fully polished submissions and we will not have formal proceedings. Students are especially welcome to attend. ### Examples for possible contributions would be: * Definition of sound and unsound and how they can diverge between tools. * Divergences between user assumptions and actual definitions of soundness. * Common sources of unsoundness and why they emerge. * Bugs and unsoundnesses in the process of extracting a concrete program from a verified environment, e.g., from Coq to Haskell. * Logic errors in the specification of a verification tool, e.g., universe inconsistencies. * Bugs in the implementation of proof checkers. * Overconfident generalizations of sound subsystems to larger settings, e.g., imperative techniques in OO settings. * Disproving soundness statements in published papers about verification. * Finding statements proven in published literature that should no longer be trusted because they relied on a broken verification system. * Simply proving False in a verification tool, in particular we are interested in practical ways to trick available tools to accept wrong statements. * Breaking reasoning about programs with types by breaking the type system of the programming language in new and interesting ways. * Bad interactions between axiomatic choices in libraries used in proofs. * Impacts of the false sense of security when the chain of trust is broken by subtle unsoundness in verification tools. ### Contributions: Deadline: 2022-09-01 (23:59 AOE) Submissions should have 3 pages of text. Additional material (bibliography, related work, and code examples) will not count toward this limit. We strongly encourage authors to include instructions to reproduce results or exploits. There will be a friendly peer review process, focusing on checking that the submitted material is appropriate for the workshop. #### Publication Informal proceedings will be made publicly available on the workshop web page. However, presentation at Unsound does not count as prior publication, and can later be published at a conference of the authors' choosing. ### Instruction to Authors #### Submission Authors should be aware of ACM?s policies on plagiarism (https://urldefense.com/v3/__https://www.acm.org/publications/policies/plagiarism__;!!IBzWLUs!RSU2B-G6Tz2AaU1APXSM_OoCc_NORbroCSRpslw_qYJG8C4H9czPJJ0KGxxRNo37T-CumeLSwHPU8sVemMLW_FZ_DMbNUZUSDotTUeHe$ ). Program Committee members are allowed to submit papers. Papers must be submitted online at: https://urldefense.com/v3/__https://unsound2022.hotcrp.com/__;!!IBzWLUs!RSU2B-G6Tz2AaU1APXSM_OoCc_NORbroCSRpslw_qYJG8C4H9czPJJ0KGxxRNo37T-CumeLSwHPU8sVemMLW_FZ_DMbNUZUSDoXM-n2R$ #### Formatting: Submitted papers should be in portable document format (PDF), formatted using the ACM SIGPLAN style guidelines. Authors should use the acmart format, with the acmsmall sub-format for ACM proceedings. For details, see: https://urldefense.com/v3/__http://www.sigplan.org/Resources/Author/*acmart-format__;Iw!!IBzWLUs!RSU2B-G6Tz2AaU1APXSM_OoCc_NORbroCSRpslw_qYJG8C4H9czPJJ0KGxxRNo37T-CumeLSwHPU8sVemMLW_FZ_DMbNUZUSDuvdC2JB$ It is recommended to use the review option when submitting a paper; this option enables line numbers for easy reference in reviews. ----- End forwarded message ----- From chisvasileandrei at gmail.com Tue Jul 5 04:13:44 2022 From: chisvasileandrei at gmail.com (Andrei Chis) Date: Tue, 5 Jul 2022 10:13:44 +0200 Subject: [TYPES/announce] Call for Papers: 15th ACM SIGPLAN International Conference on Software Language Engineering (SLE 2022) Message-ID: ------------------------------------------------------------------------ 15th ACM SIGPLAN International Conference on Software Language Engineering (SLE 2022) December 5-10, 2022 Auckland, New Zealand https://urldefense.com/v3/__https://conf.researchr.org/home/sle-2022__;!!IBzWLUs!S3VMbrx1lMZpuzMfVPUtwIFO3OEXgAdN8Zy4SlsVFys-unbBRKdqSeCiZNh7fM-D5MdPD_bASQ0mJ4f7--QHAcTBeCv6F9X8LQbst3b_$ https://urldefense.com/v3/__http://www.sleconf.org/2022__;!!IBzWLUs!S3VMbrx1lMZpuzMfVPUtwIFO3OEXgAdN8Zy4SlsVFys-unbBRKdqSeCiZNh7fM-D5MdPD_bASQ0mJ4f7--QHAcTBeCv6F9X8LW471uhB$ Follow us on twitter: https://urldefense.com/v3/__https://twitter.com/sleconf__;!!IBzWLUs!S3VMbrx1lMZpuzMfVPUtwIFO3OEXgAdN8Zy4SlsVFys-unbBRKdqSeCiZNh7fM-D5MdPD_bASQ0mJ4f7--QHAcTBeCv6F9X8LWYSRUSb$ ------------------------------------------------------------------------ We are pleased to invite you to submit papers to the 15th ACM SIGPLAN International Conference on Software Language Engineering (SLE 2022), held in conjunction with SPLASH, GPCE and SAS 2022. Based on the future developments the conference will be hosted in Auckland, New Zealand on December 5-10, 2022. --------------------------- Topics of Interest --------------------------- SLE covers software language engineering rather than engineering a specific software language. Topics of interest include, but are not limited to: - Software Language Design and Implementation - Approaches to and methods for language design - Static semantics (e.g. design rules, well-formedness constraints) - Techniques for specifying behavioral / executable semantics - Generative approaches (incl. code synthesis, compilation) - Meta-languages, meta-tools, language workbenches - Software Language Validation - Verification and formal methods for languages - Testing techniques for languages - Simulation techniques for languages - Software Language Integration and Composition - Coordination of heterogeneous languages and tools - Mappings between languages (incl. transformation languages) - Traceability between languages - Deployment of languages to different platforms - Software Language Maintenance - Software language reuse - Language evolution - Language families and variability, language and software product lines - Domain-specific approaches for any aspects of SLE (design, implementation, validation, maintenance) - Empirical evaluation and experience reports of language engineering tools - User studies evaluating usability - Performance benchmarks - Industrial applications - "Synergies between Language Engineering and emerging/promising research areas" - AI and ML language engineering (e.g., ML compiler testing, code classification) Quantum language engineering (e.g., language design for quantum machines) - Language engineering for physical systems (e.g., CPS, IoT, digital twins) - Socio-technical systems and language engineering (e.g., language evolution to adapt to social requirements) - Etc. --------------------------- Types of Submissions --------------------------- SLE accepts the following types of papers: - **Research papers**: These are "traditional" papers detailing research contributions to SLE. Papers may range from 6 to 12 pages in length, and may optionally include 2 further pages of bibliography/appendices. Papers will be reviewed with an understanding that some results do not need 12 full pages and may be fully described in fewer pages. - **New ideas / vision papers**: These are papers that may describe new, unconventional software language engineering research positions or approaches that depart from standard practice. They can describe well-defined research ideas that are at an early stage of investigation. They could also provide new evidence to challenge common wisdom, present new unifying theories about existing SLE research that provides novel insight or that can lead to the development of new technologies or approaches, or apply SLE technology to radically new application areas. New ideas / vision papers must not exceed 5 pages, and may optionally include 1 further page of bibliography / appendices. - **SLE Body of Knowledge**: The SLE Body of Knowledge (SLEBoK) is a community-wide effort to provide a unique and comprehensive description of the concepts, best practices, tools and methods developed by the SLE community. To this respect, the SLE conference will accept surveys, essays, open challenges, empirical observations and case study papers on the SLE topics. These can focus on but they are not limited to methods, techniques, best practices and teaching approaches. Papers in this category can have up to 20 pages, including bibliography/appendices. - **Tool papers**: These are papers which focus on the tooling aspects which are often forgotten or neglected in research papers. A good tool paper focuses on practical insights that are likely to be useful to other implementers or users in the future. Any of the SLE topics of interest are appropriate areas for tool demonstrations. Submissions must not exceed 5 pages and may optionally include 1 further page of bibliography / appendices. They may optionally come with an appendix with a demo outline / screenshots and/or a short video/screencast illustrating the tool. **Workshops**: Workshops will be organized by SPLASH. Please inform us and contact the SPLASH organizers if you would like to organize a workshop of interest to the SLE audience. Information on how to submit workshops can be found at the SPLASH 2022 Website. --------------------------- Important Dates --------------------------- All dates are Anywhere on Earth. * Abstract submissions: August 8, 2022 * Paper submissions: August 12, 2022 * Review notification: September 18, 2022 (starting of the rebuttal) * Author response period: September 28, 2022 (end of the rebuttal) * Notification: September 30, 2022 * Artifact submissions: October 11, 2022 * Camera-ready (for both rounds): October 15, 2022 * Artifact kick-the-tires Author response: October 24, 2022 * Artifact notification: November 11, 2022 * Conference: December 5-10, 2022 --------------------------- Format --------------------------- Submissions have to use the ACM SIGPLAN Conference Format "acmart"(https://urldefense.com/v3/__http://sigplan.org/Resources/Author/*acmart-format__;Iw!!IBzWLUs!S3VMbrx1lMZpuzMfVPUtwIFO3OEXgAdN8Zy4SlsVFys-unbBRKdqSeCiZNh7fM-D5MdPD_bASQ0mJ4f7--QHAcTBeCv6F9X8Lc2zXuwk$ ); please make sure that you always use the latest ACM SIGPLAN acmart LaTeX template(https://urldefense.com/v3/__https://www.acm.org/binaries/content/assets/publications/consolidated-tex-template/acmart-master.zip__;!!IBzWLUs!S3VMbrx1lMZpuzMfVPUtwIFO3OEXgAdN8Zy4SlsVFys-unbBRKdqSeCiZNh7fM-D5MdPD_bASQ0mJ4f7--QHAcTBeCv6F9X8LZWepIkB$ ), and that the document class definition is `\documentclass[sigplan,anonymous,review]{acmart}`. Do not make any changes to this format! Ensure that your submission is legible when printed on a black and white printer. In particular, please check that colors remain distinct and font sizes in figures and tables are legible. To increase fairness in reviewing, a double-blind review process has become standard across SIGPLAN conferences. In this line, SLE will follow the double-blind process. Author names and institutions should be omitted from submitted papers, and references to the authors? own related work should be in the third person. No other changes are necessary, and authors will not be penalized if reviewers are able to infer their identities in implicit ways. All submissions must be in PDF format. The submission website is: https://urldefense.com/v3/__https://sle22.hotcrp.com__;!!IBzWLUs!S3VMbrx1lMZpuzMfVPUtwIFO3OEXgAdN8Zy4SlsVFys-unbBRKdqSeCiZNh7fM-D5MdPD_bASQ0mJ4f7--QHAcTBeCv6F9X8Lci44oX7$ --------------------------- Concurrent Submissions --------------------------- 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!S3VMbrx1lMZpuzMfVPUtwIFO3OEXgAdN8Zy4SlsVFys-unbBRKdqSeCiZNh7fM-D5MdPD_bASQ0mJ4f7--QHAcTBeCv6F9X8LV4YSjse$ ). 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!S3VMbrx1lMZpuzMfVPUtwIFO3OEXgAdN8Zy4SlsVFys-unbBRKdqSeCiZNh7fM-D5MdPD_bASQ0mJ4f7--QHAcTBeCv6F9X8LTyHAt-A$ ). Submissions that violate these policies will be desk-rejected. --------------------------- Policy on Human Participant and Subject Research --------------------------- Authors conducting research involving human participants and subjects must ensure that their research comply with their local governing laws and regulations and the ACM?s general principles as stated in the ACM?s Publications Policy on Research Involving Human Participants and Subjects (https://urldefense.com/v3/__https://www.acm.org/publications/policies/research-involving-human-participants-and-subjects__;!!IBzWLUs!S3VMbrx1lMZpuzMfVPUtwIFO3OEXgAdN8Zy4SlsVFys-unbBRKdqSeCiZNh7fM-D5MdPD_bASQ0mJ4f7--QHAcTBeCv6F9X8LVnA4ldT$ ). Submissions that violate this policy will be rejected. --------------------------- Reviewing Process --------------------------- All submitted papers will be reviewed by at least three members of the program committee. Research papers and tool papers will be evaluated concerning novelty, correctness, significance, readability, and alignment with the conference call. New ideas/vision papers will be evaluated primarily concerning novelty, significance, readability, and alignment with the conference call. SLEBoK papers will be reviewed on their significance, readability, topicality and capacity of presenting/evaluating/demonstrating a piece of BoK about SLE. For fairness reasons, all submitted papers must conform to the above instructions. Submissions that violate these instructions may be rejected without review, at the discretion of the PC chairs. After each review round, authors will get a chance to respond before a final decision is made. --------------------------- Artifact Evaluation --------------------------- For the seventh year, SLE will use an evaluation process for assessing the quality of the artifacts on which papers are based to foster the culture of experimental reproducibility. Authors of accepted research papers are invited to submit artifacts. For more information, please have a look at the Artifact Evaluation (https://urldefense.com/v3/__http://www.sleconf.org/2022/ArtifactEvaluation.html__;!!IBzWLUs!S3VMbrx1lMZpuzMfVPUtwIFO3OEXgAdN8Zy4SlsVFys-unbBRKdqSeCiZNh7fM-D5MdPD_bASQ0mJ4f7--QHAcTBeCv6F9X8LT1JwJHm$ ) page. --------------------------- Special Issue --------------------------- There will be a special issue on Software Language Engineering in the Journal of Systems and Software (JSS). The best papers accepted at the conference will be invited to submit an extended version of their work. --------------------------- Awards --------------------------- - **Distinguished paper**: Award for most notable paper, as determined by the PC chairs based on the recommendations of the programme committee. - **Distinguished artifact**: Award for the artifact most significantly exceeding expectations, as determined by the AEC chairs based on the recommendations of the artifact evaluation committee. --------------------------- Publication --------------------------- All accepted papers will be published in the ACM Digital Library. **AUTHORS TAKE NOTE**: The official publication date is the date the proceedings are made available in the ACM Digital Library. This date may be up to two weeks prior to the first day of the conference. The official publication date affects the deadline for any patent filings related to published work. --------------------------- SLE and Doctoral Students --------------------------- SLE encourages students to submit to the SPLASH doctoral symposium. Authors of accepted papers will have the chance to present their work to the SLE audience, too. --------------------------- Organisation --------------------------- Chairs: * General chair: Bernd Fischer, Stellenbosch University, South Africa * PC co-chair: Lola Burgue?o, Open University of Catalonia, Spain * PC co-chair: Walter Cazzola, Universit? degli Studi di Milano, Italy * Artefact Evaluation co-chair: Thomas K?hn, Karlsruhe Institute of Technology, Germany * Artefact Evaluation co-chair: Juliana A. Pereira, Pontifical Catholic University of Rio de Janeiro, Brazil Program committee: Shaukat Ali, Simula Research Laboratory, Norway Arvid Butting, Aachen University, Germany Marsha Chechik, University of Toronto, Canada Shigeru Chiba, University of Tokyo, Japan Beno?t Combemale, University of Rennes, France Zhenjiang Hu, Peking University, China J?rg Kienzle, McGill University, Canada Dimitris Kolovos, University of York, UK Thomas K?hn, Karlsruhe Institute of Technology, Germany Juan de Lara, Universidad Aut?noma de Madrid, Spain Stefan Marr, University of Kent, UK Marjan Mernik, University of Maribor, Slovenia Natsuko Noda, Shibaura Institute of Technology, Japan Juliana A. Pereira, Pontifical Catholic University of Rio de Janeiro, Brazil Elizabeth Scott, University of London, UK Marco Servetto, Victoria University of Wellington, New Zealand Emma S?derberg, Lund University, Sweden Walid Taha, Halmstad University , Sweden Marco Tullio Valente, Universidade Federal de Minas Gerais, Brazil Erik Van Wyk, University of Minnesota , USA Alfonso de la Vega, University of Cantabria, Spain Ran Wei, Dalian University of Technology, China Andreas Wortmann, Stuttgart University, Germany Vadim Zaytsev, University of Twente, Netherlands Steffen Zschaler, King?s College London, UK --------------------------- Contact --------------------------- For additional information, clarification, or answers to questions, please contact the Programme Chairs (Lola Burgue?o and Walter Cazzola) at sle22-chairs _at_ di.unimi.it. From preiner at cs.stanford.edu Tue Jul 5 12:10:52 2022 From: preiner at cs.stanford.edu (Mathias Preiner) Date: Tue, 5 Jul 2022 09:10:52 -0700 Subject: [TYPES/announce] FMCAD 2022 Student Forum CFP (Deadline July 15) Message-ID: ======================================================================= FMCAD 2022 Student Forum CFP October 18-21, 2022, Trento, Italy ======================================================================= Important Dates --------------- Student forum submission: July 15 (extended), 2022 Student forum notification: Aug 19, 2022 These deadlines are 11:59 pm AoE (Anywhere on Earth) More info here: https://fmcad.org/FMCAD22/student_forum/ Part of the FMCAD 2022: FMCAD Tutorial Day: Oct. 18, 2022 Regular Program: Oct. 19-21, 2022 Student Forum ------------- Continuing the tradition of the previous years, FMCAD 2022 is hosting a Student Forum that provides a platform for students at any career stage (undergraduate or graduate) to introduce their research to the wider Formal Methods community, and solicit feedback. Main Activities --------------- Each student will give a short presentation and present their poster in the poster session. Submissions for the event must be short reports describing research ideas or ongoing work that the student is currently pursuing, and must be within the scope of FMCAD. Work, part of which has been previously published, will be considered; the novel aspect to be addressed in future work must be clearly described in such cases. All submissions will be reviewed by a subgroup of FMCAD program committee members. Format ------ The event will consist of short presentations by the student authors of each accepted submission, and of a poster that will be on display throughout the duration of the conference. All participants of the conference are encouraged to attend the talks and approach the students during the poster presentation. Instructions for the preparation of the talks and poster sessions will be announced on notification of acceptance. Visibility ---------- Accepted submissions will be listed, with title and author name, in the event description in the conference proceedings. The authors will also have the option to upload their slide deck/poster/presentation to the FMCAD web site. The report itself will not appear in the FMCAD proceedings; thus, the presentation at FMCAD should not interfere with potential future submissions of this research (to FMCAD or elsewhere). Travel Awards ------------- Most of the applicants will receive up to $1000 of travel reimbursement after the conference. The first author of each contribution will be given priority over other authors. Please make sure you hold on to all receipts for reimbursement. Further instructions on how to apply for travel grants will be on the website. Submissions ----------- Submissions must be short reports describing research ideas or ongoing work that the student is currently pursuing. The topic of the reports must be within the scope of the FMCAD conference. These reports will NOT be published, thus we welcome reports based on already submitted/published papers. However, the novel aspects to be addressed in future work must be clearly described. Submissions should follow the same formatting guidelines as those for regular FMCAD conference submissions, except that the length is limited to 2 pages IEEE format, including all figures and references. Please submit in the Student forum track using the https://easychair.org/conferences/?conf=fmcad2022. ***Advice***: Focus on the key idea and try to convey it to the reader in an intuitive way. Provide a clear motivation and emphasize novel concepts/contributions. Avoid unnecessary notational clutter unless it is a widely used formalism and helps to make the paper more concise and clear. Only describe related work that?s absolutely crucial to your contribution: the limited space available should be used to present your work. ***Forum Chair*** Mathias Preiner (preiner at cs.stanford.edu) chairs the Student Forum. Feel free to send an email if you have questions about the event. -------------- next part -------------- A non-text attachment was scrubbed... Name: OpenPGP_0xA4AF2BDE778B2463.asc Type: application/pgp-keys Size: 5251 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 andreeac at comp.nus.edu.sg Wed Jul 6 11:40:07 2022 From: andreeac at comp.nus.edu.sg (Andreea Costea) Date: Wed, 06 Jul 2022 23:40:07 +0800 Subject: [TYPES/announce] SPLASH 2022 - Combined Call For Contributions Message-ID: ====================================================================== Combined Call For Contributions 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__;!!IBzWLUs!QRJeNawGB5lt369uOkIWoIj5gINI4lb2W9mRk3QvLcVqsgl6juEVF-V5TocTn1mwf5FN-JUpzw5YdJFeTO-7WAvpu9yX2hvchp9Loww$ ====================================================================== SPLASH - The ACM SIGPLAN conference on Systems, Programming, Languages, and Applications: Software for Humanity embraces all aspects of software construction and delivery, to make it the premier conference on the applications of programming languages - at the intersection of programming languages and software engineering. SPLASH 2022 aims to signify the reopening of the world and being able to meet your international colleagues in person. In case you missed the deadlines for OOPSLA, APLAS, DLS or SAS, worry not, SPLASH has many more exciting events with upcoming deadlines you may consider submitting to (see the combined call below). Follow the registration space on the SPLASH website to attend this fantastic line-up of events - we aim to open for registration on Aug 1st; the accommodation information will be filled in by then with student options at $65 NZD per night. ====================================================================== ### OUTLINE OF THE COMBINED CALL FOR CONTRIBUTIONS: SPLASH Workshops*: - FTSCS - HATRA - LIVE - PAINT - REBLS - Unsound - VMIL * Submissions due for all workshops: 1st September 2022 SPLASH Co-hosted events with upcoming deadlines: - Onward! Papers (submission deadline: 10 Jul) - Student Research Competition (submission deadline: 18 Jul) - Doctoral Symposium (submission deadline: 1 Aug) - GPCE (abstract/paper submission deadline: 8/12 Aug) - SLE (2nd round of abstract/paper submission deadline: 8/12 Aug) - Posters (submission deadline: 15 Aug) - SPLASH-E (submission deadline: 19 Aug) - Onward! Essays (submission deadline: 5 Sept) ====================================================================== ### Workshops **** Formal Techniques for Safety-Critical Systems (FTSCS) **** The aim of this workshop is to bring together researchers and engineers who are interested in the application of formal and semi-formal methods to improve the quality of safety-critical computer systems. FTSCS strives to promote research and development of formal methods and tools for industrial applications, and is particularly interested in industrial applications of formal methods. The workshop will provide a platform for discussions and the exchange of innovative ideas, so submissions on work in progress are encouraged. Details: https://urldefense.com/v3/__https://2022.splashcon.org/home/ftscs-2022__;!!IBzWLUs!QRJeNawGB5lt369uOkIWoIj5gINI4lb2W9mRk3QvLcVqsgl6juEVF-V5TocTn1mwf5FN-JUpzw5YdJFeTO-7WAvpu9yX2hvciOVeNiU$ **** Human Aspects of Types and Reasoning Assistants (HATRA) **** This workshop brings together programming languages, software engineering, security, and human-computer interaction researchers to investigate methods for making languages that provide stronger safety properties more effective for programmers and software engineers. HATRA is interested in two different kinds of contributions. First, extended abstracts that summarize an existing body of work that is relevant to the workshop?s topic. Second, research papers that describe a new idea, approach, or hypothesis in the space and are presented as an opportunity for the authors to receive community feedback and for the community to seek inspiration from others. Details: https://urldefense.com/v3/__https://2022.splashcon.org/home/hatra-2022__;!!IBzWLUs!QRJeNawGB5lt369uOkIWoIj5gINI4lb2W9mRk3QvLcVqsgl6juEVF-V5TocTn1mwf5FN-JUpzw5YdJFeTO-7WAvpu9yX2hvcIohTRkA$ **** Live Programming (LIVE) **** Programming is cognitively demanding, and too difficult. LIVE is a workshop exploring new user interfaces that improve the immediacy, usability, and learnability of programming. Whereas PL research traditionally focuses on programs, LIVE focuses more on the activity of programming. Our goal is to provide a supportive venue where early-stage work receives constructive criticism. Whether graduate students or tenured faculty, researchers need a forum to discuss new ideas and get helpful feedback from their peers. Towards that end, we will allot about ten minutes for discussion after every presentation. Details: https://urldefense.com/v3/__https://2022.splashcon.org/home/live-2022__;!!IBzWLUs!QRJeNawGB5lt369uOkIWoIj5gINI4lb2W9mRk3QvLcVqsgl6juEVF-V5TocTn1mwf5FN-JUpzw5YdJFeTO-7WAvpu9yX2hvcrjJxnz8$ **** Programming Abstractions and Interactive Tools, Notations, and Environments (PAINT) **** In this workshop, we want to discuss programming environments that support users in working with and creating domain-specific abstractions and notations. Topics of interest include the composition and integration of domain-specific abstractions and tools inside general-purpose programming languages and environments, the implementation and evaluation of editing ergonomics and UX concerns, or tool support for creating domain-specific abstractions and tools. Environments that typically exhibit such properties include meta tools or tool creation frameworks, language workbenches, block-based editors and other visual programming approaches or projectional editors. Details: https://urldefense.com/v3/__https://2022.splashcon.org/home/paint-2022__;!!IBzWLUs!QRJeNawGB5lt369uOkIWoIj5gINI4lb2W9mRk3QvLcVqsgl6juEVF-V5TocTn1mwf5FN-JUpzw5YdJFeTO-7WAvpu9yX2hvcTUUwsVc$ **** Reactive and Event-Based Languages and Systems (REBLS) **** This workshop will gather researchers in reactive and event-based languages and systems. The goal of the workshop is to exchange new technical research results and to better define the field by coming up with taxonomies and overviews of the existing work. Details: https://urldefense.com/v3/__https://2022.splashcon.org/home/rebls-2022__;!!IBzWLUs!QRJeNawGB5lt369uOkIWoIj5gINI4lb2W9mRk3QvLcVqsgl6juEVF-V5TocTn1mwf5FN-JUpzw5YdJFeTO-7WAvpu9yX2hvcEamVE5g$ **** Sources of Unsoundness in Verification (Unsound) **** Participants to Unsound will be able to share their experience and exploits on how different verification tools can either be broken or expose confusing behavior, likely to be unexpected by users. We are particularly interested in sources of unsoundness that are accidentally shared by many different unrelated research lines, and to develop an understanding on why this is the case. The workshop is meant to be welcoming for both people with strong theoretical skills, as well as people who just like hacking things. We do not expect fully polished submissions and we will not have formal proceedings. Details: https://urldefense.com/v3/__https://2022.splashcon.org/home/unsound-2022__;!!IBzWLUs!QRJeNawGB5lt369uOkIWoIj5gINI4lb2W9mRk3QvLcVqsgl6juEVF-V5TocTn1mwf5FN-JUpzw5YdJFeTO-7WAvpu9yX2hvcCR36SKQ$ **** Virtual Machines and Language Implementations (VMIL) **** The concept of Virtual Machines is pervasive in the design and implementation of programming systems. Virtual Machines and the languages they implement are crucial in the specification, implementation and/or user-facing deployment of most programming technologies. The VMIL workshop is a forum for researchers and cutting-edge practitioners working on language virtual machines to discuss the various related engineering and research issues. Details: https://urldefense.com/v3/__https://2022.splashcon.org/home/vmil-2022__;!!IBzWLUs!QRJeNawGB5lt369uOkIWoIj5gINI4lb2W9mRk3QvLcVqsgl6juEVF-V5TocTn1mwf5FN-JUpzw5YdJFeTO-7WAvpu9yX2hvcKO7Qz3g$ **** Important Dates for All Workshops Paper/Abstract Submission Deadline: 1 Sept 2022 Camera-Ready Deadline (where applicable): 24 Oct 2022 ====================================================================== ### SPLASH Co-hosted conferences, symposiums and events with upcoming deadlines **** Onward! Papers **** Onward! is a premier multidisciplinary conference focused on everything to do with programming and software: including processes, methods, languages, communities and applications. Onward! is more radical, more visionary and more open than other conferences to ideas that are well-argued but not yet proven. We welcome different ways of thinking about, approaching and reporting on programming language and software engineering research. Onward! Papers is looking for grand visions and new paradigms that could make a big difference in how we will one day build software. Submission deadline: 10th July, 2022 AOE. Details: https://urldefense.com/v3/__https://2022.splashcon.org/track/splash-2022-Onward-papers__;!!IBzWLUs!QRJeNawGB5lt369uOkIWoIj5gINI4lb2W9mRk3QvLcVqsgl6juEVF-V5TocTn1mwf5FN-JUpzw5YdJFeTO-7WAvpu9yX2hvcKNDxAEY$ **** Student Research Competition **** The ACM Student Research Competition (SRC) offers a unique opportunity for undergraduate and graduate students to present their research to a panel of judges and conference attendees at SPLASH. The SRC provides visibility and exposes up-and-coming researchers to computer science research and the research community. This competition also gives students an opportunity to discuss their research with experts in their field, get feedback, and sharpen their communication and networking skills. Submission deadline: 18th July, 2022. Details: https://urldefense.com/v3/__https://2022.splashcon.org/track/splash-2022-SRC__;!!IBzWLUs!QRJeNawGB5lt369uOkIWoIj5gINI4lb2W9mRk3QvLcVqsgl6juEVF-V5TocTn1mwf5FN-JUpzw5YdJFeTO-7WAvpu9yX2hvcku0wJm0$ **** Doctoral Symposium **** The Doctoral Symposium provides students with useful guidance for completing their dissertation research and beginning their research careers. The symposium will provide an interactive forum for doctoral students who have progressed far enough in their research to have a structured proposal, but will not be defending their dissertation in the next 12 months. Submission deadline: 1st August, 2022. Details: https://urldefense.com/v3/__https://2022.splashcon.org/track/splash-2022-Doctoral-Symposium__;!!IBzWLUs!QRJeNawGB5lt369uOkIWoIj5gINI4lb2W9mRk3QvLcVqsgl6juEVF-V5TocTn1mwf5FN-JUpzw5YdJFeTO-7WAvpu9yX2hvcd_5-K00$ **** GPE **** The ACM SIGPLAN International Conference on Generative Programming: Concepts & Experiences is a programming languages conference focusing on techniques and tools for code generation, language implementation, and product-line development. GPCE seeks conceptual, theoretical, empirical, and technical contributions to its topics of interest, which include but are not limited to: program transformation, staging, macro systems, preprocessors, program synthesis, and code-recommendation systems; domain-specific languages, language embedding, language design, and language workbenches; feature-oriented programming, domain engineering, and feature interactions; applications and properties of code generation, language implementation, and product-line development. Abstract submission deadline: 8th August, 2022. Paper submission deadline: 12th August, 2022. Details: https://urldefense.com/v3/__https://2022.splashcon.org/home/gpce-2022__;!!IBzWLUs!QRJeNawGB5lt369uOkIWoIj5gINI4lb2W9mRk3QvLcVqsgl6juEVF-V5TocTn1mwf5FN-JUpzw5YdJFeTO-7WAvpu9yX2hvcKdTpfCA$ **** SLE **** The ACM SIGPLAN International Conference on Software Language Engineering is devoted to the principles of software languages: their design, their implementation, and their evolution. Software language engineering is the discipline of engineering languages and their tools required for the creation of software. It abstracts from the differences between programming languages, modelling languages, and other software languages, and emphasizes the engineering facet of the creation of such languages, that is, the establishment of the scientific methods and practices that enable the best results. While SLE is certainly driven by its metacircular character (software languages are engineered using software languages), SLE is not self-satisfying: its scope extends to the engineering of languages for all and everything. 2nd Round of abstract submission deadline: 8th August, 2022. 2nd Round of paper submission deadline: 12th August, 2022. Details: https://urldefense.com/v3/__https://2022.splashcon.org/home/sle-2022__;!!IBzWLUs!QRJeNawGB5lt369uOkIWoIj5gINI4lb2W9mRk3QvLcVqsgl6juEVF-V5TocTn1mwf5FN-JUpzw5YdJFeTO-7WAvpu9yX2hvcWLRxxsI$ **** Posters **** The SPLASH Posters track provides an excellent forum for authors to present their recent or ongoing projects in an interactive setting, and receive feedback from the community. We invite submissions covering any aspect of programming, systems, languages and applications. The goal of the poster session is to encourage and facilitate small groups of individuals interested in a technical area to gather and interact. Submission deadline: 15th August, 2022. Details: https://urldefense.com/v3/__https://2022.splashcon.org/track/splash-2022-Posters__;!!IBzWLUs!QRJeNawGB5lt369uOkIWoIj5gINI4lb2W9mRk3QvLcVqsgl6juEVF-V5TocTn1mwf5FN-JUpzw5YdJFeTO-7WAvpu9yX2hvctCllRvI$ **** SPLASH-E **** SPLASH-E is a symposium for software and languages (SE/PL) researchers with activities and interests around computing education. Some build pedagogically-oriented languages or tools; some think about pedagogic challenges around SE/PL courses; some bring computing to non-CS communities; some pursue human studies and educational research. At SPLASH-E, we share our educational ideas and challenges centered in software/languages, as well as our best ideas for advancing such work. Submission deadline: 19th August, 2022. Details: https://urldefense.com/v3/__https://2022.splashcon.org/track/splash-2022-SPLASH-E__;!!IBzWLUs!QRJeNawGB5lt369uOkIWoIj5gINI4lb2W9mRk3QvLcVqsgl6juEVF-V5TocTn1mwf5FN-JUpzw5YdJFeTO-7WAvpu9yX2hvc515g5Y4$ **** Onward! Essays **** Onward! Essays track is looking for clear and compelling pieces of writing about topics important to the software community. An essay may be an exploration of the topic and its impact, or a story about the circumstances of its creation; it may present a personal view of what is, explore a terrain, or lead the reader in an act of discovery; it may be a philosophical digression or a deep analysis. The subject area?software, programming, and programming languages?should be interpreted broadly and can include the relationship of software to human endeavors, or its philosophical, sociological, psychological, historical, or anthropological underpinnings. Submission deadline: 5th September, 2022. Details: https://urldefense.com/v3/__https://2022.splashcon.org/track/splash-2022-Onward-Essays__;!!IBzWLUs!QRJeNawGB5lt369uOkIWoIj5gINI4lb2W9mRk3QvLcVqsgl6juEVF-V5TocTn1mwf5FN-JUpzw5YdJFeTO-7WAvpu9yX2hvchB8YrDY$ ====================================================================== Be part of these awesome events! ====================================================================== ### Organizing Committee General Chair: Alex Potanin (Australian National University) OOPSLA Review Committee Chair: Amal Ahmed (Northeastern University) OOPSLA Review Committee Co-Chair: Jan Vitek (Northeastern University; Czech Technical University) OOPSLA Artifact Evaluation Co-Chair: Benjamin Greenman (Brown University) OOPSLA Artifact Evaluation Co-Chair: Ana Milanova (Rensselaer Polytechnic Institute) APLAS Chair: Ilya Sergey (National University of Singapore) DLS PC Co-Chair: Wolfgang De Meuter (Vrije Universiteit Brussel) DLS PC Co-Chair: Arjun Guha (Northeastern University) GPCE General Chair: Bernhard Scholz (University of Sydney) GPCE PC Chair: Yukiyoshi Kameyama (University of Tsukuba) SAS Co-Chair: Caterina Urban (INRIA & ?cole Normale Sup?rieure | Universit? PSL) SAS Co-Chair: Gagandeep Singh (University of Illinois at Urbana-Champaign; VMware) SLE Chair: Bernd Fischer (Stellenbosch University) SLE PC Co-Chair: Lola Burgue?o (Open University of Catalonia) SLE PC Co-Chair: Walter Cazzola (Universit? degli Studi di Milano) Onward! Papers Chair: David Tolpin (PUB+) Onward! Essays Chair: Jeremy Singer (University of Glasgow) SPLASH-E Co-Chair: Martin Henz (National University Of Singapore) SPLASH-E Co-Chair: Benjamin Lerner (Northeastern University) Workshops Co-Chair: Mehdi Bagherzadeh (Oakland University) Workshops Co-Chair: Raffi Khatchadourian (City University of New York (CUNY) Hunter College) Comfy Chair: Tony Hosking (Australian National University) Hybridisation Co-Chair: Jonathan Aldrich (Carnegie Mellon University) Hybridisation Co-Chair: Youyou Cong (Tokyo Institute of Technology) Diversity and Inclusion Chair, Local Organizing Chair: Kelly Blincoe (University of Auckland) Video Co-Chair: Zixian Cai (Australian National University) Video Co-Chair: Benjamin Chung (Northeastern University) Sponsorship Co-Chair: Bor-Yuh Evan Chang (University of Colorado Boulder & Amazon) Publicity Chair, Web Co-Chair: Andreea Costea (National University Of Singapore) Budget and Finance Chair: Michael Homer (Victoria University of Wellington) Student Volunteer Co-Chair: Yao Li (University of Pennsylvania) Student Volunteer Co-Chair: Julian Mackay (Victoria University of Wellington) Student Research Competition Co-Chair: Xujie Si (McGill University, Canada) Student Research Competition Co-Chair: Caterina Urban (INRIA & ?cole Normale Sup?rieure | Universit? PSL) Symposium Chair: Fabian Muehlboeck (IST Austria) PLMW Co-Chair: Lukasz Ziarek (University at Buffalo) PLMW Co-Chair: Molly Feldman (Oberlin College) From serge.autexier at dfki.de Wed Jul 6 12:17:27 2022 From: serge.autexier at dfki.de (Serge Autexier) Date: Wed, 6 Jul 2022 18:17:27 +0200 (CEST) Subject: [TYPES/announce] CICM 2022, final call for applications to the doctoral programme, 15. July 2022 Message-ID: <20220706161727.84E517081CD6@gigondas.localdomain> [Apologies for cross-postings] Final Call for Applications to the Doctoral Programme Deadline 15. July 2022 15th Conference on Intelligent Computer Mathematics - CICM 2022 - September 19-23, 2022 Tbilisi, Georgia (hybrid event) https://urldefense.com/v3/__http://www.cicm-conference.org/2022__;!!IBzWLUs!VEt0fUNQyKwmaJcf-4skPEfmqYcOA54qgRIbP8GwF9fKDr2HNSGj_f0rHy18S2CO1FhbyeuBU1clnh9-cauFlR3oHmBWBXVrXCuFCC2Q$ -------------------------------------------------------------------------------- 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: * Erika Abraham (RWTH Aachen University) * Deyan Ginev (FAU Erlangen-N?rnberg and NIST) * S?bastien Gou?zel (IRMAR, Universit? de Rennes 1) CICM 2022 Programme committee: see https://urldefense.com/v3/__https://www.cicm-conference.org/2022/cicm.php?event=&menu=pc__;!!IBzWLUs!VEt0fUNQyKwmaJcf-4skPEfmqYcOA54qgRIbP8GwF9fKDr2HNSGj_f0rHy18S2CO1FhbyeuBU1clnh9-cauFlR3oHmBWBXVrXPs9i7Za$ The Doctoral Programme provides a dedicated forum for PhD students to present and discuss their ideas, ongoing or planned research, and achieved results in an open atmosphere. It will consist of presentations by the PhD students to get constructive feedback, advice, and suggestions from the research advisory board, researchers, and other PhD students. Each PhD student will be assigned to an experienced researcher from the research advisory board who will act as a mentor and who will provide detailed feedback and advice on their intended and ongoing research. Application Students at any stage of their PhD can apply and should submit the following documents: * A two-page abstract of your thesis describing your research questions, research plans, completed and remaining research, evaluation plans and publication plans; * A two-page CV that includes background information (name, university, supervisor), education (degree sought, year/status of degree, previous degrees), employments, relevant research experience (publications, presentations, attended conferences or workshops, etc.) - Deadline: July 15, 2022 (not a cut-off time and late submissions may still be considered) - Notification of acceptance: July 29, 2022 All submissions should be made via EasyChair at https://urldefense.com/v3/__https://easychair.org/conferences/?conf=cicm2022__;!!IBzWLUs!VEt0fUNQyKwmaJcf-4skPEfmqYcOA54qgRIbP8GwF9fKDr2HNSGj_f0rHy18S2CO1FhbyeuBU1clnh9-cauFlR3oHmBWBXVrXCkOb23L$ From anuj.dawar at cl.cam.ac.uk Thu Jul 7 03:39:45 2022 From: anuj.dawar at cl.cam.ac.uk (Anuj Dawar) Date: Thu, 7 Jul 2022 08:39:45 +0100 Subject: [TYPES/announce] FSTTCS 2022 - second call for papers Message-ID: <596b8eec-ce7a-10ed-dec4-43f8b15d1fc3@cl.cam.ac.uk> FSTTCS 2022 ---------- https://urldefense.com/v3/__https://www.fsttcs.org.in/2022/__;!!IBzWLUs!Tc_sHxuaigDRLhogqlRqhW1EW3Ua8QsuVhR4WaLkD3U7daw7PS2Y8VeAvVIfA6uy0o87e_TgjM1Q25ei2KtY-PmuyXSUJVYf2XMT3Tg$ FSTTCS 2022 is the 42nd conference on Foundations of Software Technology and Theoretical Computer Science. It is organised by IARCS, the Indian Association for Research in Computing Science, in association with ACM India. It is a forum for presenting original results in foundational aspects of Computer Science and Software Technology. FSTTCS 2022 will be held in IIT Madras during December 18?20, 2022. List of Topics ----------- Track A ------ Algebraic Complexity Algorithms and Data Structures Algorithmic Graph Theory and Combinatorics Approximation Algorithms Combinatorial Optimization Communication Complexity Computational Biology Computational Complexity Computational Geometry Computational Learning Theory Cryptography and Security Data Streaming and Sublinear algorithms Economics and Computation Parallel, Distributed and Online Algorithms Parameterized Complexity Proof Complexity Quantum Computing Randomness in Computing Theoretical Aspects of Mobile and High-Performance Computing Track B ------ Automata, Games and Formal Languages Logic in Computer Science Modal and Temporal Logics Models of Concurrent, Distributed and Mobile Systems Models of Timed, Reactive, Hybrid and Stochastic Systems Model Theory Principles and Semantics of Programming Languages Program Analysis and Transformation Security protocols Specification, Verification and Synthesis Theorem Proving and Decision Procedures Invited Speakers ------------- Patricia Bouyer-Decitre (CNRS & ENS Paris-Saclay) Irit Dinur (Weizmann Institute) Anupam Gupta (Carnegie Mellon) Akash Lal (Microsoft Research) Rahul Santhanam (University of Oxford) Submission Guidelines ------------------ Submissions must be in electronic form via EasyChair (using the following link: https://urldefense.com/v3/__https://easychair.org/my/conference?conf=fsttcs2022__;!!IBzWLUs!Tc_sHxuaigDRLhogqlRqhW1EW3Ua8QsuVhR4WaLkD3U7daw7PS2Y8VeAvVIfA6uy0o87e_TgjM1Q25ei2KtY-PmuyXSUJVYf1P02Cxw$ ) in the LIPIcs LaTeX style which is available here: https://urldefense.com/v3/__https://submission.dagstuhl.de/documentation/authors__;!!IBzWLUs!Tc_sHxuaigDRLhogqlRqhW1EW3Ua8QsuVhR4WaLkD3U7daw7PS2Y8VeAvVIfA6uy0o87e_TgjM1Q25ei2KtY-PmuyXSUJVYfrB_ufTg$ . Submissions must not exceed 15 pages (excluding bibliography), but may include a clearly marked appendix containing technical details. The appendix will be read only at the discretion of the program committee. Simultaneous submissions to journals or other conferences with published proceedings are disallowed. Accepted papers will be published as proceedings of the conference in the ?Leibniz International Proceedings in Informatics (LIPIcs)? as a free, open, electronic archive with access to all. Authors will retain full rights over their work. The accepted papers will be published under a ?CC-BY license?. For an accepted paper to be included in the proceedings, one of the authors must commit to presenting the paper at the conference. Important Dates Submission deadline: July 14, 2022 AoE (firm) Notification to authors: September 16, 2022 FSTTCS 2022: December 18?20, 2022. Programme Committee ------------------ Track A ------ Venkatesan Guruswami (University of California, Berkeley) ? Co-chair V. Arvind (The Institute of Mathematical Sciences) Divesh Aggarwal (National University of Singapore) Diptarka Chakraborty (National University of Singapore) Radu Curticapean (IT University of Copenhagen) Sumegha Garg (Harvard University) Badih Ghazi (Google Research) Tom Gur (University of Warwick) Euiwoong Lee (University of Michigan) Debmalya Panigrahi (Duke University) Pravesh Kothari (Carnegie Mellon University) Nicole Megow (Universit?t Bremen) Prajakta Nimbhorkar (Chennai Mathematical Institute) Rishi Saket (Google Research, India) Ramprasad Saptharishi (Tata Institute of Fundamental Research) Rakesh Venkat (Indian Institute of Technology, Hyderabad) David Wajc (Stanford University) Amir Yehudayoff (Technion, Israel) Meirav Zahavi (Ben-Gurion University, Israel) Track B ------ Anuj Dawar (University of Cambridge) ? Co-chair Ashutosh Trivedi (University of Colorado Boulder) Deepak D?Souza (Indian Institute of Science) Igor Walukiewicz (Universit? de Bordeaux, France) Jonni Virtema (University of Sheffield, UK) Laura Bozzelli (University of Naples, Italy) Laure Daviaud (City University of London) Maribel Fernandez (King's College London) Mohamed Faouzi Atig (Uppsala University, Sweden) Natasha Alechina (Utrecht University, Netherlands) Nathan Lhote (Aix-Marseille University, France) Olaf Beyersdorff (Friedrich Schiller University Jena, Germany) Radha Jagadeesan (DePaul University) Shaull Almagor (Technion, Israel) Shibashis Guha (Tata Institute of Fundamental Research) Supratik Chakraborty (Indian Institute of Technology, Bombay) Organizing Committee ------------------ Meghana Nasre (IIT Madras) ? co-chair Chandrashekhar Sahasrabudhe (ACM India, Member) Jayalal Sarma (IIT Madras) ? co-chair Contact Information All questions about submissions should be emailed to the PC chairs: anuj.dawar at cl.cam.ac.uk or venkatg at berkeley.edu From Vlad.Rusu at inria.fr Fri Jul 8 04:07:59 2022 From: Vlad.Rusu at inria.fr (vlad) Date: Fri, 8 Jul 2022 10:07:59 +0200 Subject: [TYPES/announce] FROM 2022: last CFP (with extended deadlines) Message-ID: <3c52eb49-ca1c-f1fd-8bee-621c2fc874de@inria.fr> ?? FROM 2022 - Working Formal Methods Symposium ????? Iasi, Romania, 19-20 September 2022 ?????? https://urldefense.com/v3/__https://project.inria.fr/from22/__;!!IBzWLUs!Uu-a5Y7-ZHaVP5aNdkfb5wRZ6zGEWaVz0PDAzxbi-BPEgkaAJimNdVocZ_7LVOYSFj6X7HStJqn91B-XNc6NrUJrXmO8C1wcww$ ?????? in conjunction with WOLLIC 2022 ??????? https://urldefense.com/v3/__https://wollic2022.github.io__;!!IBzWLUs!Uu-a5Y7-ZHaVP5aNdkfb5wRZ6zGEWaVz0PDAzxbi-BPEgkaAJimNdVocZ_7LVOYSFj6X7HStJqn91B-XNc6NrUJrXmOC8noI4w$ FROM aims to bring together? researchers and practitioners who work on formal? methods? by? contributing new? theoretical? results, methods, techniques, and frameworks, and/or make? the formal methods to work by creating or using software tools that apply theoretical contributions. FROM? symposiums? are organized? by? the? Faculty of? Mathematics and Computer? Science? of the? University? of? Bucharest, the Faculty? of Mathematics? and Computer? Science of? the Babes-Bolyai University of Cluj-Napoca, the? Faculty of? Computer Science? of the? Alexandru Ioan Cuza University of? Iasi, and the Faculty of? Mathematics and Computer Science of the West University of Timi?oara. FROM 2022? is the sixth event? in a yearly workshop? series. The first edition was held in 2017 in? Bucharest, the second edition was held in 2018 in? Ia?i, the third? edition was held? in 2019 in? Timi?oara. The fourth edition was organized in Cluj-Napoca in 2020 as a virtual event due to the COVID-19 pandemic.? The fifth edition (2021), in Timi?oara, was also organized? as a virtual event.? The program? of the symposium includes invited? lectures and? regular contributions. Submissions on the general? topics of? formal methods, theoretical? computer science, logic and applications are welcome. Important Dates (AoE) --------------- Abstract submission (extended):??? July 18, 2022 Paper submission (extended):??? July 25, 2022 Author notification:??? August 25, 2022 Topics of interest ------------------ Areas and formalisms of interest include: + Category theory in computer science + Distributed systems and concurrency + Formal languages and automata theory + Formal modelling, verification and testing + Logic in computer science + Logical frameworks + Mathematical structures in computer science + Models of computation + Semantics of programming languages + Type systems + Domain Science and Engineering Methods of interest include: + Automated reasoning and model generation + Automated induction + Certified programs + Data-flow and control-flow analysis + Deductive verification + Mechanized proofs + Model checking + Proof mining + Symbolic computation + Term rewriting Applications of interest include: + Computational logic + Computer mathematics + Knowledge representation, ontology reasoning, deductive databases + Program analysis + Verification and synthesis of software and hardware + Uncertainty reasoning and soft computing Publication ----------- Accepted research? papers should? be presented? at the? conference and will be? published in the? Electronic Proceedings in? Computer Science series https://urldefense.com/v3/__http://www.eptcs.org/__;!!IBzWLUs!Uu-a5Y7-ZHaVP5aNdkfb5wRZ6zGEWaVz0PDAzxbi-BPEgkaAJimNdVocZ_7LVOYSFj6X7HStJqn91B-XNc6NrUJrXmP-vrNDjg$ We? intend to invite authors? of the best original? contributions --? regular? or short? --? to submit extended versions to? a special issue of? a journal. For previous editions, we published? selected? papers? in? Fundamenta? Informaticae? (2018) and Journal of Logical and Algebraic Methods in Programming (2019). Submissions ----------- Papers of? up to? 16 pages? prepared according? to the? EPTCS template https://urldefense.com/v3/__http://style.eptcs.org/__;!!IBzWLUs!Uu-a5Y7-ZHaVP5aNdkfb5wRZ6zGEWaVz0PDAzxbi-BPEgkaAJimNdVocZ_7LVOYSFj6X7HStJqn91B-XNc6NrUJrXmOZjgLZpA$ ? must? be?? submitted? electronically through EasyChair https://urldefense.com/v3/__https://easychair.org/conferences/?conf=from22__;!!IBzWLUs!Uu-a5Y7-ZHaVP5aNdkfb5wRZ6zGEWaVz0PDAzxbi-BPEgkaAJimNdVocZ_7LVOYSFj6X7HStJqn91B-XNc6NrUJrXmNKNaKYdw$ Research papers? must contain original research? results not submitted and? not published? elsewhere. Authors? who? want to? present work? in progress or? discuss new aspects or? a survey of their? older research results at the workshop are welcome to submit an extended abstract (up to 8? pages). Papers? will be? refereed and accepted? on the basis of their scientific merit and relevance to the symposium's topics. Registration ------------ The planned registration fee? is? 100? Euro.? It? covers? the symposium kit, refreshments during breaks, lunches, symposium dinner, publication. Invited Speakers ---------------- Dines Bj?rner, Technical University of Denmark Denisa Diaconescu, University of Bucharest? & Runtim Verification Inc. Thomas Genet, University of Rennes Ioana Leustean, University of Bucharest Dorel Lucanu, Alexandru Ioan Cuza University of Iasi Luigia Petre,? ?bo Akademi University Program Committee ------------------- Andrei Arusoaie, Alexandru Ioan Cuza University of Iasi Dines Bj?rner, Technical Univesity of Denmark Florin Craciun, Babes-Bolyai University of Cluj-Napoca Catalin Dima, Universit? Paris-Est Cr?teil Madalina Erascu, West University of Timisoara & e-Austria Institute Laurentiu Leustean, University of Bucharest Dorel Lucanu, Alexandru Ioan Cuza University of Iasi Simona Motogna, Babes-Bolyai University of Cluj-Napoca David Nowak, CNRS & University of Lille Peter Csaba ?lveczky, University of Oslo Corina Pasareanu, Nasa & Carnegie Mellon University Luigia Petre, ?bo Akademi University Vlad Rusu, INRIA Lille (chair) Viorica Sofronie-Stokkermans, University of Koblenz-Landau Organising Committee -------------------- Andrei Arusoaie, Alexandru Ioan Cuza University of Iasi Rodica Bozianu, Alexandru Ioan Cuza University of Iasi Vlad Rusu, INRIA Lille From p.r.a.pradic at swansea.ac.uk Mon Jul 11 03:01:11 2022 From: p.r.a.pradic at swansea.ac.uk (ppradic) Date: Mon, 11 Jul 2022 09:01:11 +0200 Subject: [TYPES/announce] =?utf-8?q?Two_PhD_opportunities_at_Swansea_Univ?= =?utf-8?q?ersity=3A_=CE=BB-calculi_and_automata/dynamical_systems_and_com?= =?utf-8?q?putability?= Message-ID: Dear all, (apologies if you receive this multiple times; I forgot I was not subscribe to the mailing list when sending the first time around. Feel free to circulate to students who might be interested in these offers) I'd like to advertise a funded PhD position in the CS theory group at Swansea University, to be supervised by myself. The topic would be about exploring connections between (linear) ?-calculi and automata theory, hopefully using semantic methods. The official advert, that can be found at https://urldefense.com/v3/__https://www.swansea.ac.uk/postgraduate/scholarships/research/computer-science-epsrc-su-phd-comparing-2022-rs125.php__;!!IBzWLUs!R7A4yMrvFKLoUeZK32bK-tUR4OP24eS5xrgxdVemzC8AXleJbacokVlMACo9MoN0-CF0w2q5Vgnln9SFfqCDW-iytvajlJ-VbwOu9lfCtg$ gives some administrative details and some ideas on the research directions that could be explored (I would personally also be happy to discuss other ideas as long as I would be a particularly good fit to supervise; my webpage might give you some idea about my interests: https://urldefense.com/v3/__https://cs-web.swan.ac.uk/*pierrepradic/__;fg!!IBzWLUs!R7A4yMrvFKLoUeZK32bK-tUR4OP24eS5xrgxdVemzC8AXleJbacokVlMACo9MoN0-CF0w2q5Vgnln9SFfqCDW-iytvajlJ-VbwOb3pXbUQ$ ). Eike Neumann also has a funded PhD position to offer on a project about looking at dynamical systems with a focus on exact real number computability that I'd also like to advertise https://urldefense.com/v3/__https://www.swansea.ac.uk/postgraduate/scholarships/research/computer-science-epsrc-su-phd-robust-2022-rs122.php__;!!IBzWLUs!R7A4yMrvFKLoUeZK32bK-tUR4OP24eS5xrgxdVemzC8AXleJbacokVlMACo9MoN0-CF0w2q5Vgnln9SFfqCDW-iytvajlJ-VbwNMq3ArYw$ The stipend would be ?16,062/year (UKRI rate), for a duration of 3 years and the tuition fees are covered by the funding. The closing date for both calls is July 29th. While the application procedure is detailed in the links I gave above, we would welcome prospective candidates getting in touch via email (p.r.a.pradic at swansea.ac.uk for me, e.f.neumann at swansea.ac.uk for Eike) beforehand. All the best, Pierre Pradic From qest.publicity at gmail.com Mon Jul 11 08:35:51 2022 From: qest.publicity at gmail.com (QEST Publicity) Date: Mon, 11 Jul 2022 12:35:51 -0000 Subject: [TYPES/announce] QEST 2022 Call for Participation Message-ID: <20220711123551.5804F609FE@anxur.fi.muni.cz> An HTML attachment was scrubbed... URL: From paolo.pistone at uniroma3.it Mon Jul 11 08:43:41 2022 From: paolo.pistone at uniroma3.it (Paolo Pistone) Date: Mon, 11 Jul 2022 12:43:41 +0000 Subject: [TYPES/announce] Call for Participation: Online Workshop Series "Proofs, Computation and Meaning" Message-ID: *Apologies for cross postings* ******************************************************************************* Call For Participation: Online Workshop Series "Proofs, Computation and Meaning" Online events: September 7, September 28 and December 7, 2022 ******************************************************************************* This online workshop series was originally planned as an in person meeting which was canceled due to the outbreak of the Coronavirus pandemic in early March 2020. The event was planned to bring researchers whose work focuses on the notion of formal proof from either a philosophical, computational or mathematical perspective. With the obvious limitations of an online format, we wish to keep this original motivation, which looks even more timely in a time in which interdisciplinary interactions are made more difficult by the pandemic. The goal is that of creating an opportunity for members of different communities to interact and exchange their views on proofs, their identity conditions, and the more convenient ways of representing them formally. ******************************************************************************* SCOPE: Around thirty years after the fall of Hilbert's program, the proofs-as-programs paradigm established the view that a proof should not be identified, as in Hilbert's metamathematics, with a string of symbols in some formal system. Rather, proofs should consist in computational or epistemic objects conveying evidence to mathematical propositions. The relationship between formal derivations and proofs should then be analogous to the one between words and their meanings. This view naturally gives rise to questions such as ?which conditions should a formal arrangement of symbols satisfy to represent a proof?? or ?when do two formal derivations represent the same proof?". These questions underlie past and current research in proof theory both in the theoretical computer science community (e.g. categorical logic, domain theory, linear logic) and in the philosophy community (e.g. proof-theoretic semantics). In spite of these common motivations and historical roots, it seems that today proof theorists in philosophy and in computer science are losing sight of each other. This workshop aims at contributing to a renaissance of the interaction between researchers with different backgrounds by establishing a constructive environment for exchanging views, problems and results. ******************************************************************************* ORGANIZATION: The workshop series includes three events, each focusing on one specific aspect of proofs and their representation. To foster interaction and discussion, each event will consists in short talks followed by a 15 minutes slot during which participants can engage in discussion or just take a short break. 1. Infinity and co-inductive proofs September 7, 10 am (CET) In Hilbert's program, the role of proof theory was that of assuring a solid finitistic foundations for the use of infinitary concepts in mathematics. By contrast, and somehow paradoxically, the development of the discipline led to the study of proof systems explicitly incorporating infinitary ideas such as impredicativity, co-induction and other constructions. Speakers: - Laura Crosilla (University of Oslo) - Hidenori Kurokawa (Kanazawa University) - David Binder (University of T?bingen) - Gilda Ferreira (Lisbon University) 2. On the syntax of proofs September 28, 4 pm (CET) Both in natural deduction and in sequent calculs, as well as in their associated type systems, the rules of the standard connectives have been generalized in various ways, thereby obtaining proof-theoretic characterizations of various families of connectives or more generally of data type constructors. Although the motivations for such generalizations are apparently very different (ranging from considerations about the inherent duality of the calculi, to the relation between syntax and semantics, to questions arising in the study of proof-search strategies), they often have a lot in common. Speakers: - Gabriel Scherer (INRIA Paris-Saclay) - Bahareh Afshari (University of Gothenburg) - Herman Geuvers (Nijmegen & Eindhoven University) - Iris van der Giessen (Utrecht University) - Matteo Acclavio (Universit? Roma Tre) 3. On the nature of proofs December 7, 4 pm (CET) The developments of logic, and of proof theory in particular, have lead us to look at proofs primarily through the lens of various formal systems, such as natural deduction, sequent calculus, tableaux, proof nets etc. Yet, is it possible to investigate the nature of proofs, their identity conditions, their relations with computation and with meaning in a direct way, i.e. independently of the choice of a particular formal system? Speakers: - Noam Zeilberger (INRIA Paris-Saclay) - Alberto Naibo (Paris 1 University) - Antonio Piccolomini d'Aragona (Aix-Marseille University) ******************************************************************************* CALL FOR PARTICIPATION: If you wish to attend, please send an e-mail to luca.tranchini at gmail.com or paolo.pistone at uniroma3.it. A link to access the online events will be shared later. -------------- next part -------------- An HTML attachment was scrubbed... URL: From klin at mimuw.edu.pl Mon Jul 11 17:11:47 2022 From: klin at mimuw.edu.pl (Bartek Klin) Date: Mon, 11 Jul 2022 22:11:47 +0100 Subject: [TYPES/announce] CONCUR + FMICS + FORMATS + QUEST + workshops = CONFEST: call for participation Message-ID: <3F0074DC-872A-481A-8D70-1B4043999719@mimuw.edu.pl> CALL FOR PARTICIPATION: CONFEST 2022 ------------------------------ Warsaw, September 12-16, 2022 https://urldefense.com/v3/__https://confest2022.mimuw.edu.pl/__;!!IBzWLUs!VQKLTyYZFrgO04xzx-2cRd_iuFZURSZ6wwvqWBBKJjNqMeQeBYkZnpRcPsQFZhJj6DAwvaDHTCIMRsjyjlTqTUthDulSCJw$ Early registration open until August 7, 2022 ------------------------------ ------ MAIN CONFERENCES: Sep. 13-16 ------ - CONCUR: 33rd International Conference on Concurrency Theory (PC chairs: Bartek Klin, S?awomir Lasota, Anca Muscholl) - FMICS: 27th International Conference on Formal Methods for Industrial Critical Systems (PC chairs: Jan Friso Groote, Marieke Huisman) - FORMATS: 20th International Conference on Formal Modeling and Analysis of Timed Systems (PC chairs: Sergiy Bogomolov, David Parker) - QEST: 19th International Conference on Quantitative Evaluation of SysTems (PC chairs: Erika ?brah?m, Marco Paolieri) ------ INVITED SPEAKERS ------ * CONCUR: - Wojciech Czerwi?ski (Warsaw University) - Philippa Gardner (Imperial College London) - Rupak Majumdar (Max Planck Institute for Software Systems) - Sergio Rajsbaum (Universidad Nacional Autonoma de Mexico) * FMICS: - Sven Schewe (Liverpool University) - Bas Luttik (Eindhoven UT) * FORMATS: - Thao Dang (CNRS & Universit? Grenoble Alpes) - Jo?l Ouaknine (Max Planck Institute for Software Systems) * QEST: - Jane Hillston (University of Edinburgh) - Marta Kwiatkowska (University of Oxford) ------ SATELLITE WORKSHOPS: Sep. 12 -------- - EXPRESS/SOS: 29th Expressivenes in Concurrency / 19th Structural Operational Semantics (PC chairs: Valentina Castiglioni, Claudio Antares Mezzina) - TRENDS: 11th IFIP WG 1.8 Workshop on Trends in Concurrency Theory (chairs: Pedro D'Argenio, Ana Sokolova) - SNR: 8th International Workshop on Symbolic-Numeric Methods for Reachability Analysis (chairs: Ashutosh Trivedi, Tarek Raissi) - YR CONCUR: 10th Young Researchers Workshop on Concurrency Theory (chairs: Wojciech Czerwi?ski, Sophia Knight) ------- FINANCIAL SUPPORT --------- We offer a number of grants for students and young researchers to cover the conference fee and accommodation in Warsaw; for details see https://urldefense.com/v3/__https://confest2022.mimuw.edu.pl/grants-info/__;!!IBzWLUs!VQKLTyYZFrgO04xzx-2cRd_iuFZURSZ6wwvqWBBKJjNqMeQeBYkZnpRcPsQFZhJj6DAwvaDHTCIMRsjyjlTqTUthLvEJ6I8$ . ------- CITY AND HOST INSTITUTION -------- Warsaw is the capital of Poland, and a vibrant centre of art, science, business, culture and tourism. Iconic places to visit in Warsaw include the Old Town (UNESCO World Heritage Site), the ?azienki Royal Park, and museums such as the POLIN Museum of the History of Polish Jews, the Warsaw Uprising Museum, and the Royal Palace at Wilan?w. The conference will be hosted by Warsaw University. --------- SAFETY ISSUES ----------- CONFEST 2022 will be an in-person event, and we hope that almost all participants will be physically present. However, some support for online presence will be provided for those participants who cannot attend due to pandemic restrictions. From Coen.De.Roover at vub.be Tue Jul 12 06:39:49 2022 From: Coen.De.Roover at vub.be (Coen DE ROOVER) Date: Tue, 12 Jul 2022 10:39:49 +0000 Subject: [TYPES/announce] Summer School on Security Testing and Verification, 20-21-22 September, Leuven, Belgium Message-ID: <52F2E21B-3FFC-4F1B-BCC6-7F32C5C5E1B1@vub.be> ====================================================================================== Summer School on Security Testing and Verification 20-21-22 September, Leuven, Belgium https://urldefense.com/v3/__https://cybersecurity-research.be/summer-school-security-testing-and-verification-2022__;!!IBzWLUs!Vb4MKoqVf4yclKy-zn1CnoZbBUWfA2LN3yWe-fWH1BtljgQcDI4aWqvehpqZ1LuVROlDGNqnYC4VXB4z22subL4-R5WcL9-amXYoUW04$ ====================================================================================== The Vrije Universiteit Brussel and KU Leuven are pleased to announce the 1st Summer School on Security Testing and Verification. It is aimed at researchers and PhD students who are interested in the fields of: - static and dynamic security testing - software verification - security by design - machine learning for vulnerability detection and more. The 3-day program is taught in English and is organised on the KU Leuven campus, in Heverlee (Belgium). Participants will receive a certificate of attendance. The preliminary list of lecturers is as follows: - Prof. Dr. Eric Bodden, Paderborn University, Germany - Prof. Dr. Amin Timany, Aarhus University, Denmark - Prof. Dr. Mathy Vanhoef, KU Leuven, Belgium - Prof. Dr. Fabio Palomba, University of Salerno, Italy - Prof. Dr. Riccardo Scandariato, Hamburg University of Technology, Germany - Dr. Koen Yskout, KU Leuven, Belgium More information is available on the website: https://urldefense.com/v3/__https://cybersecurity-research.be/summer-school-security-testing-and-verification-2022__;!!IBzWLUs!Vb4MKoqVf4yclKy-zn1CnoZbBUWfA2LN3yWe-fWH1BtljgQcDI4aWqvehpqZ1LuVROlDGNqnYC4VXB4z22subL4-R5WcL9-amXYoUW04$ TUITION FEE 200? : early bird fee, register before 31 July 300? : register as of 1 August The tuition fee includes all the classes and course materials, lunches, coffee breaks, and social dinner. Accommodation is not included. REGISTRATION PROCESS To apply for the summer school, please send summerschool-stv at cs.kuleuven.be a cover letter with your motivation and background details (500 words max), as well as your resume and a recommendation letter (PDFs only). If your application is accepted, you?ll receive instructions on how to proceed with the payment. CO-CHAIRS Prof. Dr. Coen De Roover, Vrije Universiteit Brussel, Belgium Prof. Dr. Bart Jacobs, KU Leuven, Belgium For more information: summerschool-stv at cs.kuleuven.be https://urldefense.com/v3/__https://cybersecurity-research.be/summer-school-security-testing-and-verification-2022__;!!IBzWLUs!Vb4MKoqVf4yclKy-zn1CnoZbBUWfA2LN3yWe-fWH1BtljgQcDI4aWqvehpqZ1LuVROlDGNqnYC4VXB4z22subL4-R5WcL9-amXYoUW04$ From tobias.wrigstad at it.uu.se Thu Jul 14 11:08:27 2022 From: tobias.wrigstad at it.uu.se (Tobias Wrigstad) Date: Thu, 14 Jul 2022 15:08:27 +0000 Subject: [TYPES/announce] Fully funded PhD position on efficient and provably correct execution environments at Uppsala University Message-ID: <79E09172-DE46-43D1-8B22-56B5FB5E2983@it.uu.se> Dear all, We are currently looking for Ph.D. students interested in programming languages and software engineering research to join the Programming Languages group at Uppsala University to conduct research on a new programming language developed as part of an industry collaboration. The project focuses on predictable performance, type safety, memory safety, concurrency safety, memory management and programming models for concurrent programming. We are especially looking for applicants who are interested in systems programming, type systems, programming language semantics, program verification, compilers, theorem proving and implementation of runtime systems. Swedish PhD positions run for 5 years including 1 year of teaching spread evenly over the 5 years. Potential research topics explored during the course of the project may include for example efficient, novel and provably correct algorithms for various aspects related to memory management and scheduling, consensus protocols, memory leak detection, gradual verification of programs, debuggers for new concurrency protocols, etc. Start date The start date is negotiable. Contact Professor Tobias Wrigstad (https://urldefense.com/v3/__https://wrigstad.com__;!!IBzWLUs!XphMWO9M5adc1HWEQxcAGb44xFpnfiHZFMtRneeWvl9wq3IDZ4bPooa7LfNDEqRyWPrLliWwepDYFi_TODNIJDxoebdZAGJIymhCg9QXQQ$ ) tobias.wrigstad at it.uu.se Requirements Candidates should have a Master of Science in Computer Science, Computer Engineering, or equivalent. Additional qualifications Experience with systems programming, runtimes, logic, theorem proving, programming languages, and compilers. Additional details and instructions for applying https://urldefense.com/v3/__https://www.uu.se/en/about-uu/join-us/details/?positionId=523769__;!!IBzWLUs!XphMWO9M5adc1HWEQxcAGb44xFpnfiHZFMtRneeWvl9wq3IDZ4bPooa7LfNDEqRyWPrLliWwepDYFi_TODNIJDxoebdZAGJIymicYkQ17w$ The position is fully funded, and the successful candidate will enjoy a competitive salary, paid leave, pension benefits, free health care after a small co-payment, etc. Potential candidates are very welcome to contact me for questions. ?Tobias 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!XphMWO9M5adc1HWEQxcAGb44xFpnfiHZFMtRneeWvl9wq3IDZ4bPooa7LfNDEqRyWPrLliWwepDYFi_TODNIJDxoebdZAGJIymhJ1TM2rQ$ 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!XphMWO9M5adc1HWEQxcAGb44xFpnfiHZFMtRneeWvl9wq3IDZ4bPooa7LfNDEqRyWPrLliWwepDYFi_TODNIJDxoebdZAGJIymhfaqIhqw$ From kameyama at acm.org Tue Jul 12 13:21:24 2022 From: kameyama at acm.org (Yukiyoshi Kameyama) Date: Wed, 13 Jul 2022 02:21:24 +0900 Subject: [TYPES/announce] GPCE 2022 - Call for Papers Message-ID: ------------------------------------------------------------------------------- GPCE 2022: 21st International Conference on Generative Programming: Concepts & Experiences December 5-7, 2022 (co-located with SPLASH) Auckland, New Zealand with hybrid sessions https://urldefense.com/v3/__https://conf.researchr.org/home/gpce-2022/__;!!IBzWLUs!U_B_iDPwONH2fkloOpCGhGMZDaX2iuaz5wWBtitGUKHdHt10f6qaU1Bow1ieuxFeLOWMkVmb-RnqK4ABohcjnBZCzCWXbg$ ------------------------------------------------------------------------------- News: 1. GPCE will be HYBRID ? in-person and online presentations are allowed. 2. GPCE and SLE will have a joint program as in the previous years. 3. Submission site (https://urldefense.com/v3/__https://gpce2022.hotcrp.com/__;!!IBzWLUs!U_B_iDPwONH2fkloOpCGhGMZDaX2iuaz5wWBtitGUKHdHt10f6qaU1Bow1ieuxFeLOWMkVmb-RnqK4ABohcjnBY_QkYdMw$ ) is now open. - Abstract submission 8 August (Mon) - Paper submission 12 August (Fri) --------------------------- 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 5 December (Mon) - 7 December (Wed) 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!U_B_iDPwONH2fkloOpCGhGMZDaX2iuaz5wWBtitGUKHdHt10f6qaU1Bow1ieuxFeLOWMkVmb-RnqK4ABohcjnBY_QkYdMw$ 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!U_B_iDPwONH2fkloOpCGhGMZDaX2iuaz5wWBtitGUKHdHt10f6qaU1Bow1ieuxFeLOWMkVmb-RnqK4ABohcjnBbZ1KwhVw$ ). --------------------------- 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 leonidas at umd.edu Wed Jul 13 13:07:03 2022 From: leonidas at umd.edu (Leonidas Lampropoulos) Date: Wed, 13 Jul 2022 13:07:03 -0400 Subject: [TYPES/announce] Soliciting nominations for the POPL 2023 Artifact Evaluation Committee Message-ID: TLDR: Nominate students, postdocs, and researchers for the POPL 2023 Artifact Evaluation Committee by July 29, at https://urldefense.com/v3/__https://forms.gle/L7dDGPNcToGpDX1eA__;!!IBzWLUs!R7rqt-_oe7Pk5ql_1kgUIvJGMdz4HYpVtG9HKzumTzS5EdtGQPIa7Xp-9nmYomZg5tS8G45M9Ly5R3Zpi-NUembNqTcS7OGU$ . For the ninth year, POPL is creating an Artifact Evaluation Committee (AEC) to promote repeatable experiments in the POPL community ( https://urldefense.com/v3/__https://www.artifact-eval.org/__;!!IBzWLUs!R7rqt-_oe7Pk5ql_1kgUIvJGMdz4HYpVtG9HKzumTzS5EdtGQPIa7Xp-9nmYomZg5tS8G45M9Ly5R3Zpi-NUembNqQXOTD4k$ ). Last year, 57% of the accepted papers submitted artifacts. We are proud to announce an open call for nominations of senior graduate students, postdocs, or research community members to serve on the POPL 2023 AEC. We encourage self-nominations from anyone interested in participating in the artifact evaluation process. Participation in the AEC can provide useful insight into the value of artifacts and the process of artifact evaluation, and also helps to establish community norms for artifacts. We particularly encourage graduate students to serve on the AEC. Qualified graduate students are often in a much better position than many researchers to handle the diversity of systems expectations we will encounter. In addition, these graduate students represent the future of the community, so involving them in this process early will help push this process forward. The work of the AEC will be done between September 27 and November 2, so we are looking for people who are available during that time. Please fill out this nomination form for each nominee by July 29, 2022: https://urldefense.com/v3/__https://forms.gle/L7dDGPNcToGpDX1eA__;!!IBzWLUs!R7rqt-_oe7Pk5ql_1kgUIvJGMdz4HYpVtG9HKzumTzS5EdtGQPIa7Xp-9nmYomZg5tS8G45M9Ly5R3Zpi-NUembNqTcS7OGU$ . Please note that in the past we have had more nominees than slots on the AEC, and so not all nominees will be able to join the AEC. We look forward to your nominations! Please let us know if you have any questions. Thank you for your help! Mukund Raghothaman and Leonidas Lampropoulos POPL 2023 AEC Chairs -------------- next part -------------- An HTML attachment was scrubbed... URL: From ifl21.publicity at gmail.com Fri Jul 15 05:38:49 2022 From: ifl21.publicity at gmail.com (Pieter Koopman) Date: Fri, 15 Jul 2022 02:38:49 -0700 Subject: [TYPES/announce] 2nd CFP - IFL22 - The 34th Symposium on Implementation and Application of Functional Languages Message-ID: *CALL FOR PAPERS: * The 34th Symposium on Implementation and Application of Functional Languages (IFL 2022) *Submission and registration are open.* See https://urldefense.com/v3/__https://ifl22.github.io/__;!!IBzWLUs!UmRuAThjuDa5zS7MGQhmAw8CKNo69beU91GEkga_qH-KV6TW9r-0ddY2G11zTJGMJZIKQzq9pnzbf4BLodbYhXRwxumz4I7-U704P7Wo$ . Copenhagen, August 31st-September 2nd, 2022 *Important dates * Draft paper submission: August 7th, 2022 Draft paper notification: August 9th, 2022 Early registration deadline: August 12th, 2022 Late registration deadline: September 2nd, 2022 Symposium: August 31st-September 2nd, 2022 (3 days) *Scope * The goal of the IFL symposia is to bring together researchers actively engaged in the implementation and application of functional and function-based programming languages. IFL 2022 will be a venue for researchers to present and discuss new ideas and concepts, work in progress, and publication-ripe results related to the implementation and application of functional languages and function-based programming. Topics of interest to IFL include, but are not limited to: * language concepts * type systems, type checking, type inferencing * compilation techniques * staged compilation * run-time function specialization * run-time code generation * partial evaluation * abstract interpretation * metaprogramming * generic programming * automatic program generation * array processing * concurrent/parallel programming * concurrent/parallel program execution * embedded systems * web applications * embedded domain specific languages * security * novel memory management techniques * run-time profiling performance measurements * debugging and tracing * virtual/abstract machine architectures * validation, verification of functional programs * tools and programming techniques * industrial applications *Submissions and peer-review * Following IFL tradition, IFL 2022 will use a post-symposium review process to produce the formal proceedings. Before the symposium authors submit draft papers. These draft papers will be screened by the program chair to make sure that they are within the scope of IFL. The draft papers will be made available to all participants at the symposium. Each draft paper is presented by one of the authors at the symposium. Notice that it is a requirement that accepted draft papers are presented physically at the symposium. After the symposium, a formal review process will take place, conducted by the program committee. Reviewing is single blind. There will be at least 3 reviews per paper. The reviewers have 6 weeks to write their reviews. For the camera-ready version the authors can make minor revisions which are accepted without further reviewing. Contributions submitted for the draft paper deadline must be between two and twelve pages long. For submission details, please consult the IFL 2022 website at https://urldefense.com/v3/__https://ifl22.github.io/__;!!IBzWLUs!UmRuAThjuDa5zS7MGQhmAw8CKNo69beU91GEkga_qH-KV6TW9r-0ddY2G11zTJGMJZIKQzq9pnzbf4BLodbYhXRwxumz4I7-U704P7Wo$ . *Where * IFL 2022 will be held physically in Copenhagen, Denmark, arranged by DIKU at the University of Copenhagen. See the IFL 2022 website at https://urldefense.com/v3/__https://ifl22.github.io/__;!!IBzWLUs!UmRuAThjuDa5zS7MGQhmAw8CKNo69beU91GEkga_qH-KV6TW9r-0ddY2G11zTJGMJZIKQzq9pnzbf4BLodbYhXRwxumz4I7-U704P7Wo$ for more information. [image: beacon] -------------- next part -------------- An HTML attachment was scrubbed... URL: From asampson at cs.cornell.edu Fri Jul 15 18:11:42 2022 From: asampson at cs.cornell.edu (Adrian Sampson) Date: Fri, 15 Jul 2022 18:11:42 -0400 Subject: [TYPES/announce] Nominate the next editor-in-chief of PACMPL Message-ID: <00C3D6FE-9B9B-4CB0-95C1-FE8FF3D2FA1C@cs.cornell.edu> # Call for Nominations: Editor-in-Chief, Proceedings of the ACM on Programming Languages The term of the current Editor-in-Chief (EiC) of the Proceedings of the ACM on Programming Languages (PACMPL) is coming to an end, and the ACM Publications Board has set up a nominating committee to assist the Board in selecting the next EiC. 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. The journal operates in close collaboration with the Special Interest Group on Programming Languages (SIGPLAN) and is committed to making high-quality peer-reviewed scientific research in programming languages free of restrictions on both access and use. Nominations, including self nominations, are invited for a three-year term as PACMPL EiC, beginning on November 15, 2022. The EiC appointment may be renewed at most one time. This is an entirely voluntary, unpaid position. Appointed by the ACM Publications Board, Editors-in-Chief (EiCs) of ACM journals are delegated full responsibility for the editorial management of the journal consistent with the journal's charter and general ACM policies. The appointed EiC is assisted by the PACMPL Advisory Board (AB), which is consulted about issues such as publication policies, addition of new issues, interaction with venues, format of PACMPL calls for papers, etc. The AB also selects the new EiC. A complete list of responsibilities is found in the ACM Volunteer Editors Position Descriptions . Additional information can be found in the following documents: * Rights and Responsibilities in ACM Publishing: https://urldefense.com/v3/__https://www.acm.org/publications/policies/roles-and-responsibilities__;!!IBzWLUs!UAE1oZWl5fMqg-liwf1gmCA-ynqFGGHDhpkI8e6lNJu-0sshSkEwae-c58GulPEqahCLsjDZZFTaOR9T1LhogbXGCIiMoR3pzjy6PQ$ * ACM's Evaluation Criteria for Editors-in-Chief: https://urldefense.com/v3/__http://www.acm.org/publications/policies/evaluation/__;!!IBzWLUs!UAE1oZWl5fMqg-liwf1gmCA-ynqFGGHDhpkI8e6lNJu-0sshSkEwae-c58GulPEqahCLsjDZZFTaOR9T1LhogbXGCIiMoR0iMsqDkQ$ Nominations should include a curriculum vitae along with a brief statement of why the nominee should be considered. Self-nominations are encouraged and should include a statement of the candidate's vision for the future development of PACMPL. The deadline for submitting nominations is Friday, August 19, 2022, although nominations will continue to be accepted until the position is filled. Please send all nominations to the nominating committee chair, Jeff Foster . The search committee is the current Advisory Board of PACMPL: * Jeff Foster (Tufts University), Chair * Giuseppe Castagna (Universit? Paris Cit? & CNRS) * Jeremy Gibbons (University of Oxford) * Cristina Lopes (University of California, Irvine) * Anders M?ller (Aarhus University) * Jens Palsberg (University of California, Los Angeles) From duongtd at jaist.ac.jp Tue Jul 12 04:21:53 2022 From: duongtd at jaist.ac.jp (TRAN Dinh Duong) Date: Tue, 12 Jul 2022 17:21:53 +0900 Subject: [TYPES/announce] International Workshop on Formal Analysis and Verification of Post-Quantum Cryptographic Protocols 2022: Call for Papers Message-ID: CALL FOR PAPERS International Workshop on Formal Analysis and Verification of Post-Quantum Cryptographic Protocols 2022 (FAVPQC 2022) https://urldefense.com/v3/__https://favpqc2022.gitlab.io/__;!!IBzWLUs!S2p4ITczLBbnOFaBmy9Z26E8dFrvuyFt_rUJHLKTiQccaLWNdWvtnnXZflZl_ZaV0KaWDRQLnNn9xEWkSi3xYE-ooj8nQhq8hJo$ This even is an ICFEM 2022 (https://urldefense.com/v3/__http://maude.ucm.es/ICFEM22/__;!!IBzWLUs!S2p4ITczLBbnOFaBmy9Z26E8dFrvuyFt_rUJHLKTiQccaLWNdWvtnnXZflZl_ZaV0KaWDRQLnNn9xEWkSi3xYE-ooj8nQ4LIZhc$ ) satellite workshop, which will be held in Madrid, Spain on October 24, 2022. It is known that the most popular public-key cryptosystems used today will become insecure once sufficient strong quantum computers become available. To prepare for information security in the quantum computing era, post-quantum cryptosystems that are resistant to attacks from quantum computers have been built as replacements for the classical ones. Security verification of those post-quantum cryptographic protocols has got extensive attention from cryptography and security research groups in recent years. Due to Covid-19, the workshop may be held in a hybrid style or completely virtual. TOPICS OF INTEREST Authors are invited to submit papers describing original and unpublished work somehow related to formal analysis and verification of post-quantum cryptographic protocols. Topics of interest include, but are not limited to: - Post-quantum cryptosystems - Post-quantum cryptographic protocols - Logics of quantum computing/algorithms/programs - Formal analysis/verification of those related to the above-mentioned PUBLICATION Proceedings shall be submitted to CEUR-WS.org for online publication. Therefore, authors are supposed to use the CEUR-ART template style for preparing papers. In addition to regular papers (12 - 16 pages), authors are also recommended to submit short papers (6 - 8 pages), such as work-in-progress ones and tool demonstration ones. Papers submitted as regular papers may be accepted as short papers. We plan a joint special issue of a reputable journal together with the International Conference on Practical and Theoretical Aspects of Logic, Cyber Security and Cryptography 2022. The authors of a selected subset of accepted papers will be invited to submit extended versions of their papers to the special issue. PAPER SUBMISSIONS Submissions must be uploaded to the following EasyChair website: https://urldefense.com/v3/__https://easychair.org/conferences/?conf=favpqc2022__;!!IBzWLUs!S2p4ITczLBbnOFaBmy9Z26E8dFrvuyFt_rUJHLKTiQccaLWNdWvtnnXZflZl_ZaV0KaWDRQLnNn9xEWkSi3xYE-ooj8nIOhMdrU$ IMPORTANT DATES - Paper submission due: September 15, 2022 (AoE) - Notification: September 30, 2022 - Camera-ready: October 14, 2022 PROGRAM COMMITTEE CO-CHAIRS - Sedat Akleylek, Ondokuz Mayis University, Turkey (co-chair) - Santiago Escobar, Polytechnic University of Valencia, Spain (co-chair) - Kazuhiro Ogata, Japan Advanced Institute of Science and Technology, Japan (co-chair) - Ayoub Otmani, University of Rouen Normandie, France (co-chair) TBA for the other Program Committee members. PUBLICITY CHAIR - Duong Dinh Tran, Japan Advanced Institute of Science and Technology, Japan (duongtd at jaist.ac.jp) -------------- next part -------------- An HTML attachment was scrubbed... URL: From aplatzer at cs.cmu.edu Tue Jul 12 04:11:36 2022 From: aplatzer at cs.cmu.edu (Andre Platzer) Date: Tue, 12 Jul 2022 10:11:36 +0200 Subject: [TYPES/announce] PhD Student or Postdoc Position in Alexander von Humboldt Professor group Message-ID: The group of Andr? Platzer, the Alexander von Humboldt Professor for Logic of Autonomous Dynamical Systems, in the Department of Informatics at KIT is recruiting a PhD student or postdoc (TVL E13, full-time). Our research develops the logical foundations for cyber-physical systems and practical theorem proving tools for analyzing and correctly building such systems, including the theorem prover KeYmaera X, verified runtime monitoring ModelPlex, verified compilation, and verified safe machine learning techniques. Our techniques are used to analyze the safety of autonomous cars, airplanes and collision avoidance protocols in aerospace applications, robotics, and train control. Key requirements for successful applications: - Strong demonstrable commitment to research. - Strong background in logic, formal methods, theorem proving, or programming language theory. - Strong background in mathematics, physics, or engineering. - Excellent M.Sc. degree in computer science, mathematics or related subjects. - Proficiency in English, excellent speaking and writing skills. - Experience in software development projects is a plus. The successful candidate is able to quickly get into new research areas and will be responsible for actively engaging in novel research questions, publishing and communicating research results, advising junior students, assisting in research grants, implementation of research results in formal methods tools, and demonstrating their applicability in cyber-physical systems applications. Faculty / Division: Alexander von Humboldt Professor on Logic of Autonomous Dynamical Systems Institute: Institute of Information Security and Dependability (KASTEL) Starting Date: Immediately Contact Person: Andr? Platzer https://urldefense.com/v3/__https://lfcps.org/__;!!IBzWLUs!TdwbFmJVttuZ5sQYz1h8Dnz1e1xPtu3Vm_49jcGKTP2nguC_zJhwUc8MBlCh9NhYCx4wSDKjVIVZm1_GrhS8Xmc5PX1ao64e_lM$ From fabian.mUehlbOeck at ist.ac.at Mon Jul 18 06:35:20 2022 From: fabian.mUehlbOeck at ist.ac.at (=?utf-8?B?RmFiaWFuIE3DnEhMQsOWQ0s=?=) Date: Mon, 18 Jul 2022 10:35:20 +0000 Subject: [TYPES/announce] SPLASH 2022 Doctoral Symposium - Call for Submissions In-Reply-To: <97f4e17fd1dd46da8eeaa3a290c68b8f@ist.ac.at> References: <97f4e17fd1dd46da8eeaa3a290c68b8f@ist.ac.at> Message-ID: Call for Submissions SPLASH Doctoral Symposium The SPLASH Doctoral Symposium (https://urldefense.com/v3/__https://2022.splashcon.org/track/splash-2022-Doctoral-Symposium__;!!IBzWLUs!TjXwb0jx39BFPCPmvYN6a3m82k6S21yHO5JsNIkK3JcIkmZievxMsSds20ZKZyg2SOATXt8_keTfPNl70xlgcZjDDRyZTPbItMm4UYECNTI$ ) provides students with useful guidance for completing their dissertation research and beginning their research careers. The symposium will provide an interactive forum for doctoral students who have progressed far enough in their research to have a structured proposal but will not be defending their dissertation in the next 12 months. We invite students to submit a structured proposal of their dissertation research. At the symposium, presentations will consist of the following: - A two-minute overview stating the most critical issues of the research (the ?elevator talk?). - A separate (strictly-timed) presentation slot for the description of the proposer?s research. The duration of this slot should be around 30-40 minutes, with 1/3 of the time dedicated to questions from the committee and audience. The exact duration will depend on the number of accepted presentations and will be announced in due time. Submissions should consist of at most three pages (excluding bibliography) in the double-column "sigplan" acmart style (https://urldefense.com/v3/__https://www.sigplan.org/Resources/Author/__;!!IBzWLUs!TjXwb0jx39BFPCPmvYN6a3m82k6S21yHO5JsNIkK3JcIkmZievxMsSds20ZKZyg2SOATXt8_keTfPNl70xlgcZjDDRyZTPbItMm4893Fh4g$ ), detailing the dissertation research's motivation, problem, approach, and methodology. Further details can be found at https://urldefense.com/v3/__https://2022.splashcon.org/track/splash-2022-Doctoral-Symposium*Call-for-Submissions__;Iw!!IBzWLUs!TjXwb0jx39BFPCPmvYN6a3m82k6S21yHO5JsNIkK3JcIkmZievxMsSds20ZKZyg2SOATXt8_keTfPNl70xlgcZjDDRyZTPbItMm4A3ptpZM$ . The submission deadline is August 1, 2022, 23:59 anywhere on Earth. In addition, advisor must also send a brief statement of your dissertation progress to date and a statement of recommendation to mailto:fabian.muehlboeck at ista.ac.at by August 15, 2021, 23:59 AoE. Please have your advisor use the following e-mail subject: [SPLASH 2022 Doctoral Symposium Recommendation for first-name last-name]. The Doctoral Symposium is primarily an in-person event. Special consideration may be given to participants who cannot physically attend the symposium. As part of the application process, students will need to specify whether (and if, why) they intend to participate remotely. Important Dates (AoE): Submission Deadline: August 1, 2022 Advisor Statement Deadline: August 15, 2022 Student Notification: September 3, 2022 (tentative) Doctoral Symposium @ SPLASH: December 6, 2022 (tentative) From jonathan.aldrich at cs.cmu.edu Mon Jul 18 09:37:49 2022 From: jonathan.aldrich at cs.cmu.edu (Jonathan Aldrich) Date: Mon, 18 Jul 2022 09:37:49 -0400 Subject: [TYPES/announce] Call for Papers: Eelco Visser Commemorative Symposium Message-ID: Eelco Visser Commemorative Symposium 5 April 2023, Delft, The Netherlands https://urldefense.com/v3/__https://symposium.eelcovisser.org__;!!IBzWLUs!RKcxYjqGRHbIOaQtQPSgYFweBHABP4CjpKfsjblX-IcQ8RnKHgoa-RtucASnvgjEgJGacUUNFKB2lzfz38mquGjy63yZJg-NtvLrpXNpqnhx$ Call for Papers A commemorative symposium for Eelco Visser is to be held on the first anniversary of his untimely passing away in April 2022. It will bring together colleagues from various communities, with presentations of papers on topics related to his research and other academic activities. Topics of interest include, but are not limited to: - Language engineering - Program transformation - Language workbenches - Declarative language specification - Name binding and scope graphs - Type soundness and intrinsically-typed interpreters - Language specification testing - Language implementation generation - Domain-specific programming languages - DSLs for software deployment - DSLs for web application development - Tool-supported programming education Important dates: - Friday 30 September 2022: Declaration of intent to submit - Friday 28 October 2022: Paper submission deadline - Monday 28 November 2022: Notifications - Wednesday 5 April 2023: Symposium -------------- next part -------------- An HTML attachment was scrubbed... URL: From emilio.tuosto at gssi.it Mon Jul 18 12:07:07 2022 From: emilio.tuosto at gssi.it (Emilio Tuosto) Date: Mon, 18 Jul 2022 18:07:07 +0200 Subject: [TYPES/announce] PhD Scholarship on Blockchains. Deadline 26/08/22 Message-ID: A fully funded PhD scholarship on the analysis and verification of smart contracts with behavioural types is available in the context of the Italian National PhD School on Blockchain and Distributed Ledger Technology (https://urldefense.com/v3/__https://isas.unicam.it/dni/blockchain-and-DLT__;!!IBzWLUs!WPGRGCBVI4zzgNcyMk0kzAqDam-Fe3YYazZvur6VuEo3Wy3CMNNznt6x4UMqGlnZOIgbk03mPPHjXaZe7dueigkObhKVOnZI2XDHnQ$ ) ** Application deadline is August 26, 2022 ** Candidate are eligible provided that they will be awarded an MSc degree by November 30, 2022. More information and details about the application process are available at https://urldefense.com/v3/__https://www.unicam.it/bandi/bando-50170-del-15-luglio-2022__;!!IBzWLUs!WPGRGCBVI4zzgNcyMk0kzAqDam-Fe3YYazZvur6VuEo3Wy3CMNNznt6x4UMqGlnZOIgbk03mPPHjXaZe7dueigkObhKVOnb887vg0g$ . The PhD School on Blockchain and Distributed Ledger Technology is a new PhD program jointly managed by 22 research institutions and with administrative headquarters at the University of Camerino. The successful candidate will join the computer science department of the Gran Sasso Science Institute, recently ranked the first computer science department in the Italian evaluation exercise (https://urldefense.com/v3/__https://www.anvur.it/attivita/vqr/vqr-2015-2019/rapporto-finale-anvur-e-rapporti-di-area/sezione-rapporti-di-area/__;!!IBzWLUs!WPGRGCBVI4zzgNcyMk0kzAqDam-Fe3YYazZvur6VuEo3Wy3CMNNznt6x4UMqGlnZOIgbk03mPPHjXaZe7dueigkObhKVOnb44h_Z-w$ ). Perspective applicants can contact Maurizio Murgia (maurizio.murgia at gssi.it) or Emilio Tuosto (emilio.tuosto at gssi.it). -- ************************************************************ Emilio Tuosto Gran Sasso Science Institute Department of Computer Science ORCID: 0000-0002-7032-3281 Viale F. Crispi, 7 - 67100 L'Aquila (Italy) Office: Palazzo Mariani P1-N Phone: +39 0862 428 0312 homepage -> https://urldefense.com/v3/__https://cs.gssi.it/emilio.tuosto/__;!!IBzWLUs!WPGRGCBVI4zzgNcyMk0kzAqDam-Fe3YYazZvur6VuEo3Wy3CMNNznt6x4UMqGlnZOIgbk03mPPHjXaZe7dueigkObhKVOnbUpgNIag$ ************************************************************ From sasander at me.com Mon Jul 18 05:43:53 2022 From: sasander at me.com (Sam Sanders) Date: Mon, 18 Jul 2022 11:43:53 +0200 Subject: [TYPES/announce] Applied Proof Theory 2022 (APT22) in Pescara, Italy (Aug 29-Sept 2, 2022). References: <1DF291A6-15AD-45A7-AC27-BCDF6E94489F@icloud.com> Message-ID: Dear All, We are organising a conference on applied proof theory from 29th August to 2nd September 2022 in Pescara, Italy. https://urldefense.com/v3/__https://www.sci.unich.it/apt22/__;!!IBzWLUs!S9YwVOZDbobYCgl7J5-K8ZtYSsUknVv_4kSYlxYhLj1Wg6xH79PYTs2k-j56TLnhNAKTrqWuVIN6IKnNFhnk0-bTc7CW$ The meeting will take place 'in person', with some online components depending on the health/travel situation. Registration will remain open until 25th August. The topics of APT22 are as follows: ? proof mining, ? program extraction from proofs, ? proof theory in computer science logic, ? proof theory of non-classical logics, ? dynamical methods, ? related areas. Talks presented at APT22 will include: ? Luca Aceto, The importance of being negative: Non-finite axiomatisability results in process algebra ? Matthias Baaz, The proof-theoretic analysis of incorrect proofs ? Stefano Berardi, An Arithmetical Hierarchy of the Law of ExcludedMiddle and Related Principles ? Fernando Ferreira, The abstract type of the real numbers ? Anton Freund, Proof mining nonexpansive operators in Banach spaces ? Makoto Fujiwara, Proof interpretations on finite-type arithmetic and uniform provability in reverse mathematics ? Hajime Ishihara, Place holders ? Annika Kanckos, The No-counterexample Interpretation in an Invertible Sequent Calculus ? Ulrich Kohlenbach, Proof Theory of Rectangular Operators and the Brezis-Haraux Theorem ? Genarro L?pez-Acedo, Ulrich insight into the lion-man game ? Marco Maggesi, Building proof and countermodels in HOL Light of the provability logic GL ? Stefan Neuwirth, Kreisel and Lorenzen on proofs of the Cantor-Bendixson theorem ? Andrea Nicolae, Instances of proof mining in optimization theory ? Pedro Pinto, Halpern and Mann iterative schemes: A path towards generalization ? Nicholas Pischke, Proof Mining and Monotone Operator Theory ? Thomas Powell, Personal reflections on becoming an applied proof theorist, and thoughts for the future ? Matteo Tesi, On the embedding of intuitionistic logic in the logic of provability GL ? Henri Towsner, Proof Mining in Differential Algebra ? Benno van den Berg, Applicative lattices for modified realizability ? Jan von Plato, G?del, Barr's theorem, and the logic of provability: account of an anticipation The organisers: Gianluca Amato Dipartimento di Economia Universit? degli Studi ?G. d'Annunzio?, Italy Sam Sanders Institute for Philosophy II Ruhr-Universit?t Bochum, Germany Peter Schuster Dipartimento di Informatica Universit? degli Studi di Verona, Italy From xsi at cs.mcgill.ca Tue Jul 19 04:08:39 2022 From: xsi at cs.mcgill.ca (Xujie SI) Date: Tue, 19 Jul 2022 08:08:39 +0000 Subject: [TYPES/announce] =?windows-1252?q?SPLASH_2022_Student_Research_C?= =?windows-1252?q?ompetition_=96_Deadline=3A_July_28th=2C_2022_=28extended?= =?windows-1252?q?=29?= Message-ID: SPLASH 2022 Student Research Competition Call for Submissions Deadline: July 28th, 2022 (extended) https://urldefense.com/v3/__https://2022.splashcon.org/track/splash-2022-SRC__;!!IBzWLUs!TRvjnuV62NdpAgG-zh75Cjm1yH0x2yD4pSH0iXN3299SHufKBMnoHNMeTLKfJ2rSDfxoTGRxiixPVvndk7I5nRrJrj4s6A$ The ACM Student Research Competition (SRC) offers a unique opportunity for undergraduate and graduate students to present their research to a panel of judges and conference attendees at SPLASH. The SRC provides visibility and exposes up-and-coming researchers to computer science research and the research community. This competition also gives students an opportunity to discuss their research with experts in their field, get feedback, and sharpen their communication and networking skills. Eligibility criteria -------------------- Participants must have current student status, either graduate or undergraduate, at the time of the submission deadline. Participants in the SRC must also be current ACM (student) members. Prizes ------ Winners of the three top places in each category receive prizes of $500 for the first place winner, $300 for the second place winner and $200 for the third place winner, respectively. The top three undergraduate and graduate winners receive an award medal and a one-year complimentary ACM student membership with a subscription to ACM's Digital Library. ACM SRC Grand Finals -------------------- First place winners in each category will be invited to participate in the ACM SRC Grand Finals, an online round of competition between first-place SRC winners from different ACM conferences held in 2022. Grand Finals will be judged by an ACM-appointed panel of judges. Winners of the three top Grand Finals places in each category will receive additional prizes of $500 for the first place winner, $300 for the second place winner and $200 for the third place winner, respectively. Winners of the SRC Grand Finals are recognized at the Annual ACM Awards Banquet along with prestigious ACM award winners, including the winner of the Turing Award. -------------- next part -------------- An HTML attachment was scrubbed... URL: From roland.meyer at tu-bs.de Thu Jul 21 10:01:04 2022 From: roland.meyer at tu-bs.de (Roland Meyer) Date: Thu, 21 Jul 2022 16:01:04 +0200 Subject: [TYPES/announce] Vacancies at TU Braunschweig Message-ID: <662268be-83e5-16fb-4487-dd76d135b508@tu-bs.de> The Department of Computer Science at TU Braunschweig offers three professorships related to system analysis and design: Dependable Distributed Systems (rank W2), application deadline July 31: https://urldefense.com/v3/__https://vacancies.tu-braunschweig.de/t1qzg__;!!IBzWLUs!XM_fZdnvtBusm9EzfSi-TYLIFSHLN1Lz4CZtcoDI0JHhF02FkKrIvU5SQ7B6eX0Gpy8LJ8AevVqKc5joy077KWvCaKS7UspIFkV1AYY$ Safety Critical Systems (rank W2 with tenure track to W3), application deadline August 31: https://urldefense.com/v3/__https://vacancies.tu-braunschweig.de/554oo__;!!IBzWLUs!XM_fZdnvtBusm9EzfSi-TYLIFSHLN1Lz4CZtcoDI0JHhF02FkKrIvU5SQ7B6eX0Gpy8LJ8AevVqKc5joy077KWvCaKS7UspINdwPRG0$ Software Systems Engineering (rank W3), application deadline August 31: https://urldefense.com/v3/__https://vacancies.tu-braunschweig.de/3xcwh__;!!IBzWLUs!XM_fZdnvtBusm9EzfSi-TYLIFSHLN1Lz4CZtcoDI0JHhF02FkKrIvU5SQ7B6eX0Gpy8LJ8AevVqKc5joy077KWvCaKS7UspILtNGPIE$ The tenure track position will become permanent given a positive evaluation after five years. Applicants for this position should have been awarded their PhD at most four years ago. The positions at ranks W2 and W3 are permanent. All positions are full-time, part-time appointments may be possible on request. At TU Braunschweig, we aim to increase the share of women in academic positions and therefore particularly welcome applications from women. Where candidates have equivalent qualifications, preference will be given to female candidates. Applications from international scientists are welcome. Where candidates have the same qualifications, preference will be given to disabled candidates. -- Prof. Dr. Roland Meyer TU Braunschweig Institut f?r Theoretische Informatik M?hlenpfordtstr. 23, 346 38106 Braunschweig Phone: +49 (0)531 391 9524 Fax: +49 (0)531 391 9529 Web: https://urldefense.com/v3/__http://www.tcs.cs.tu-bs.de__;!!IBzWLUs!XM_fZdnvtBusm9EzfSi-TYLIFSHLN1Lz4CZtcoDI0JHhF02FkKrIvU5SQ7B6eX0Gpy8LJ8AevVqKc5joy077KWvCaKS7UspILpsSyEo$ From elenatalita at gmail.com Thu Jul 21 11:56:29 2022 From: elenatalita at gmail.com (Elena Di Lavore) Date: Thu, 21 Jul 2022 15:56:29 +0000 Subject: [TYPES/announce] SYCO 9 - 2nd call for submissions - Deadline 1st August Message-ID: ----------------------------------------- CALL FOR SUBMISSIONS NINTH SYMPOSIUM ON COMPOSITIONAL STRUCTURES (SYCO 9) Como, Italy 8-9 September 2022 Submission deadline: Monday 1 August 2022 https://urldefense.com/v3/__https://www.cl.cam.ac.uk/events/syco/9/__;!!IBzWLUs!T-F-_78bAgRSUbYL6H-0HR_BwqVlecO30oJh5K-zZJQsdyidzpJUP9ylDdaFr0bLLeSF_jwa056Q1ztA133J3q5Gm_E5QAeAs9U$ ----------------------------------------- The Symposium on Compositional Structures (SYCO) is an interdisciplinary series of meetings aiming to support the growing community of researchers interested in the phenomenon of compositionality, from both applied and abstract perspectives, and in particular where category theory serves as a unifying common language. Previous SYCO events have been held in Birmingham, Strathclyde, Oxford, Chapman, Leicester and Tallinn. We welcome submissions from researchers across computer science, mathematics, physics, philosophy, and beyond, with the aim of fostering friendly discussion, disseminating new ideas, and spreading knowledge between fields. Submission is encouraged for both mature research and work in progress, and by both established academics and junior researchers, including students. Submissions is easy, with no formatting or page restrictions. The meeting does not have proceedings, so work can be submitted even if it has been submitted or published elsewhere. You could submit work-in-progress, or a recently completed paper, or even a PhD or Masters thesis. While no list of topics could be exhaustive, SYCO welcomes submissions with a compositional focus related to any of the following areas, in particular from the perspective of category theory: - logical methods in computer science, including classical and quantum programming, type theory, concurrency, natural language processing and machine learning; - graphical calculi, including string diagrams, Petri nets and reaction networks; - languages and frameworks, including process algebras, proof nets, type theory and game semantics; - abstract algebra and pure category theory, including monoidal category theory, higher category theory, operads, polygraphs, and relationships to homotopy theory; - quantum algebra, including quantum computation and representation theory; - tools and techniques, including rewriting, formal proofs and proof assistants, and game theory; - industrial applications, including case studies and real-world problem descriptions. ** IMPORTANT DATES ** All deadlines are 23:59 Anywhere on Earth. Submission deadline: Monday 1 August Author notification: Monday 8 August 2022 Symposium dates: Thursday 8 and Friday 9 September 2022 ** SUBMISSION INSTRUCTIONS ** Submissions are by EasyChair, via the SYCO 9 submission page: https://urldefense.com/v3/__https://easychair.org/my/conference?conf=syco9__;!!IBzWLUs!T-F-_78bAgRSUbYL6H-0HR_BwqVlecO30oJh5K-zZJQsdyidzpJUP9ylDdaFr0bLLeSF_jwa056Q1ztA133J3q5Gm_E5m2fsufo$ Submission is easy, with no format requirements or page restrictions. The meeting does not have proceedings, so work can be submitted even if it has been submitted or published elsewhere. Think creatively: you could submit a recent paper, or notes on work in progress, or even a recent Masters or PhD thesis. In the event that more good-quality submissions are received than can be accommodated in the timetable, the programme committee may choose to *defer* some submissions to a future meeting, rather than reject them. Deferred submissions can be re-submitted to any future SYCO meeting, where they will not need peer review, and where they will be prioritised for inclusion in the programme. Meetings will be held sufficiently frequently to avoid a backlog of deferred papers. If you have a submission which was deferred from a previous SYCO meeting, it will not automatically be considered for SYCO 9; you still need to submit it again through EasyChair. When submitting, append the words "DEFERRED FROM SYCO X" to the title of your paper, replacing "X" with the appropriate meeting number. There is no need to attach any documents. ** PROGRAMME COMMITTEE ** Robin Cockett, University of Calgary Elena Di Lavore, Tallinn University of Technology Ross Duncan, University of Strathclyde Robert Furber, University of Edinburgh Amar Hadzihasanovic, Tallinn University of Technology Chris Heunen, University of Edinburgh Alex Kissinger, University of Oxford Martha Lewis, University of Bristol Jade Master, University of Strathclyde Konstantinos Meichanetzidis, University of Leeds Samuel Mimram, ?cole Polytechnique Simona Paoli, University of Aberdeen Mehrnoosh Sadrzadeh, University College London Pawel Sobocinski, Tallinn University of Technology The PC chair is John van de Wetering, Radboud University. ** STEERING COMMITTEE ** Ross Duncan, University of Strathclyde Chris Heunen, University of Edinburgh Dominic Horsman, University of Oxford Aleks Kissinger, University of Oxford Samuel Mimram, ?cole Polytechnique Simona Paoli, University of Aberdeen Mehrnoosh Sadrzadeh, University College London Pawel Sobocinski, Tallinn University of Technology Jamie Vicary, University of Cambridge -------------- next part -------------- An HTML attachment was scrubbed... URL: From maietti at math.unipd.it Thu Jul 21 13:19:59 2022 From: maietti at math.unipd.it (Maria Emilia Maietti) Date: Thu, 21 Jul 2022 19:19:59 +0200 Subject: [TYPES/announce] CCC2022 -September 19-23, 2022- 2nd call for contributions Message-ID: <1000c87b-542c-d27e-f008-ff483c9658bd@math.unipd.it> 2nd CALL FOR? CONTRIBUTIONS: CCC 2022: Continuity, Computability, Constructivity ? From Logic to Algorithms ???????????????? Dedicated to Dieter Spreen on the Occasion of his 75th Birthday Department of Mathematics and?? ONLINE Padova, Italy, September 19-23, 2022 ============================================== Submission link https://urldefense.com/v3/__https://easychair.org/conferences/?conf=ccc20220__;!!IBzWLUs!RkpnVTKqFPJOyY9V4AGofmcWJ9LPYv0t1YoPd0_yTJvMwtq6JgUMSVZS6V2se-ER8EcwWZ5Ldknt-nE5R9VkJjGIMHJ25AVJIAo$ Submission deadline:??? August 16, 2022 Nofication of acceptance:?? August 26, 2022 ==================================================== CCC is a workshop series that brings together researchers applying logical methods to the development of algorithms, with a particular focus on computation with infinite data, where issues of continuity, computability and constructivity play major roles. Specific topics include exact real number computation, computable analysis, effective descriptive set theory, constructive analysis and topology, and related areas. The overall aim is to apply logical methods in these disciplines to provide a sound foundation for obtaining exact and provably correct algorithms for computations with real numbers and other continuous data, which are of increasing importance in safety-critical applications and scientific computation. Participation is welcome in person or online. Previous workshops have been held in Cologne 2009, Trier 2012, Gregynog 2013, Ljubljana 2014, Kochel 2015, Nancy 2017, Faro 2018, Ljubljana 2019, Faro 2020 (online), Birmingham 2021 (online). ===================================================================== Submission Guidelines The workshop invites all contributions relating to computation where issues of continuity, computability and constructivity play major roles. Specific areas of interest include: ??? Exact real number computation ??? Correctness of algorithms on infinite data ??? Computable analysis ??? Complexity of real numbers, real-valued functions, etc. ??? Effective descriptive set theory ??? Domain theory ??? Constructive analysis and topology ??? Constructive foundations ??? Category-theoretic approaches to computation on infinite data ??? Weihrauch degrees ??? Other related areas. Extended abstracts (1-2 pages) should be submitted in pdf format. A post-proceedings volume will be published in the open-access journal Logical Methods in Computer Science. =============================================== Tutorial speakers: ??? Alexander Miquel (Universidad de La Republica, Uruguay) ??? Linda Westrick (Penn State University, USA) Invited speakers: ??? Miko?aj Boja?czyk (Warsaw, Poland) ??? Tatsuji Kawai (JAIST, Japan) ??? Michael Rathjen (Leeds, UK) ??? Andreas Rauh (Oldenburg, Germany) ======================================================== Program Committee ??? Pieter Collins (Maastricht, Netherlands) ??? Achim Jung (Birmingham, UK) ??? Maria Emilia Maietti (Padova, Italy)? (chair) ??? Arno Pauly (Swansea, UK) ??? Alex Simpson (Ljubljana, Slovenia) ??? Holger Thies (Kyoto, Japan) ??? Chuangjie Xu (Munich, Germany) ??? Ning Zhong (Cincinnati, USA) ??? Martin Ziegler (KAIST, Republic of Korea) Organizing committee ??? Francesco Ciraulo (Padova, Italy) ??? Maria Emilia Maietti (Padova, Italy) ??? Samuele Maschio (Padova, Italy) ??? Pietro Sabelli (Padova, Italy) Contact All questions about submissions should be emailed to ccc22 at math.unipd.it From cmb21 at st-andrews.ac.uk Mon Jul 25 06:31:37 2022 From: cmb21 at st-andrews.ac.uk (Christopher Brown) Date: Mon, 25 Jul 2022 10:31:37 +0000 Subject: [TYPES/announce] Postdoc Vacancy at St Andrews Message-ID: The Programming Languages Group at the University of St Andrews seeks a post-doctoral research fellow for a fixed 12-month position. Details of the position can be found here: https://urldefense.com/v3/__https://www.vacancies.st-andrews.ac.uk/Vacancies/W/4238/0/352367/889/research-fellow-ar2699gb__;!!IBzWLUs!QzpNePqGAehcfLbTzDcFFOQUAmzkv4sA7fO7RWQErq8beWWx8cjZOQCzW1XciKUFdDh4irqkyKD3w8otkcPJGDGQg_AMYDLs44Y$ Vacancy Description School of Computer Science Salary: ?34,304 per annum Start date: 1 October 2022 or as soon as possible thereafter Fixed-term: 12 months Applications are sought for a committed Post-doctoral Research Fellow to work with Dr Chris Brown conducting research for a EPSRC funded project entitled Energise: Refactorings and Skeletons for Energy-Aware Applications on High-Performance Embedded Systems. The primary duties will be to implementing refactorings for target languages such as C; proving general soundness of the refactorings using e.g. dependent types; developing new programming abstractions (skeletons) for abstracting common energy-reducing programming patterns; running experiments; writing proofs of correctness. The successful applicant will have (or be near to completion of) a PhD in Programming Languages with expertise in formal semantics of programming languages, compilers, program transformation, lightweight formal methods (including, e.g. dependent types) and/or knowledge of parallelism and non-functional properties, including energy. The post is available on a fixed-term basis for 12 months starting 1st October or as soon as possible thereafter. Further details of the project can be found by contacting Dr Christopher Brown (cmb21 at st-andrews.ac.uk). Applications are particularly welcome from women, people from the Black, Asian and Minority Ethnic (BAME) community, and other protected characteristics who are under-represented in research posts at the University. Equality, diversity and inclusion are at the heart of the St Andrews experience. We strive to create a fair and inclusive culture demonstrated through our commitment to diversity awards (Athena Swan, Carer Positive, LGBT Charter, Race Charters and Stonewall). We celebrate diversity by promoting profiles of BAME, LGBTIQ+ staff and supporting networks including the Staff BAME Network; Staff with Disabilities Network; Staff LGBTIQ+ Network; and the Staff Parents & Carers Network. Full details available online: https://urldefense.com/v3/__https://www.st-andrews.ac.uk/hr/edi/__;!!IBzWLUs!QzpNePqGAehcfLbTzDcFFOQUAmzkv4sA7fO7RWQErq8beWWx8cjZOQCzW1XciKUFdDh4irqkyKD3w8otkcPJGDGQg_AM0nCBbM8$ Closing Date: 29 July 2022 Interview Date: 23 August 2022 Please quote ref:AR2699GB School of Computer Science Salary: ?34,304 per annum Start date: 1 October 2022 or as soon as possible thereafter Fixed-term: 12 months -------------- next part -------------- An HTML attachment was scrubbed... URL: From K.Stark at hw.ac.uk Tue Jul 26 12:01:34 2022 From: K.Stark at hw.ac.uk (Stark, Kathrin) Date: Tue, 26 Jul 2022 16:01:34 +0000 Subject: [TYPES/announce] Assistant Professorships at Heriot-Watt University Message-ID: Dear all, The Computer Science Department at Heriot-Watt University is looking for three (permanent) assistant professors in Computer Science: https://urldefense.com/v3/__https://enzj.fa.em3.oraclecloud.com/hcmUI/CandidateExperience/en/sites/CX/job/2282/?utm_medium=jobshare__;!!IBzWLUs!RAR69n8PBCGHUdYPgL-9WQBYlUePp8yf8ZS2FGT_7zHCFsVoQ_VWA7uk3tUyvIBFuzNZm0A7UXtcG5bElRnfpjI1weETSsTA$ Heriot-Watt is currently growing significantly in the area of verification, programming languages, and theorem provers - and Scotland offers a great environment for these topics in general (see e.g. the Scottish Programming Languages Seminar or our recent summer school). There are also four more teaching-related positions. The deadline for application is August, 15. Kathrin Kathrin Stark Department of Computer Science Assistant Professor, Heriot-Watt University ________________________________ Founded in 1821, Heriot-Watt is a leader in ideas and solutions. With campuses and students across the entire globe we span the world, delivering innovation and educational excellence in business, engineering, design and the physical, social and life sciences. This email is generated from the Heriot-Watt University Group, which includes: 1. Heriot-Watt University, a Scottish charity registered under number SC000278 2. Heriot- Watt Services Limited (Oriam), Scotland's national performance centre for sport. Heriot-Watt Services Limited is a private limited company registered is Scotland with registered number SC271030 and registered office at Research & Enterprise Services Heriot-Watt University, Riccarton, Edinburgh, EH14 4AS. The contents (including any attachments) are confidential. If you are not the intended recipient of this e-mail, any disclosure, copying, distribution or use of its contents is strictly prohibited, and you should please notify the sender immediately and then delete it (including any attachments) from your system. -------------- next part -------------- An HTML attachment was scrubbed... URL: From melkon.or at gmail.com Tue Jul 26 12:17:57 2022 From: melkon.or at gmail.com (Orestis Melkonian) Date: Tue, 26 Jul 2022 19:17:57 +0300 Subject: [TYPES/announce] Agda Implementors' Meeting XXXI - Edinburgh, 10-16 November 2022 Message-ID: <0698c738-ebcb-5f85-8591-8715c95da0cc@gmail.com> --------------------------------------------------------------- ???????????? Agda Implementors' Meeting XXXI ????????????????? Call for participation ?https://urldefense.com/v3/__http://wiki.portal.chalmers.se/agda/pmwiki.php?n=Main.AIMXXXI__;!!IBzWLUs!XiwwsFxEP-urAGX5ijb-XI331N20xKcaQa2yeBnCdNYJB0xvM9KkfVEI7bLB8sLqUJNt6DD6fZXs8gQno4OggTjxNETExNjd$ --------------------------------------------------------------- The 31st Agda Implementors' Meeting will take place in Edinburgh, Scotland from Thursday 10 November 2022 to Wednesday 16 November 2022. Note that AIMXXXI was initially planned for 2019 but got postponed due to COVID-19, whilst we had several online meetings XXXII-XXXV. The meeting will consist of: ? * Presentations concerning theory, implementation, and use cases of Agda and other Agda-like languages. ? * Discussions around issues related to the Agda language. ? * Plenty of time to work in, on, under or around Agda, in collaboration with other participants. ? * A full day dedicated to the EuroProofNet COST action, including talks and discussions on translating libraries and proofs between Agda and other proof assistants. Please direct enquiries about that to Jesper Cockx . To register for AIM XXXI, please fill out the form below and send it to Orestis Melkonian by email , or simply edit the AIMXXI wiki page yourself. > --------------------------------------------------------------- > Registration form for Agda Implementors' Meeting XXXI > > Name: > > Title and optionally abstract (if you want to give a talk or lead a discussion): > > Suggestions for code sprints (optional): > > Dietary restrictions: > > Additional comments: > > --------------------------------------------------------------- More information is available at ? https://urldefense.com/v3/__http://wiki.portal.chalmers.se/agda/pmwiki.php?n=Main.AIMXXXI__;!!IBzWLUs!XiwwsFxEP-urAGX5ijb-XI331N20xKcaQa2yeBnCdNYJB0xvM9KkfVEI7bLB8sLqUJNt6DD6fZXs8gQno4OggTjxNETExNjd$ Please spread the word about this meeting. Best regards, Orestis From vmvasconcelos at fc.ul.pt Fri Jul 29 11:30:29 2022 From: vmvasconcelos at fc.ul.pt (Vasco Thudichum Vasconcelos) Date: Fri, 29 Jul 2022 15:30:29 +0000 Subject: [TYPES/announce] Post Doctoral Research Fellowship at the University of Lisbon Message-ID: University of Lisbon -- One Post Doctoral Research Fellowship We are looking to fill one post-doctoral research fellowship in the area of programming languages, type systems and logics. The position is funded by the research project "SafeSessions - Safe Concurrent Programming with Session Types", https://urldefense.com/v3/__https://www.lasige.pt/project/safesessions__;!!IBzWLUs!TMQ1F4qq6meiqmkDdquXVYoeE4yauFm8AHYKP6c-q9rkZNjB5oeOA2fBLG2hCdwd_dhkxj7ruNyImO0vHnNH636A4D8kyeRfkF8mi_jH$ . We seek applicants with strong interest in some of the following topics: programming language design and implementation, logics and types, concurrency and distribution. Applicants should hold a PhD degree in Computer Science or related area. The position is funded by the Foundation for Science and Technology for an initial period of 12 months, renewable until the end of the project (February 29, 2024 or six months thereafter). Applications are open until October 30, 2022. The complete offer description can be found at https://urldefense.com/v3/__https://www.euraxess.pt/jobs/819786__;!!IBzWLUs!TMQ1F4qq6meiqmkDdquXVYoeE4yauFm8AHYKP6c-q9rkZNjB5oeOA2fBLG2hCdwd_dhkxj7ruNyImO0vHnNH636A4D8kyeRfkB2-FGfn$ . Further information can be obtained from lasige-candidaturas at listas.di.ciencias.ulisboa.pt. Applicants are encouraged to contact Professor Vasco T. Vasconcelos directly. About the University of Lisbon and the LASIGE research lab The University of Lisbon (ULisboa) is the largest university in Portugal and a leading one within wider Europe. Comprising eighteen faculties, ULisboa offers 400 degree programmes at undergraduate and postgraduate level. Each year it accepts more than 5,000 international students ? around 10% of its total cohort ? who represent 100 different countries. ULisboa leads the main international rankings, is amongst the 200 best universities worldwide according to the 2019 Shanghai Ranking. LASIGE, https://urldefense.com/v3/__https://www.lasige.pt__;!!IBzWLUs!TMQ1F4qq6meiqmkDdquXVYoeE4yauFm8AHYKP6c-q9rkZNjB5oeOA2fBLG2hCdwd_dhkxj7ruNyImO0vHnNH636A4D8kyeRfkD_jBmVK$ , is a research unit at ULisboa evaluated as Excellent by the Portuguese Science Agency (FCT) in 2018, with a perfect score of 15 points. LASIGE closely mentors more than 100 young researchers (at masters, doctoral, and post-doctoral level), continually stimulating excellence in research. LASIGE members teach MSc and PhD level courses in Computer Science and Engineering at ULisboa, regularly publish in top venues, and enjoy top-notch bibliometric indices. LASIGE runs a large number of international projects, boasts three spin-offs, and multiple technology transfers. The high-level research conducted at LASIGE, the scientific background and international projection of its group leaders, the academic and industrial network to which it belongs, and the experience in advanced training of its members makes LASIGE the perfect research unit to work as a postdoc. If this was not enough, the city of Lisbon offers history and culture, shopping, restaurants, nearby beaches and a vibrant nightlife. From vincent.rahli at gmail.com Fri Jul 29 11:33:56 2022 From: vincent.rahli at gmail.com (vincent rahli) Date: Fri, 29 Jul 2022 16:33:56 +0100 Subject: [TYPES/announce] Postdoc and PhD positions at the University of Birmingham Message-ID: Dear all, We would like to invite applications for both: - an up to 3 years fully-funded postdoctoral position - a fully-funded PhD position within the School of Computer Science at the University of Birmingham (see below for details on how to apply). The postdoctoral researcher and PhD students will contribute to an EPSRC-funded project aiming at designing and formally verifying distributed systems, in particular Byzantine fault-tolerant distributed systems as used for example in blockchain technology. The start date is flexible, ideally around October 2022. The environment: ---------------- The School of Computer Science has large and thriving Theory and Security research groups. Among our research interests related to this project are for example: - Formal verification - Proof assistants - Model checking - Blockchain Technology - Security & Privacy Both groups are very active, organising regular seminars, informal meetings, and actively participating in many events such as the Midlands Graduate School or the Cyber Security PhD Winter School. For more information see https://urldefense.com/v3/__https://www.birmingham.ac.uk/research/activity/computer-science/theory-of-computation/index.aspx__;!!IBzWLUs!WM0cerion4CkM3VPag2J2QYDOERCciCPkKf3RtJewsMqRs49NkLU8nlf8Kv-AEdCZUGgLPBtW745zwWBRTxy3KKh0gBsAAjBIkhC0g$ and https://urldefense.com/v3/__https://www.birmingham.ac.uk/research/centre-for-cyber-security-and-privacy/index.aspx__;!!IBzWLUs!WM0cerion4CkM3VPag2J2QYDOERCciCPkKf3RtJewsMqRs49NkLU8nlf8Kv-AEdCZUGgLPBtW745zwWBRTxy3KKh0gBsAAjXQBN5jA$ . How to apply: ------------- Interested people are encouraged to contact me by email (V.Rahli at bham.ac.uk) to discuss their research interests and details of the positions. Further information on how to apply is available here: - postdoctoral position: https://urldefense.com/v3/__https://bham.taleo.net/careersection/redeploy/jobdetail.ftl?job=220001FU__;!!IBzWLUs!WM0cerion4CkM3VPag2J2QYDOERCciCPkKf3RtJewsMqRs49NkLU8nlf8Kv-AEdCZUGgLPBtW745zwWBRTxy3KKh0gBsAAiDXijI1Q$ - PhD position: https://urldefense.com/v3/__https://www.birmingham.ac.uk/schools/computer-science/postgraduate-research/index.aspx__;!!IBzWLUs!WM0cerion4CkM3VPag2J2QYDOERCciCPkKf3RtJewsMqRs49NkLU8nlf8Kv-AEdCZUGgLPBtW745zwWBRTxy3KKh0gBsAAhPF6srug$ Best, Vincent Rahli -- https://urldefense.com/v3/__https://vrahli.github.io/__;!!IBzWLUs!WM0cerion4CkM3VPag2J2QYDOERCciCPkKf3RtJewsMqRs49NkLU8nlf8Kv-AEdCZUGgLPBtW745zwWBRTxy3KKh0gBsAAhYGqd32w$ -------------- next part -------------- An HTML attachment was scrubbed... URL: From tortora at uniroma3.it Fri Jul 29 16:28:40 2022 From: tortora at uniroma3.it (Lorenzo Tortora de Falco) Date: Fri, 29 Jul 2022 22:28:40 +0200 Subject: [TYPES/announce] =?utf-8?q?Conference_in_honour_of_Thomas_Ehrhar?= =?utf-8?q?d=E2=80=99s_60th_birthday?= Message-ID: CALL FOR PARTICIPATION TO THE CONFERENCE IN HONOUR OF THOMAS EHRHARD?S 60th BIRTHDAY Paris, France 29-30 September 2022 All the information are available here: https://urldefense.com/v3/__https://te60.linear-logic.org__;!!IBzWLUs!WbsNWpD4BF-JDbCjOvABFL15okCMh2DBtvRd_5WRIfANTAUKe03aUUCIOHMnVxOpAmXsrb_UGQJwK0UKhQf9veRkB-tWRnEijg$ Please complete the form on this page to confirm your attendance. Registration will be on a first-come, first-served basis and will be closed once the room is at capacity. So, don't wait too long and fill in the application form as soon as possible and in any case by SEPTEMBER 16, 2022 Hoping to see you soon at the workshop! The organising committee Antonio Bucciarelli, Universit? de Paris Michele Pagani, Universit? de Paris Laurent Regnier, Aix-Marseille Universit? Christine Tasson, Sorbonne Universit? Lorenzo Tortora de Falco, Universit? Roma Tre Lionel Vaux Auclair, Aix-Marseille Universit? -------------- next part -------------- An HTML attachment was scrubbed... URL: From msteffen at ifi.uio.no Tue Aug 2 00:39:43 2022 From: msteffen at ifi.uio.no (Martin Steffen) Date: Tue, 02 Aug 2022 06:39:43 +0200 Subject: [TYPES/announce] PhD positions on formal methods and program analysis available at the University of Oslo Message-ID: <86fsifb6nk.fsf@login.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: 31st August 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 announcement: - https://urldefense.com/v3/__https://www.jobbnorge.no/en/available-jobs/job/229366/phd-research-fellow-in-formal-analysis-of-concurrent-systems__;!!IBzWLUs!QblT0_RD5EcESP8aW7ut1fwRXW-rdTA-GPZNzl5zvSxH8BC9brXiKIw2gItJG9ySAqX2H50pKccj3tfWGWkDegKaBEEMsC3h1g$ 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 maribel.fernandez at kcl.ac.uk Tue Aug 2 06:02:17 2022 From: maribel.fernandez at kcl.ac.uk (Fernandez, Maria Isabel) Date: Tue, 2 Aug 2022 10:02:17 +0000 Subject: [TYPES/announce] EAPLS Best Dissertation Award - Call for nominations (PhD Dissertations in 2021) Message-ID: <09CF75C1-9EA3-464A-A594-5B219055DDFD@kcl.ac.uk> ================================================= EAPLS Best Dissertation Award 2021: Call for Nominations ================================================= URL: https://urldefense.com/v3/__http://eapls.org/pages/phd_award/__;!!IBzWLUs!SSi8E7StbuXvsOJcXwST6AVJ60QQBjomxBUnHUlVoY9SrBDkZiWKqZNlg00E9hhgs0pI4sjJJxRDdzImM0bPC4zImzEtjl1KbXBEqSswxERx$ The European Association for Programming Languages and Systems (EAPLS) has established a Best Dissertation Award in the research area of programming languages and systems. The award will go to the PhD student who in the previous period has made the most original and influential contribution to the area. The purpose of the award is to draw attention to excellent work, to help the career of the student in question, and to promote the research field as a whole. -------------------------------- Eligibility -------------------------------- Eligible for the award are those who successfully defended their PhD * at an academic institution in Europe * in the field of Programming Languages and Systems * in the period from 1 January 2021 ? 31 December 2021 -------------------------------- Nominations -------------------------------- Candidates for the award must be nominated by their supervisor. Nominating a candidate consists of submitting the nomination via https://urldefense.com/v3/__https://easychair.org/my/conference?conf=eapls21__;!!IBzWLUs!SSi8E7StbuXvsOJcXwST6AVJ60QQBjomxBUnHUlVoY9SrBDkZiWKqZNlg00E9hhgs0pI4sjJJxRDdzImM0bPC4zImzEtjl1KbXBEqTmt4UQO$ . The nomination must consist of a single PDF file containing * a letter from the supervisor describing why the thesis should be considered for the award; * a report from an independent researcher who has acted as examiner of the thesis at its defense; and * the thesis itself. The nominated theses will be evaluated with respect to originality and significance to the field, and (to a lesser degree) quality of writing. Where the thesis consists of a collection of papers, in assessing the quality of writing careful consideration will be given to the introduction and overall conclusion chapters of the thesis, as well as the quality of the individual papers and their consistent use of notation, concepts, etc. Questions can be directed to the PhD award chairs: Maribel Fernandez and Andreas Wortmann, at eapls21 at easychair.org. -------------------------------- Procedure -------------------------------- The nominations will be evaluated and compared by an international committee of experts. The justification by the supervisor and the external report will play an important role in the evaluation. The final decision is made by the EAPLS board, based on the recommendation of the expert committee. Members of the expert committee and the EAPLS board are barred from nominating their own PhD students for the award. The award consists of a certificate announcing the winner of the EAPLS PhD award 2021 and the supervisor will receive a copy of this certificate. If possible, the certificate will be handed out ceremonially at a suitable occasion, for instance the ETAPS conference. In addition, the winner will be invited to submit a short video summarising the thesis work, which will be made available via the EAPLS website. Apart from the winner, no further ranking of nominees will be published. The decision of the expert committee is final and binding and will not be subject to discussion. -------------------------------- Important Dates -------------------------------- 30 August 2022: Deadline for nominations 1 December 2022: Announcement of the award winner -------------------------------- Expert Committee -------------------------------- The expert committee includes: * Eerke Boiten (De Montfort University, UK) * Stefano Crespi Reghizzi (Politecnico di Milano, IT) * Kei Davis (Los Alamos National Laboratory, USA) * Mariangiola Dezani-Ciancaglini (Dipartimento di InformaticaUniversit? di Torino, IT) * Santiago Escobar (Universitat Polit?cnica de Val?ncia, ES) * Maurizio Gabbrielli (University of Bologna, IT) * Sabine Glesner (TU Berlin, DE) * Stefan Gruner (University of Pretoria, SA) * Christoph Kirsch (University of Salzburg, AT) * Jens Knoop (TU Vienna, AT) * Greg Michaelson (Heriot-Watt University, UK) * Fran?ois Pottier (INRIA, FR) * Matteo Pradella (Politecnico di Milano, IT) * Ana Sokolova (University of Salzburg, AT) --- Professor Maribel Fernandez Department of Informatics King?s College London, UK https://urldefense.com/v3/__https://nms.kcl.ac.uk/maribel.fernandez/__;!!IBzWLUs!SSi8E7StbuXvsOJcXwST6AVJ60QQBjomxBUnHUlVoY9SrBDkZiWKqZNlg00E9hhgs0pI4sjJJxRDdzImM0bPC4zImzEtjl1KbXBEqTreBq-k$ -------------- next part -------------- An HTML attachment was scrubbed... URL: From beniamino.accattoli at inria.fr Tue Aug 2 17:11:34 2022 From: beniamino.accattoli at inria.fr (Beniamino Accattoli) Date: Tue, 2 Aug 2022 23:11:34 +0200 (CEST) Subject: [TYPES/announce] PPDP 2022 and LOPSTR 2022 Call for Participation Message-ID: <1332556685.10286953.1659474694792.JavaMail.zimbra@inria.fr> ============================ PPDP 2022 - LOPSTR 2022 JOINT CALL FOR PARTICIPATION ============================ PPDP 2022 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!U__FSNZ7rZ0XJzQ7X1Xgb34S9PIr1JjgY4hlqZ4N4nvse48uTlKbPocxyvcBaFLT3r-l9VyJt4ZmCAumuRkjceX57x7onxvyiWCknut3-a0$ Co-located with LOPSTR 2022 32nd International Symposium on Logic-Based Program Synthesis and Transformation 21-23 September 2022, Tbilisi, Georgia https://urldefense.com/v3/__https://lopstr2022.webs.upv.es/__;!!IBzWLUs!U__FSNZ7rZ0XJzQ7X1Xgb34S9PIr1JjgY4hlqZ4N4nvse48uTlKbPocxyvcBaFLT3r-l9VyJt4ZmCAumuRkjceX57x7onxvyiWCk7DDAui4$ The conferences will be held as hybrid (blended) meetings, both in-person and virtual. Both conferences are part of CLAS 2022: https://urldefense.com/v3/__http://www.viam.science.tsu.ge/clas2022/__;!!IBzWLUs!U__FSNZ7rZ0XJzQ7X1Xgb34S9PIr1JjgY4hlqZ4N4nvse48uTlKbPocxyvcBaFLT3r-l9VyJt4ZmCAumuRkjceX57x7onxvyiWCkTxO5P7E$ =================================== Registration ------------ Please use the CLAS registration form on EasyChair: https://urldefense.com/v3/__https://easychair.org/my/conference?conf=clas2022__;!!IBzWLUs!U__FSNZ7rZ0XJzQ7X1Xgb34S9PIr1JjgY4hlqZ4N4nvse48uTlKbPocxyvcBaFLT3r-l9VyJt4ZmCAumuRkjceX57x7onxvyiWCkOVO0AZc$ * Early registration deadline August 14, 2022 * An online-only registration option is available. =================================== Invited Speakers ---------------- Niki Vazou, IMDEA Software Institute, Spain (joint PPDP-LOPSTR invited speaker) Florian Zuleger, Technische Universit?t Wien, Austria (joint PPDP-LOPSTR invited speaker) Torsten Grust, University of T?bingen, Germany (PPDP invited speaker) Robert Hierons, The University of Sheffield, UK. (LOPSTR invited speaker) Ornela Dardha, Elena Giachino, and Davide Sangiorgi (10 Year Most Influential Paper Award for ?Session Types Revisited?, PPDP 2012). =================================== 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. About LOPSTR ------------ The aim of the LOPSTR series is to stimulate and promote international research and collaboration on logic-based program development. LOPSTR is open to contributions in logic-based program development in any language paradigm. LOPSTR has a reputation for being a lively, friendly forum for presenting and discussing work in progress. =================================== Please consult the conferences' webpages for the lists of accepted papers. Hope to see you in Tbilisi! The PPDP and LOPSTR chairs. Alicia Villanueva Manuel Hermenegildo Beniamino Accattoli -------------- next part -------------- An HTML attachment was scrubbed... URL: From shiloviis at mail.ru Tue Aug 2 23:40:56 2022 From: shiloviis at mail.ru (=?UTF-8?B?U2hpbG92IE5pa29sYXk=?=) Date: Wed, 03 Aug 2022 06:40:56 +0300 Subject: [TYPES/announce] =?utf-8?q?PSSV_plan_for_2022-2023?= Message-ID: <1659498056.988343479@f724.i.mail.ru> The International Workshop on Program Semantics, Specification and Verification has 12-years history (https://urldefense.com/v3/__https://persons.iis.nsk.su/en/PSSVfrom2022towards2023*history__;Iw!!IBzWLUs!QMt7omOqxfIknJaHtNZ_1rTXupCsa4b6t0V1n6CziiHtX1-2rBFBXS9mmrW9WItquwBxY4SJQgikTzLIxlG3huIgCxmSfIND$ ). It was launched in 2010 to become a venue to help collaboration between researchers in the field of program semantics, specification and verification from the Commonwealth of Independent States and International colleagues. ? According to the decision of the joint meeting of the Program Committee and co-chairs, the workshop is suspended in the year 2022 because of the uncertain current situation for international participation and attendance but to be resumed the next year 2023. (In other words: we are going to step over the number 13 without delay and proceed immediately to the 14th edition.) ? PSSV Committees have a strong hope that the next year 2023 we all will have an opportunity to have the next workshop with international participation (a hybrid at least) and invite the community to follow our updates at https://urldefense.com/v3/__https://persons.iis.nsk.su/en/PSSVfrom2022towards2023!__;!!IBzWLUs!QMt7omOqxfIknJaHtNZ_1rTXupCsa4b6t0V1n6CziiHtX1-2rBFBXS9mmrW9WItquwBxY4SJQgikTzLIxlG3huIgC8wYn15h$ ? This year 2022 we plan to publish Call for Verification Problems (CVP) by November 2022 to collect submitted problems, select a short list to publish (very much in advance to the next workshop PSSV-2023), and finally to have a Problems and Solution track (P&S-track) on the next PSSV-2023. ? We also plan to organize on PSSV-2023 half-day problem-solving tutorial(s) to present verification and systems approach(s) in details (to enhance educational value of the workshop and attract new participants among students). ? Nikolay V. Shilov and Vladimir A. Zakharov -------------- next part -------------- An HTML attachment was scrubbed... URL: From mbatty at cantab.net Wed Aug 3 04:41:12 2022 From: mbatty at cantab.net (Mark Batty) Date: Wed, 3 Aug 2022 09:41:12 +0100 Subject: [TYPES/announce] Lecturer (Assistant Professor) Position in Programming Languages at the University of Kent Message-ID: We are seeking to appoint a new lecturer in Computing in our Programming Languages and Systems research group based at our Canterbury campus, University of Kent. Job description / Additional Information / Please apply at https://urldefense.com/v3/__https://jobs.kent.ac.uk/Vacancy.aspx?id=4919__;!!IBzWLUs!RwqtTEw6YOBVmuIzx2cJQHDPuR2ykxWpBfZy2WP_KFCgLsdk511D6CdkSrbFSg6PIMUUXPuA-syMLROYuH4Tha6Wqc9g6A$ Closing date for applications: 26 August 2022 (end of day, UK time) The Programming Languages and Systems (PLaS) research group spans the breadth and depth of practical and theoretical aspects of programming languages and system building related to languages. Our work goes across paradigms (imperative, object-oriented, functional, logic) and is complemented by our systems research in concurrency, relaxed memory, verified compilation, verification, language prototypes, garbage collection, and tools. All our work is linked by a shared vision of the power and impact of programming languages on the rest of Computer Science. The PLaS group at Kent has a long history of contributions to the field and continues to be a hotbed of programming language research in the South East of England: https://urldefense.com/v3/__https://www.cs.kent.ac.uk/research/groups/plas/index.html__;!!IBzWLUs!RwqtTEw6YOBVmuIzx2cJQHDPuR2ykxWpBfZy2WP_KFCgLsdk511D6CdkSrbFSg6PIMUUXPuA-syMLROYuH4Tha6-LzLHow$ The School of Computing [1] is a welcoming, supportive, and diverse environment whose commitment to gender equality has been recognised with a Bronze Athena SWAN [2] award. We are keen to enhance the balanced, inclusive and diverse nature of the community within our School and would particularly encourage female candidates to apply for these posts. We are committed to delivering high quality research and education. The School?s five broad research areas are Programming Languages and Systems; Computer Security; Computational Intelligence; Data Science; and Computing Education. Full details can be found at: https://urldefense.com/v3/__https://www.kent.ac.uk/computing/research__;!!IBzWLUs!RwqtTEw6YOBVmuIzx2cJQHDPuR2ykxWpBfZy2WP_KFCgLsdk511D6CdkSrbFSg6PIMUUXPuA-syMLROYuH4Tha69rYHU9w$ . The University of Kent campus is in Canterbury, overlooking the historic city centre. Canterbury is a small city that retains parts of its medieval walls (with Roman foundations). Famous for its heritage (Canterbury Cathedral; Chaucer?s Tales; etc), Canterbury is a vibrant community and UNESCO World Heritage site whose culture and leisure facilities are enhanced by hosting three universities. With 125 nationalities represented, the Canterbury campus has a very cosmopolitan feel. The city and surrounding region combines an attractive and affordable environment, outstanding schools, and fast transport links to London and mainland Europe. Links: [1] https://urldefense.com/v3/__https://cs.kent.ac.uk/__;!!IBzWLUs!RwqtTEw6YOBVmuIzx2cJQHDPuR2ykxWpBfZy2WP_KFCgLsdk511D6CdkSrbFSg6PIMUUXPuA-syMLROYuH4Tha6wqDHorA$ [2] https://urldefense.com/v3/__http://www.ecu.ac.uk/equality-charters/athena-swan/__;!!IBzWLUs!RwqtTEw6YOBVmuIzx2cJQHDPuR2ykxWpBfZy2WP_KFCgLsdk511D6CdkSrbFSg6PIMUUXPuA-syMLROYuH4Tha5bEyG4mA$ -------------- next part -------------- An HTML attachment was scrubbed... URL: From Neil.JR.Ross at Dal.Ca Thu Aug 4 10:15:28 2022 From: Neil.JR.Ross at Dal.Ca (Julien Ross) Date: Thu, 4 Aug 2022 14:15:28 +0000 Subject: [TYPES/announce] PLanQC 2022: Call for posters Message-ID: PLanQC 2022: Programming Languages for Quantum Computing Call for poster abstracts (deadline: August 15 2022 aoe) We invite members of the programming languages and quantum computing communities to submit poster abstracts for the 3rd International Workshop on Programming Languages for Quantum Computing (PLanQC 2022), co-located this September with ICFP in Ljubljana, Slovenia. PLanQC aims to bring together researchers from the fields of programming languages and quantum information, exposing the programming languages community to the unique challenges of programming quantum computers. It will promote the development of tools to assist in the process of programming quantum computers, as they exist today and as they are likely to exist in the near to distant future. Poster abstracts should contain no more than a few paragraphs and should fit on a single page. Work in progress is welcome. Abstracts will be reviewed for quality and relevance to the workshop. Poster abstracts can be submitted by email to: neil.jr.ross at dal.ca ------------------------------------------------------------------------- Invited speakers: ? Dominique Unruh, University of Tartu ? Charles Yuan, MIT Workshop topics include (but are not limited to): ? High-level quantum programming languages ? Verification tools for quantum programs ? Novel quantum programming abstractions ? Quantum circuit and program optimizations ? Hardware-aware circuit compilation and routing ? Error handling, mitigation, and correction ? Instruction sets for quantum hardware ? Other techniques from traditional programming languages (e.g., types, compilation/optimization, foreign function interfaces) applied to the domain of quantum computation. Workshop website:??????? ? https://urldefense.com/v3/__https://icfp22.sigplan.org/home/planqc-2022__;!!IBzWLUs!Wf6h0fV9dbz6W5bqXjezJJk7s8DexzB9QTmB6Vs2W-yWP-jNDxaRQ57nuYQlsii2c9z0bQsHl7yb7BFjrRanJifVqoOzH88dX8ja$ ------------------------------------------------------------------------- Important dates: ? Poster abstract submission deadline: 15 August 2022 (anywhere on earth) ? Notification: 18 August 2022 ? Workshop: 15 September 2022 ------------------------------------------------------------------------- Student support: Limited travel support is available to students wishing to attend PLanQC. Further information and can be found on the workshop website: https://urldefense.com/v3/__https://icfp22.sigplan.org/home/planqc-2022*Travel-Support-for-Students__;Iw!!IBzWLUs!Wf6h0fV9dbz6W5bqXjezJJk7s8DexzB9QTmB6Vs2W-yWP-jNDxaRQ57nuYQlsii2c9z0bQsHl7yb7BFjrRanJifVqoOzH5xQoqP9$ ------------------------------------------------------------------------- Program Committee: Matthew Amy, Simon Fraser University Robert Booth, The University of Edinburgh Olivia Di Matteo, University of British Columbia Yufei Ding, UC Santa Barbara Ross Duncan, Cambridge Quantum Computing Ltd Peng (Frank) Fu, Dalhousie University Kesha Hietala, University of Maryland Kohei Kishida, University of Illinois Urbana-Champaign Aleks Kissinger, University of Oxford Bert Lindenhovius, Tulane University Robert Rand, University of Chicago Mathys Rennela, Inria Neil Julien Ross (chair), Dalhousie University Sam Staton, University of Oxford Mathias Soeken, Microsoft Dominique Unruh, University of Tartu Beno?t Valiron, Universit? Paris-Saclay, CNRS, CentraleSup?lec, LMF Vladimir Zamdzhiev, Inria, LORIA, Universit? de Lorraine Organizing Committee: Matt Amy, Simon Fraser University Ross Duncan, Cambridge Quantum Computing Robert Rand, University of Chicago Neil Julien Ross, Dalhousie University -------------- next part -------------- An HTML attachment was scrubbed... URL: From andreeac at comp.nus.edu.sg Thu Aug 11 23:56:14 2022 From: andreeac at comp.nus.edu.sg (Andreea Costea) Date: Fri, 12 Aug 2022 11:56:14 +0800 Subject: [TYPES/announce] SPLASH 2022 - Combined Call For Workshop Papers Message-ID: <320dbb25639a2502e699e0fe51013f93@comp.nus.edu.sg> ====================================================================== Combined Call For Workshop Papers 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-Workshops__;!!IBzWLUs!SbbBxw0FscbFaTQEsLvSXTwvEJM6oKS8VGCNeWtggXxZiOX4K5ArBo6KehO8AMYXs16oNBaTXW0Zx_kXQbqrKS_yiss-G8oKmWSaGTk$ ====================================================================== OUTLINE OF THE COMBINED CALL FOR CONTRIBUTIONS: Workshops: - FTSCS - HATRA - LIVE - PAINT - REBLS - Unsound - VMIL Submissions due for all workshops: 1st September 2022 ====================================================================== SPLASH - The ACM SIGPLAN conference on Systems, Programming, Languages, and Applications: Software for Humanity embraces all aspects of software construction and delivery, to make it the premier conference on the applications of programming languages - at the intersection of programming languages and software engineering. SPLASH 2022 aims to signify the reopening of the world and being able to meet your international colleagues in person. We are looking forward to seeing you in Australasia. ** Workshops ** **** Formal Techniques for Safety-Critical Systems (FTSCS) **** The aim of this workshop is to bring together researchers and engineers who are interested in the application of formal and semi-formal methods to improve the quality of safety-critical computer systems. FTSCS strives to promote research and development of formal methods and tools for industrial applications, and is particularly interested in industrial applications of formal methods. The workshop will provide a platform for discussions and the exchange of innovative ideas, so submissions on work in progress are encouraged. Details: https://urldefense.com/v3/__https://2022.splashcon.org/home/ftscs-2022__;!!IBzWLUs!SbbBxw0FscbFaTQEsLvSXTwvEJM6oKS8VGCNeWtggXxZiOX4K5ArBo6KehO8AMYXs16oNBaTXW0Zx_kXQbqrKS_yiss-G8oKNKShn1M$ **** Human Aspects of Types and Reasoning Assistants (HATRA)**** This workshop brings together programming languages, software engineering, security, and human-computer interaction researchers to investigate methods for making languages that provide stronger safety properties more effective for programmers and software engineers. HATRA is interested in two different kinds of contributions. First, extended abstracts that summarize an existing body of work that is relevant to the workshop's topic. Second, research papers that describe a new idea, approach, or hypothesis in the space and are presented as an opportunity for the authors to receive community feedback and for the community to seek inspiration from others. Details: https://urldefense.com/v3/__https://2022.splashcon.org/home/hatra-2022__;!!IBzWLUs!SbbBxw0FscbFaTQEsLvSXTwvEJM6oKS8VGCNeWtggXxZiOX4K5ArBo6KehO8AMYXs16oNBaTXW0Zx_kXQbqrKS_yiss-G8oK0snJkTA$ **** Live Programming (LIVE)**** Programming is cognitively demanding, and too difficult. LIVE is a workshop exploring new user interfaces that improve the immediacy, usability, and learnability of programming. Whereas PL research traditionally focuses on programs, LIVE focuses more on the activity of programming. Our goal is to provide a supportive venue where early-stage work receives constructive criticism. Whether graduate students or tenured faculty, researchers need a forum to discuss new ideas and get helpful feedback from their peers. Towards that end, we will allot about ten minutes for discussion after every presentation. Details: https://urldefense.com/v3/__https://2022.splashcon.org/home/live-2022__;!!IBzWLUs!SbbBxw0FscbFaTQEsLvSXTwvEJM6oKS8VGCNeWtggXxZiOX4K5ArBo6KehO8AMYXs16oNBaTXW0Zx_kXQbqrKS_yiss-G8oK74tMDzE$ **** Programming Abstractions and Interactive Tools, Notations, and Environments (PAINT)**** In this workshop, we want to discuss programming environments that support users in working with and creating domain-specific abstractions and notations. Topics of interest include the composition and integration of domain-specific abstractions and tools inside general-purpose programming languages and environments, the implementation and evaluation of editing ergonomics and UX concerns, or tool support for creating domain-specific abstractions and tools. Environments that typically exhibit such properties include meta tools or tool creation frameworks, language workbenches, block-based editors and other visual programming approaches or projectional editors. Details: https://urldefense.com/v3/__https://2022.splashcon.org/home/paint-2022__;!!IBzWLUs!SbbBxw0FscbFaTQEsLvSXTwvEJM6oKS8VGCNeWtggXxZiOX4K5ArBo6KehO8AMYXs16oNBaTXW0Zx_kXQbqrKS_yiss-G8oK4-yCx_Y$ **** Reactive and Event-Based Languages and Systems (REBLS) **** This workshop will gather researchers in reactive and event-based languages and systems. The goal of the workshop is to exchange new technical research results and to better define the field by coming up with taxonomies and overviews of the existing work. Details: https://urldefense.com/v3/__https://2022.splashcon.org/home/rebls-2022__;!!IBzWLUs!SbbBxw0FscbFaTQEsLvSXTwvEJM6oKS8VGCNeWtggXxZiOX4K5ArBo6KehO8AMYXs16oNBaTXW0Zx_kXQbqrKS_yiss-G8oKw1_oN2U$ **** Sources of Unsoundness in Verification (Unsound) **** Participants to Unsound will be able to share their experience and exploits on how different verification tools can either be broken or expose confusing behavior, likely to be unexpected by users. We are particularly interested in sources of unsoundness that are accidentally shared by many different unrelated research lines, and to develop an understanding on why this is the case. The workshop is meant to be welcoming for both people with strong theoretical skills, as well as people who just like hacking things. We do not expect fully polished submissions and we will not have formal proceedings. Details: https://urldefense.com/v3/__https://2022.splashcon.org/home/unsound-2022__;!!IBzWLUs!SbbBxw0FscbFaTQEsLvSXTwvEJM6oKS8VGCNeWtggXxZiOX4K5ArBo6KehO8AMYXs16oNBaTXW0Zx_kXQbqrKS_yiss-G8oKPSaS618$ **** Virtual Machines and Language Implementations (VMIL) **** The concept of Virtual Machines is pervasive in the design and implementation of programming systems. Virtual Machines and the languages they implement are crucial in the specification, implementation and/or user-facing deployment of most programming technologies. The VMIL workshop is a forum for researchers and cutting-edge practitioners working on language virtual machines to discuss the various related engineering and research issues. Details: https://urldefense.com/v3/__https://2022.splashcon.org/home/vmil-2022__;!!IBzWLUs!SbbBxw0FscbFaTQEsLvSXTwvEJM6oKS8VGCNeWtggXxZiOX4K5ArBo6KehO8AMYXs16oNBaTXW0Zx_kXQbqrKS_yiss-G8oK_clkWEY$ ====================================================================== Important Dates for All Workshops Paper/Abstract Submission Deadline: 1 Sept 2022 Camera-Ready Deadline (where applicable): 24 Oct 2022 ====================================================================== Organizing Committee General Chair: Alex Potanin (Australian National University) OOPSLA Review Committee Chair: Amal Ahmed (Northeastern University) OOPSLA Review Committee Co-Chair: Jan Vitek (Northeastern University; Czech Technical University) OOPSLA Artifact Evaluation Co-Chair: Benjamin Greenman (Brown University) OOPSLA Artifact Evaluation Co-Chair: Ana Milanova (Rensselaer Polytechnic Institute) APLAS Chair: Ilya Sergey (National University of Singapore) DLS PC Co-Chair: Wolfgang De Meuter (Vrije Universiteit Brussel) DLS PC Co-Chair: Arjun Guha (Northeastern University) GPCE General Chair: Bernhard Scholz (University of Sydney) GPCE PC Chair: Yukiyoshi Kameyama (University of Tsukuba) SAS Co-Chair: Caterina Urban (INRIA & ?cole Normale Sup?rieure | Universit? PSL) SAS Co-Chair: Gagandeep Singh (University of Illinois at Urbana-Champaign; VMware) SLE Chair: Bernd Fischer (Stellenbosch University) SLE PC Co-Chair: Lola Burgue?o (Open University of Catalonia) SLE PC Co-Chair: Walter Cazzola (Universit? degli Studi di Milano) Onward! Papers Chair: Christophe Scholliers (Universiteit Gent) Onward! Essays Chair: Jeremy Singer (University of Glasgow) SPLASH-E Co-Chair: Martin Henz (National University Of Singapore) SPLASH-E Co-Chair: Benjamin Lerner (Northeastern University) Workshops Co-Chair: Mehdi Bagherzadeh (Oakland University) Workshops Co-Chair: Raffi Khatchadourian (City University of New York (CUNY) Hunter College) Comfy Chair: Tony Hosking (Australian National University) Hybridisation Co-Chair: Jonathan Aldrich (Carnegie Mellon University) Hybridisation Co-Chair: Youyou Cong (Tokyo Institute of Technology) Diversity and Inclusion Chair, Local Organising Chair: Kelly Blincoe (University of Auckland) Video Co-Chair: Zixian Cai (Australian National University) Video Co-Chair: Benjamin Chung (Northeastern University) Sponsorship Co-Chair: Bor-Yuh Evan Chang (University of Colorado Boulder & Amazon) Publicity Chair, Web Co-Chair: Andreea Costea (National University Of Singapore) PLMW Co-Chair: Molly Feldman (Oberlin College) Budget and Finance Chair: Michael Homer (Victoria University of Wellington) Student Volunteer Co-Chair: Yao Li (University of Pennsylvania) Student Volunteer Co-Chair: Julian Mackay (Victoria University of Wellington) Student Research Competition Co-Chair: Xujie Si (McGill University, Canada) Student Research Competition Co-Chair: Caterina Urban (INRIA & ?cole Normale Sup?rieure | Universit? PSL) Symposium Chair: Fabian Muehlboeck (IST Austria) PLMW Co-Chair: Lukasz Ziarek (University at Buffalo) -------------- next part -------------- An HTML attachment was scrubbed... URL: From ifl21.publicity at gmail.com Mon Aug 15 02:42:38 2022 From: ifl21.publicity at gmail.com (Pieter Koopman) Date: Mon, 15 Aug 2022 01:42:38 -0500 Subject: [TYPES/announce] IFL22: Early registration deadline August 15th Message-ID: *IFL 2022Frederiksberg Campus of Faculty of Science, UCPH, CopenhagenAugust 31s-September 2nd, 2022* *Early registration deadline: August 15th AoE * *See **https://urldefense.com/v3/__https://ifl22.github.io/*__;Kg!!IBzWLUs!RQZPbEwBBGqhr7bL6mbMB7lKD6ReShWOdZOcPGtcdp66976H-3zd3Tg92H_bTvrTaY3FgHz3NREA0BbztfL-c-mA3wRGb50He05UJJWm$ * for more information.* *CALL FOR PARTICIPATION:* The 34th Symposium on Implementation and Application of Functional Languages (IFL 2022) Copenhagen, August 31st-September 2nd, 2022 *Important dates* Submission deadline of draft papers August 8th, 2022 (EXPIRED) Notification of acceptance August 9th, 2022 (EXPIRED) Early registration deadline August 15th, 2022 (AoE) Late registration deadline August 31st, 2022, 12:59 CET (UTC+2) IFL Symposium August 31st - September 2nd, 2022 (We-Fr) *Scope* The goal of IFL is to bring together researchers and developers actively engaged in the implementation and application of functional programming languages and function-oriented programming. IFL 2022 is held in beautiful Copenhagen, Denmark and is a venue for researchers to present and discuss new ideas and concepts, work in progress, and publication-ripe results related to the implementation and application of functional programming languages and function-oriented programming. *Invited speakers* IFL 2022 is pleased to announce keynote talks by the following three invited speakers: * Peter Sestoft, Professor, Head of Department, IT University of Copenhagen, Denmark: "Abstract machines and functional language implementation" * Lennart Augustsson, Principal Programmer, Epic Games: "Verse - a new functional-logic language" * Thomas Gazagnaire, Chief Technology Officer and co-founder, Tarides: "Talk title to be announced" *Venue and registration* The symposium will be held physically on the Frederiksberg Campus of the Faculty of Science at the University of Copenhagen. Days 1 and 2 (August 31st and September 1st) will be in meeting room A2-84.01 at Thorvaldsensvej 40. Day 3 (September 2nd) will be in the Celebration Auditorium at B?lowsvej 17. For registration and fees, please consult the symposium web site at https://urldefense.com/v3/__https://ifl22.github.io/__;!!IBzWLUs!RQZPbEwBBGqhr7bL6mbMB7lKD6ReShWOdZOcPGtcdp66976H-3zd3Tg92H_bTvrTaY3FgHz3NREA0BbztfL-c-mA3wRGb50He4DOcflf$ . Please notice that the early registration date is August 15, 2022 (AoE). *Accepted papers* * Asynchronous Shared Data Sources. Mart Lubbers, Haye B?hm, Pieter Koopman and Rinus Plasmeijer. * Heuristics-based Type Error Diagnosis for Haskell: the case of type families. Niels Kwadijk and Jurriaan Hage. * Verified Technology Mapping in an Agda DSL for Circuit Design. Jo?o Paulo Pizani Flor and Wouter Swierstra. * Creating Interactive Visualizations of TopHat Programs. Mark Gerarts, Marc de Hoog, Nico Naus and Tim Steenvoorden. * An SQL Frontend on top of OCaml for Data Analysis. Yan Dong, Yahui Song and Wei-Ngan Chin. * A Structure Editor with Type-Safe Copy/Paste. Hans H?ttel, Christoffer Lind Andersen, Nana Gjerulf Sandberg, Anja Elisasen Lumholtz Nielsen and Peter Mikkelsen. * How to fold and color a map: Comparing Use-Cases of Tree-Fold vs Fold-Left. Jim Newton. * Compiling a functional array language with non-semantic memory information. Philip Munksgaard, Cosmin Oancea and Troels Henriksen. * Systems of partial values and their applications in Haskell. Natasha England-Elbro. * First-Class Data Types in Shallow Embedded Domain-Specific Languages using Metaprogramming. Mart Lubbers, Pieter Koopman and Rinus Plasmeijer. * Set-theoretic Types for Erlang. Albert Schimpf, Stefan Wehr and Annette Bieniusa. * Strongly-Typed Multi-View Stack-Based Computations. Pieter Koopman and Mart Lubbers. * Ztrategic: Strategic Programming with Zippers. Jos? Nuno Macedo, Emanuel Rodrigues, Marcos Viera and Jo?o Saraiva. * Higher-ranked region inference for polymorphic, lazy languages. Ivo Gabe de Wolff and Jurriaan Hage. * Jeopardy: An invertible functional programming language. Joachim Kristensen, Robin Kaarsgaard and Michael Kirkedal Thomsen. * The Foil: Capture-Avoiding Substitution With No Sharp Edges. Dougal Maclaurin, Alexey Radul and Adam Paszke. * Verified Causal Broadcast with Liquid Haskell. Patrick Redmond, Gan Shen, Niki Vazou and Lindsey Kuper. * Towards Inversion of Tail-recursive Term Rewriting Systems. Maria Bendix Mikkelsen, Robert Gl?ck and Maja Hanne Kirkeby. * A Confluence and Termination Checker for Haskell Rewrite Rules. Makoto Hamana. * On Generating Out-Of-Core GPU Code for Multi-Dimensional Array Operations. Patrick van Beurden and Sven-Bodo Scholz. * Compiling Haskell for Energy Efficiency: Analysis of Individual Transformations. Bernardo Santos, Jo?o Fernandes, Maja Kirkeby and Alberto Pardo. *Post-symposium peer review * Following IFL tradition, IFL 2022 will use a post-symposium review process to produce the formal proceedings. Before the symposium authors submit draft papers. These draft papers have been screened by the program chair to make sure that they are within the scope of IFL. The draft papers will be made available to all participants at the symposium. Each draft paper is presented by one of the authors at the symposium. Notice that it is a requirement that draft papers that are accepted for presentation be presented physically at the symposium. After the symposium the authors are invited to submit a full paper, incorporating feedback from discussions at the symposium. Work submitted to IFL may not be simultaneously submitted to other venues; submissions must adhere to ACM SIGPLAN's republication policy. The program committee will evaluate these submissions according to their correctness, novelty, originality, relevance, significance, and clarity, and will thereby determine whether the paper will be accepted or rejected for the formal proceedings. Papers that are accepted for the formal proceedings are published in the International Conference Proceedings Series of the ACM Digital Library, as in previous years. *Peter Landin Prize* The Peter Landin Prize is awarded to the best paper presented at the symposium every year. The honored article is selected by the program committee based on the submissions received for the formal review process. The prize carries a cash award equivalent to 150 Euros. *Sponsors* IFL 2022 is financially supported by - Meta (Silver sponsor), - Well-typed (Bronze sponsor), - Funktionelle K?benhavnere (Bronze sponsor), and - University of Copenhagen (administrative support, host). *Organisation* General chair Fritz Henglein, University of Copenhagen Program chair Martin Elsman, University of Copenhagen Communications chair Troels Henriksen, University of Copenhagen *Program committee* Laura M. Castro Universidade da Coru?a, Spain David Christiansen Haskell Foundation Martin Elsman University of Copenhagen, Denmark (chair) Matthew Fluet Rochester Institute of Technology, USA Clemens Grelck Universiteit van Amsterdam, The Netherlands Zhenjiang Hu Peking University, China Robin Kaarsgaard University of Edinburgh, Scotland Gabriele Keller Utrecht University, The Netherlands Oleg Kiselyov Tohoku University, Japan Neil Mitchell Facebook Stefan Monnier Universite de Montreal, Canada Magnus Myreen Chalmers University, Sweden Cyrus Omar University of Michigan, USA Romain P?choux University of Lorraine, Inria, France Rinus Plasmeijer Radboud University, The Netherlands Morten Rhiger Roskilde University, Denmark Peter van Roy Catholic University of Louvain, Belgium Olin Shivers Northeastern University, USA Peter Thiemann University of Freiburg, Germany Marcos Viera Universidad de la Rep?blica, Uruguay Meng Wang University of Bristol, UK [image: beacon] -------------- next part -------------- An HTML attachment was scrubbed... URL: From stevez at seas.upenn.edu Tue Aug 16 10:04:11 2022 From: stevez at seas.upenn.edu (Steve Zdancewic) Date: Tue, 16 Aug 2022 10:04:11 -0400 Subject: [TYPES/announce] Certified Programs and Proofs (CPP) 2023 Call for Papers Message-ID: Certified Programs and Proofs (CPP) is an international conference on practical and theoretical topics in all areas that consider formal verification and certification as an essential paradigm for their work. CPP spans areas of computer science, mathematics, logic, and education. CPP 2023 (https://urldefense.com/v3/__https://popl23.sigplan.org/home/CPP-2023__;!!IBzWLUs!UzlWvMXVOGai-O1NIPaiRpB-OstT5MmHIhWLj55yoeIjY51i_vus7d63BHVefIuprvzgrL2NA1IWqkkqrJfh7tGWjsLUd2z63jI$ ) will be held on 16-17 January 2023 and will be co-located with POPL 2023 in Boston, Massachusetts, United States. CPP 2023 is sponsored by ACM SIGPLAN, in cooperation with ACM SIGLOG. CPP 2023 will welcome contributions from all members of the community. The CPP 2023 organizers will strive to enable both in-person and remote participation, in cooperation with the POPL 2023 organizers. IMPORTANT DATES * Abstract Submission Deadline: 14 September 2022 at 23:59 AoE (UTC-12h) * Paper Submission Deadline: 21 September 2022 at 23:59 AoE (UTC-12h) * Notification (tentative): 21 November 2022 * Camera Ready Deadline (tentative): 12 December 2022 * Conference: 16-17 January 2023 Deadlines expire at the end of the day, anywhere on earth. Abstract and submission deadlines are strict and there will be no extensions. DISTINGUISHED PAPER AWARDS Around 10% of the accepted papers at CPP 2023 will be designated as Distinguished Papers. This award highlights papers that the CPP program committee thinks should be read by a broad audience due to their relevance, originality, significance and clarity. TOPICS OF INTEREST We welcome submissions in research areas related to formal certification of programs and proofs. The following is a non-exhaustive list of topics of interest to CPP: * certified or certifying programming, compilation, linking, OS kernels, runtime ? systems, security monitors, and hardware; * certified mathematical libraries and mathematical theorems; * proof assistants (e.g, ACL2, Agda, Coq, Dafny, F*, HOL4, HOL Light, Idris, ? Isabelle, Lean, Mizar, Nuprl, PVS, etc); * new languages and tools for certified programming; * program analysis, program verification, and program synthesis; * program logics, type systems, and semantics for certified code; * logics for certifying concurrent and distributed systems; * mechanized metatheory, formalized programming language semantics, and logical ? frameworks; * higher-order logics, dependent type theory, proof theory, logical systems, ? separation logics, and logics for security; * verification of correctness and security properties; * formally verified blockchains and smart contracts; * certificates for decision procedures, including linear algebra, polynomial ? systems, SAT, SMT, and unification in algebras of interest; * certificates for semi-decision procedures, including equality, first-order ? logic, and higher-order unification; * certificates for program termination; * formal models of computation; * mechanized (un)decidability and computational complexity proofs; * formally certified methods for induction and coinduction; * integration of interactive and automated provers; * logical foundations of proof assistants; * applications of AI and machine learning to formal certification; * user interfaces for proof assistants and theorem provers; * teaching mathematics and computer science with proof assistants. SUBMISSION GUIDELINES Prior to the paper submission deadline, the authors should upload their anonymized paper in PDF format through the HotCRP system at https://urldefense.com/v3/__https://cpp2023.hotcrp.com__;!!IBzWLUs!UzlWvMXVOGai-O1NIPaiRpB-OstT5MmHIhWLj55yoeIjY51i_vus7d63BHVefIuprvzgrL2NA1IWqkkqrJfh7tGWjsLUywgbMQ4$ The submissions must be written in English and provide sufficient detail to allow the program committee to assess the merits of the contribution. They must be formatted following the ACM SIGPLAN Proceedings format using the acmart style with the sigplan option, which provides a two-column style, using 10 point font for the main text, and a header for double blind review submission, i.e., \documentclass[sigplan,10pt,anonymous,review]{acmart}\settopmatter{printfolios=true,printccs=false,printacmref=false} The submitted papers should not exceed 12 pages, including tables and figures, but excluding bibliography and clearly marked appendices. The papers should be self-contained without the appendices. Shorter papers are welcome and will be given equal consideration. Submissions not conforming to the requirements concerning format and maximum length may be rejected without further consideration. CPP 2023 will employ a lightweight double-blind reviewing process following the process from previous years. To facilitate this, the submissions must adhere to two rules: (1) author names and institutions must be omitted, and (2) references to authors? own related work should be in the third person (e.g., ??? not "We build on our previous work ..." but rather "We build on the work of ??? ..."). The purpose of this process is to help the PC and external reviewers come to an initial judgment about the paper without bias, not to make it impossible for them to discover the authors if they were to try. Nothing should be done in the name of anonymity that weakens the submission or makes the job of reviewing it more difficult. In particular, important background references should not be omitted or anonymized. In addition, authors are free to disseminate their ideas or draft versions of their papers as usual. For example, authors may post drafts of their papers on the web or give talks on their research ideas. Note that POPL 2023 itself will employ full double-blind reviewing, which differs from the light-weight CPP process.? This FAQ from previous SIGPLAN conference addresses many common concerns: https://urldefense.com/v3/__https://popl20.sigplan.org/track/POPL-2020-Research-Papers*Submission-and-Reviewing-FAQ__;Iw!!IBzWLUs!UzlWvMXVOGai-O1NIPaiRpB-OstT5MmHIhWLj55yoeIjY51i_vus7d63BHVefIuprvzgrL2NA1IWqkkqrJfh7tGWjsLUd_u0YBk$ We strongly encourage the authors to provide any supplementary material that supports the claims made in the paper, such as proof scripts or experimental data. This material must be uploaded at submission time, as an archive, not via a URL. Two forms of supplementary material may be submitted: (1) Anonymous supplementary material is made available to the reviewers before they submit their first-draft reviews. (2) Non-anonymous supplementary material is made available to the reviewers after they have submitted their first-draft reviews and have learned the identity of the authors. Please use anonymous supplementary material whenever possible, so that it can be taken into account from the beginning of the reviewing process. The submitted papers must adhere to the SIGPLAN Republication Policy (https://urldefense.com/v3/__https://www.sigplan.org/Resources/Policies/Republication/__;!!IBzWLUs!UzlWvMXVOGai-O1NIPaiRpB-OstT5MmHIhWLj55yoeIjY51i_vus7d63BHVefIuprvzgrL2NA1IWqkkqrJfh7tGWjsLUb4xuLbk$ ) and the ACM Policy on Plagiarism (https://urldefense.com/v3/__https://www.acm.org/publications/policies/plagiarism__;!!IBzWLUs!UzlWvMXVOGai-O1NIPaiRpB-OstT5MmHIhWLj55yoeIjY51i_vus7d63BHVefIuprvzgrL2NA1IWqkkqrJfh7tGWjsLUfgFnl0I$ ). Concurrent submissions to other conferences, journals, workshops with proceedings, or similar forums of publication are not allowed. The PC chairs should be informed of closely related work submitted to a conference or journal in advance of submission. One author of each accepted paper is expected to present it at the (possibly virtual) conference. PUBLICATION, COPYRIGHT AND OPEN ACCESS The CPP 2023 proceedings will be published by the ACM, and authors of accepted papers will be required to choose one of the following publication options: (1) Author retains copyright of the work and grants ACM a non-exclusive ??? permission-to-publish license and, optionally, licenses the work under a ??? Creative Commons license. (2) Author retains copyright of the work and grants ACM an exclusive ??? permission-to-publish license. (3) Author transfers copyright of the work to ACM. For authors who can afford it, we recommend option (1), which will make the paper Gold Open Access, and also encourage such authors to license their work under the CC-BY license. ACM will charge you an article processing fee for this option (currently, US$700), which you have to pay directly with the ACM. For everyone else, we recommend option (2), which is free and allows you to achieve Green Open Access, by uploading a preprint of your paper to a repository that guarantees permanent archival such as arXiv or HAL. This is anyway a good idea for timely dissemination even if you chose option 1. The official CPP 2023 proceedings will also be available via SIGPLAN OpenTOC (https://urldefense.com/v3/__http://www.sigplan.org/OpenTOC/*cpp__;Iw!!IBzWLUs!UzlWvMXVOGai-O1NIPaiRpB-OstT5MmHIhWLj55yoeIjY51i_vus7d63BHVefIuprvzgrL2NA1IWqkkqrJfh7tGWjsLUUzVxs4o$ ). For ACM?s take on this, see their Copyright Policy (https://urldefense.com/v3/__http://www.acm.org/publications/policies/copyright-policy__;!!IBzWLUs!UzlWvMXVOGai-O1NIPaiRpB-OstT5MmHIhWLj55yoeIjY51i_vus7d63BHVefIuprvzgrL2NA1IWqkkqrJfh7tGWjsLUPJiz_vg$ ) and Author Rights (https://urldefense.com/v3/__http://authors.acm.org/main.html__;!!IBzWLUs!UzlWvMXVOGai-O1NIPaiRpB-OstT5MmHIhWLj55yoeIjY51i_vus7d63BHVefIuprvzgrL2NA1IWqkkqrJfh7tGWjsLU3WXyNTY$ ). PROGRAM COMMITTEE Steve Zdancewic, University of Pennsylvania, USA (co-chair) Brigitte Peintka, McGill University, Canada (co-chair) Reynald Affeldt, AIST, Japan Tej Chajed, MIT, USA Koen Claessen, Chalmers, Sweden Ranald Clouston, ANU, Australia Leonardo de Moura, Microsoft Research, USA Xinyu Feng, Nanjing University, China Denis Firsov, Tallinn University/GuardTime, Estonia Yannick Forster, Inria Nantes, France Milos Gligoric, UT Austin, USA Stephane Graham-Lengrand, SRI, USA Elsa Gunter, Univerisity of Illinois Urbana-Champaign, USA Chris Hawblitzel, Microsoft Research, US Chantal Keller , Universit? Paris Saclay, France Marie Kerjean, CNRS, France Yoonseung Kim, Seoul National University, Korea Kenji Maillard, INRIA, France C?sar Mu?oz, Amazon Web Services, USA Tobias Nipkow, Technical University of Munich, Germany Lawrence Paulson, Cambridge, UK Pierre-Marie P?drot, INRIA, France Anja Petkovi? Komel, TU Wien, Vienna Cl?ment Pit-Claudel, EPFL, France Christine Rizkallah, University of Melbourne, Australia Cody Roux, AWS, USA Kazuhiko Sakaguchi, University of Tsukuba, Japan Anna Slobodova, Intel, USA Aaron Stump, University of Iowa, USA Ren? Thiemann, University of Innsbruck, Austria Amin Timany, Aarhus University, Denmark Josef Urban, CIIRC (Prague), Czech Republic Viktor Vafeiadis, MPI-SWS, Germany Yuting Wang, Shanghai Jiao Tong University, China Tjark Weber, Uppsala University, Sweden ORGANIZERS Dmitriy Traytel, University of Copenhagen, Denmark (conference co-chair) Robbert Krebbers, Radboud University, Netherlands (conference co-chair) Brigitte Peintka, McGill University, Canada (PC co-chair) Steve Zdancewic, University of Pennsylvania, United States (PC co-chair) CONTACT For any questions please contact the two PC chairs: Steve Zdancewic Brigitte Pientka From cezara.dragoi at inria.fr Tue Aug 16 11:05:46 2022 From: cezara.dragoi at inria.fr (Cezara) Date: Tue, 16 Aug 2022 17:05:46 +0200 Subject: [TYPES/announce] VMCAI 2023 Call for Papers Message-ID: VMCAI 2023 Call for Papers VMCAI 2023 is the 24th International Conference on Verification, Model Checking, and Abstract Interpretation. The conference will be held during January 15-17, 2023 (colocated with POPL 2023). VMCAI provides a forum for researchers from the communities of Verification, Model Checking, and Abstract Interpretation, facilitating interaction, cross-fertilization, and advancement of hybrid methods that combine these and related areas. Important Dates All deadlines are AoE (Anywhere on Earth). * Paper submission: September 8th, 2022 * Artifact submission: September 15th, 2022 * Notification: October 13th, 2022 * Camera-ready version due: November 10th, 2022 Paper Submission All paper submissions will undergo a single-blind review process and will be judged on the basis of significance, relevance, correctness, originality, and clarity. Submission link: https://urldefense.com/v3/__https://easychair.org/my/conference?conf=vmcai2023__;!!IBzWLUs!W1HLE1_Ymt2mxEg5R9xV6tklB02iw9rnLZspkIgJl6Eg9hlIdB4DzWMDzqTZkA-7TNXjXiIzQ3-8pjaV0vfp_wEmbQoYxU8isDiKYdA$ Regular papers (20 pages max.) Tool papers (12 pages max.) Case study (20 pages max. All submissions will be in Springer LNCS style. Artifacts As in previous years, we encourage authors to submit a virtual machine image containing any artifacts and evaluations presented in the paper. Artifact submission is optional. Artifact evaluation will be concurrent with paper review. The full CFP at https://urldefense.com/v3/__https://vmcai-2023.github.io/call-for-papers__;!!IBzWLUs!W1HLE1_Ymt2mxEg5R9xV6tklB02iw9rnLZspkIgJl6Eg9hlIdB4DzWMDzqTZkA-7TNXjXiIzQ3-8pjaV0vfp_wEmbQoYxU8iFTAFhKU$ has additional details. -------------- next part -------------- An HTML attachment was scrubbed... URL: From maietti at math.unipd.it Tue Aug 16 17:04:05 2022 From: maietti at math.unipd.it (Maria Emilia Maietti) Date: Tue, 16 Aug 2022 23:04:05 +0200 Subject: [TYPES/announce] CCC2022 - 3rd call for contributions - deadline extended to 23rd August In-Reply-To: <4bf16e39-7f52-bf38-2cdf-7ada4b36a853@math.unipd.it> References: <4bf16e39-7f52-bf38-2cdf-7ada4b36a853@math.unipd.it> Message-ID: <58c499ab-c4b8-50c3-ccc9-8a43c18745c8@math.unipd.it> 3rd CALL FOR? CONTRIBUTIONS: CCC 2022: Continuity, Computability, Constructivity ? From Logic to Algorithms ???????????????? Dedicated to Dieter Spreen on the Occasion of his 75th Birthday Department of Mathematics and?? ONLINE Padova, Italy, September 19-23, 2022 A special session in honor of Dieter Spreen's birthday will be held on 23rd September. ============================================== Submission link https://urldefense.com/v3/__https://easychair.org/conferences/?conf=ccc20220__;!!IBzWLUs!QIm0v4_3wTEXuHz9gAoMNzXI8MyhaSSLS0pfi0xq3_OgJj8mPxHgpEhMxnp0HWOXrxZkwIARhBMzHrW_M-8A_YPHw9zS0ttKd-8$ Submission deadline:??? August 23, 2022 Nofication of acceptance:?? August 26, 2022 ==================================================== CCC is a workshop series that brings together researchers applying logical methods to the development of algorithms, with a particular focus on computation with infinite data, where issues of continuity, computability and constructivity play major roles. Specific topics include exact real number computation, computable analysis, effective descriptive set theory, constructive analysis and topology, and related areas. The overall aim is to apply logical methods in these disciplines to provide a sound foundation for obtaining exact and provably correct algorithms for computations with real numbers and other continuous data, which are of increasing importance in safety-critical applications and scientific computation. Participation is welcome in person or online. Previous workshops have been held in Cologne 2009, Trier 2012, Gregynog 2013, Ljubljana 2014, Kochel 2015, Nancy 2017, Faro 2018, Ljubljana 2019, Faro 2020 (online), Birmingham 2021 (online). ===================================================================== Submission Guidelines The workshop invites all contributions relating to computation where issues of continuity, computability and constructivity play major roles. Specific areas of interest include: ??? Exact real number computation ??? Correctness of algorithms on infinite data ??? Computable analysis ??? Complexity of real numbers, real-valued functions, etc. ??? Effective descriptive set theory ??? Domain theory ??? Constructive analysis and topology ??? Constructive foundations ??? Category-theoretic approaches to computation on infinite data ??? Weihrauch degrees ??? Other related areas. Extended abstracts (1-2 pages) should be submitted in pdf format. A post-proceedings volume will be published in the open-access journal Logical Methods in Computer Science. =============================================== Tutorial speakers: ??? Alexander Miquel (Universidad de La Republica, Uruguay) ??? Linda Westrick (Penn State University, USA) Invited speakers: ??? Miko?aj Boja?czyk (Warsaw, Poland) ??? Tatsuji Kawai (JAIST, Japan) ??? Michael Rathjen (Leeds, UK) ??? Andreas Rauh (Oldenburg, Germany) ======================================================== Program Committee ??? Pieter Collins (Maastricht, Netherlands) ??? Achim Jung (Birmingham, UK) ??? Maria Emilia Maietti (Padova, Italy)? (chair) ??? Arno Pauly (Swansea, UK) ??? Alex Simpson (Ljubljana, Slovenia) ??? Holger Thies (Kyoto, Japan) ??? Chuangjie Xu (Munich, Germany) ??? Ning Zhong (Cincinnati, USA) ??? Martin Ziegler (KAIST, Republic of Korea) Organizing committee ??? Francesco Ciraulo (Padova, Italy) ??? Maria Emilia Maietti (Padova, Italy) ??? Samuele Maschio (Padova, Italy) ??? Pietro Sabelli (Padova, Italy) Contact All questions about submissions should be emailed to ccc22 at math.unipd.it From elenatalita at gmail.com Wed Aug 17 08:50:10 2022 From: elenatalita at gmail.com (Elena Di Lavore) Date: Wed, 17 Aug 2022 15:50:10 +0300 Subject: [TYPES/announce] SYCO 9 - Call for participation Message-ID: -------------------------------------------------------- CALL FOR PARTICIPATION NINTH SYMPOSIUM ON COMPOSITIONAL STRUCTURES (SYCO 9) In person at University of Insubria, Como, Italy 8-9 September 2022 Registration deadline: 1 September 2022 (AoE) It is possible to attend online, but not to present online. Please register even when attending online. https://urldefense.com/v3/__https://www.cl.cam.ac.uk/events/syco/9/__;!!IBzWLUs!XJ4KqHBgbd3D9ICChy2iWPDl0hiLW_hNrAxhOi5-C8qhD11HP14ZkLtkfmfMI7S3rZmii-YFNhrI6iyI9IID8GeY2Bu0TVDKj-0$ -------------------------------------------------------- The Symposium on Compositional Structures (SYCO) is an interdisciplinary series of meetings aiming to support the growing community of researchers interested in the phenomenon of compositionality, from both applied and abstract perspectives, and in particular where category theory serves as a unifying common language. Previous SYCO events have been held at University of Birmingham, University of Strathclyde, University of Oxford, Chapman University, University of Leicester and Tallinn University of Technology. The programme consists of 2 invited talks and 14 contributed talks. -------------------------------------------------------- INVITED TALKS * Robert Furber (University of Edinburgh) - TBA * Olivia Caramello (University of Insubria) - Relative toposes as a generalization of locales -------------------------------------------------------- CONTRIBUTED TALKS Full schedule available at https://urldefense.com/v3/__https://www.cl.cam.ac.uk/events/syco/9/__;!!IBzWLUs!XJ4KqHBgbd3D9ICChy2iWPDl0hiLW_hNrAxhOi5-C8qhD11HP14ZkLtkfmfMI7S3rZmii-YFNhrI6iyI9IID8GeY2Bu0TVDKj-0$ * Jakob von Raumer - String Diagrams for Strings and Rings * Matthew Earnshaw and Pawe? Soboci?ski - Regular Monoidal Languages * Paolo Perrone - Lifting weights: enriched lenses between transport plans * Simona Paoli - Weak Globularity: a New Paradigm to Weaken Higher Categorical Structures * Jade Master - How to Compose Shortest Paths * Malin Altenm?ller and Ross Duncan - A Category of Plane Graphs * Sebastian Stengele, Tobias Reinhart, Tom?? Gonda and Gemma De Las Cuevas - A Framework for Universality Across Disciplines * Morgan Rogers - Continuous monoid homomorphisms and geometric morphisms * Calin Tataru - Cubicalisation: an algorithm for generating cubical meshes from homotopy.io diagrams * Niels Voorneveld - Cylinder Diagrams: Visualizing Multi-Parameter Natural Transformations * Mattia G. Bergomi and Pietro Vertechi - Neural network layers as parametric spans * Nathanael Arkor - Relative monads and their many guises * Lia Yeh - Conversation Logic: The Interplay of Negation, Conjunction, Disjunction, and Lexical Entailment * Dylan Braithwaite and Jules Hedges - Dependent Bayesian Lenses: Categories of Bidirectional Markov Kernels with Canonical Bayesian Inversion -------------------------------------------------------- REGISTRATION Registration is open until the 1st of September, 2022. You can register for either the in person meeting or for the online event. Please register via: https://urldefense.com/v3/__https://forms.gle/NURaeCEVsfpfZTJp9__;!!IBzWLUs!XJ4KqHBgbd3D9ICChy2iWPDl0hiLW_hNrAxhOi5-C8qhD11HP14ZkLtkfmfMI7S3rZmii-YFNhrI6iyI9IID8GeY2Bu0GOhX-bo$ Registration is free. More details are available on the conference website: https://urldefense.com/v3/__https://www.cl.cam.ac.uk/events/syco/9/__;!!IBzWLUs!XJ4KqHBgbd3D9ICChy2iWPDl0hiLW_hNrAxhOi5-C8qhD11HP14ZkLtkfmfMI7S3rZmii-YFNhrI6iyI9IID8GeY2Bu0TVDKj-0$ -------------------------------------------------------- COVID-19 SITUATION IN ITALY It is mandatory to wear FFP2 masks on all public transport in Italy. It is strongly recommended to wear them in all public places, including the university. At the moment, there are no restrictions for entering Italy. More information at https://urldefense.com/v3/__https://www.viaggiaresicuri.it/approfondimenti-insights/saluteinviaggio__;!!IBzWLUs!XJ4KqHBgbd3D9ICChy2iWPDl0hiLW_hNrAxhOi5-C8qhD11HP14ZkLtkfmfMI7S3rZmii-YFNhrI6iyI9IID8GeY2Bu0OnIGvoM$ (only in Italian). -------------------------------------------------------- PROGRAMME COMMITTEE Robin Cockett, University of Calgary Elena Di Lavore, Tallinn University of Technology Ross Duncan, University of Strathclyde Robert Furber, University of Edinburgh Amar Hadzihasanovic, Tallinn University of Technology Chris Heunen, University of Edinburgh Alex Kissinger, University of Oxford Martha Lewis, University of Bristol Jade Master, University of Strathclyde Konstantinos Meichanetzidis, Quantinuum Samuel Mimram, ?cole Polytechnique Simona Paoli, University of Aberdeen Mehrnoosh Sadrzadeh, University College London Pawel Sobocinski, Tallinn University of Technology Jamie Vicary, University of Cambridge John van de Wetering, Radboud University (chair) -------------------------------------------------------------- STEERING COMMITTEE Ross Duncan, University of Strathclyde Chris Heunen, University of Edinburgh Dominic Horsman, University of Grenoble Aleks Kissinger, University of Oxford Samuel Mimram, Ecole Polytechnique Simona Paoli, University of Aberdeen Mehrnoosh Sadrzadeh, University College London Pawel Sobocinski, Tallinn University of Technology Jamie Vicary, University of Cambridge From sperber at deinprogramm.de Tue Aug 23 07:46:58 2022 From: sperber at deinprogramm.de (Michael Sperber) Date: Tue, 23 Aug 2022 13:46:58 +0200 Subject: [TYPES/announce] Functional Art, Music, Modeling and Design (FARM 2022) Sep 15: Call for Participation Message-ID: =============================================================================== 10th ACM SIGPLAN International Workshop on Functional Art, Music, Modelling and Design (FARM) Ljubljana, Slovenia, 15th September 2022 https://urldefense.com/v3/__https://functional-art.org/2022/__;!!IBzWLUs!RHXQacBlTyNNML0zWieZi7O_BUAEK0hLeQvsGvrWDBCC3_j8hW50IKi9JuLGx0FiFWI9ceomY7B76qRfhu7v6LfPLIJsVfT5IPdD$ =============================================================================== The ACM SIGPLAN International Workshop on Functional Art, Music, Modelling and Design (FARM) gathers together people who are harnessing functional techniques in the pursuit of creativity and expression. Functional Programming has emerged as a mainstream software development paradigm, and its artistic and creative use is booming. A growing number of software toolkits, frameworks and environments for art, music and design now employ functional programming languages and techniques. FARM is a forum for exploration and critical evaluation of these developments, for example to consider potential benefits of greater consistency, tersity, and closer mapping to a problem domain. FARM 2022 will feature an afternoon session of demos, and an evening session with a keynote and live performances. Registration ------------ You can register via the ICFP 2022 registration: https://urldefense.com/v3/__http://icfp22.sigplan.org/attending/registration__;!!IBzWLUs!RHXQacBlTyNNML0zWieZi7O_BUAEK0hLeQvsGvrWDBCC3_j8hW50IKi9JuLGx0FiFWI9ceomY7B76qRfhu7v6LfPLIJsVVdh55HG$ Don't be confused that it says ~ICFP~ - FARM is part of a larger event around ICFP 2022, and you can register for FARM without registering for ICFP. If you've registered for ICFP on Sep 15, this includes admissions for the keynote and performance evening. The event is open to the public for a small admissions fee. Keynote ------- Ida Hir?enfelder will hold the keynote. Accepted demos --------------- John Leo Counterpoint Analysis and Synthesis Oleg Kiselyov, Toshihiro Nakayama New View on Plasma Fractals ? From the High Point of Array Languages Live Performances ----------------- FARM 2022 will feature a session of live performances: Rob Canning Fold Yer Loops! Enrico Dorigatti Xeno Francesco Corvi aka Nesso Live coding with Adapt Luka Prin?i? Algoforte Flor De Fuego Specific site: remembering is never a faithful copy Workshop Organisation --------------------- 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) From caterina.urban at ens.fr Tue Aug 23 15:38:48 2022 From: caterina.urban at ens.fr (Caterina Urban) Date: Tue, 23 Aug 2022 21:38:48 +0200 Subject: [TYPES/announce] Postdoc and PhD positions in Paris in collaboration with Fujitsu Japan Message-ID: <253EF6A1-7A86-4C4F-81C9-4723B9811643@ens.fr> Fully funded PhD positions in Computer Science as well as postdoc positions are available in Paris in the context of a collaboration with Fujitsu Japan on the design and development of practical formal verification methods for machine learning. Ideal candidates should be motivated and committed to research and have a strong background in formal methods, ideally static analysis, or in machine learning. Postdocs will be encouraged to also carry out their own research agenda. The start date is any time, but the sooner the better. Postdoc positions are for 2 years and renewable. PhD positions are for 3 years in France (1 year extension is typically accepted). PhD students and postdocs will be based in the Inria research team ANTIQUE at ?cole Normale Sup?rieure in Paris, and will have the opportunity (but not an obligation) to teach (in French or even in English). Knowledge of French is helpful to navigate the city but absolutely not necessary (free French courses are available at the university, if interested). Research visits to Fujitsu Japan will be possible and encouraged. Interested people should contact me via email (caterina.urban at inria.fr). Applications may contain some of the following: CV, motivation letter, references or recommendation letters, transcripts of grades for master?s studies, links to publications or MSc thesis if relevant. From sobocinski at gmail.com Thu Aug 25 03:18:35 2022 From: sobocinski at gmail.com (Pawel Sobocinski) Date: Thu, 25 Aug 2022 10:18:35 +0300 Subject: [TYPES/announce] CfP: FoSSaCS '23: 26th International Conference on Foundations of Software Science and Computation Structures Message-ID: <763A7D51-9387-44BB-91A5-E0BF35DA18CE@gmail.com> ********************************************************************* CALL FOR PAPERS FoSSaCS '23: 26th International Conference on Foundations of Software Science and Computation Structures 24-27 April 2023 Part of 26th European Joint Conferences on Theory and Practice of Software ETAPS 2023 https://urldefense.com/v3/__https://etaps.org/2023/fossacs__;!!IBzWLUs!QRZsztqBx_Z3cPbi2Gd7ObPwdTxYQpZMNW53kG7ckmn1yQx27aywj25adVVUz9oLXfzRX2T2zHm4a1OaAIn0K6NPLDJ7SOUgbA$ Programme Committee Co-chairs Orna Kupferman (Hebrew University of Jerusalem) Pawel Sobocinski (Tallinn University of Technology) ********************************************************************* IMPORTANT DATES Paper submission: October 13, 2022, 23:59 AoE Rebuttal period: December 6 - December 8, 2022 Paper notification: December 22, 2022 For the first time, FoSSaCS welcomes voluntary submissions of artefacts such as formalized proofs for evaluation after paper acceptance; the outcome will not change the paper acceptance decision. Artefact submission deadline: January 5, 2023 Artefact notification: February 9, 2023 ********************************************************************* FoSSaCS seeks original papers on foundational research with a clear significance for software science. The conference invites submissions on theories and methods to support the analysis, integration, synthesis, transformation, and verification of programs and software systems. The specific topics covered by the conference include, but are not limited to, the following: - categorical models and logics; - language theory, automata, and games; - modal, spatial, and temporal logics; - type theory and proof theory; - concurrency theory and process calculi; - rewriting theory; - semantics of programming languages; - program analysis, correctness, transformation, verification, and synthesis; - logics of programming; - emerging models of computation; - logical aspects of computational complexity; - models of system security; - logical foundations of databases ********************************************************************* SUBMISSION INSTRUCTIONS https://urldefense.com/v3/__https://easychair.org/conferences/?conf=fossacs2023__;!!IBzWLUs!QRZsztqBx_Z3cPbi2Gd7ObPwdTxYQpZMNW53kG7ckmn1yQx27aywj25adVVUz9oLXfzRX2T2zHm4a1OaAIn0K6NPLDKW9fKX0Q$ All accepted papers will appear in the proceedings and have presentations during the conference. We plan FoSSaCS 2023 as an on-site conference; nonetheless, remote attendance and presentation will be made possible. Submissions must follow the formatting guidelines of Springer's LNCS, be *at most 18 pages in length* (bibliography included) and be submitted electronically in pdf through the Easychair author interface linked above. Submissions not adhering to the specified format and length may be rejected immediately. Submitted papers must be in English, presenting original research. They must be unpublished and not submitted for publication elsewhere. ********************************************************************* PROGRAMME COMMITTEE Marco Carbone (IT University of Copenhagen) Ugo Dal Lago (Universit? di Bologna and INRIA Sophia Antipolis) Alwen Tiu (The Australian National University) Shahar Maoz (Tel Aviv University) Marco Gaboardi (Boston University) Patrick Baillot (CNRS and Lille) Frank Valencia (LIX, Ecole Polytechnique) Kuldeep S. Meel (National University of Singapore) Emmanuel Filiot (Universit? Libre de Bruxelles) Joel Ouaknine (Max Planck Institute for Software Systems) Filip Murlak (University of Warsaw) Alexandra Silva (Cornell University) Lars Birkedal (Aarhus University) Stefan Milius (FAU Erlangen) Koko Muroya (RIMS, Kyoto University) Barbara K?nig (University of Duisburg-Essen) Thomas Colcombet (CNRS) Bartek Klin (University of Oxford) Bart Jacobs (Radboud University) Assia Mahboubi (INRIA) Sam Staton (University of Oxford) Parosh Aziz Abdulla (Uppsala University) Daniele Varacca (Universit? Paris-Est Cr?teil) Giovanni Bacci (Aalborg University) V?ronique Bruy?re (University of Mons) Nathalie Bertrand (INRIA) -------------- next part -------------- An HTML attachment was scrubbed... URL: From m.seisenberger at swansea.ac.uk Thu Aug 25 18:30:59 2022 From: m.seisenberger at swansea.ac.uk (Monika Seisenberger) Date: Thu, 25 Aug 2022 22:30:59 +0000 Subject: [TYPES/announce] Senior Lectureship in Computer Science at Swansea University Message-ID: Dear Colleagues, The Computer Science Department at Swansea University is looking for a senior lecturer in Computer Science - any direction - please see below the link - deadline 31 August 2022. https://urldefense.com/v3/__https://www.swansea.ac.uk/computational-foundry/working-at-comp-foundry/__;!!IBzWLUs!SaxDyHVzUYxkb13BYt3tx8e2t7LPQCfY3jzWaUsU1peGhPqypEkbhnPy3n66tguejDu9Cm0fQchisEk8mKd3napB1uWejj6s1F7FZmn2dQqF$ Applications in Theoretical Computer Science are very welcome. https://urldefense.com/v3/__https://www.cs.swansea.ac.uk/theory/__;!!IBzWLUs!SaxDyHVzUYxkb13BYt3tx8e2t7LPQCfY3jzWaUsU1peGhPqypEkbhnPy3n66tguejDu9Cm0fQchisEk8mKd3napB1uWejj6s1F7FZgehTu3T$ Kind regards, Monika -- Dr Monika Seisenberger Head of Theoretical Computer Science Deputy Head of Department, Department of Computer Science Swansea University -------------- next part -------------- An HTML attachment was scrubbed... URL: From paolo.pistone at uniroma3.it Fri Aug 26 05:28:55 2022 From: paolo.pistone at uniroma3.it (Paolo Pistone) Date: Fri, 26 Aug 2022 09:28:55 +0000 Subject: [TYPES/announce] R: Call for Participation: Online Workshop Series "Proofs, Computation and Meaning" In-Reply-To: References: Message-ID: *Apologies for cross postings* ******************************************************************************* Second Call For Participation: Online Workshop Series "Proofs, Computation and Meaning" Online events: September 7, September 28 and December 7, 2022 Website: https://urldefense.com/v3/__http://ls.informatik.uni-tuebingen.de/pcm-online/__;!!IBzWLUs!QgWjwYc0PXbtDgc_opPhEQf4y3FAjLEPhrMIY64XNGqh5blugak0SUlKNPg7TdPEWzZp92pbbWvd4XJPN2usOQLcOSX5_fP8gNzxP_b8mg$ ******************************************************************************* This online workshop series was originally planned as an in person meeting which was canceled due to the outbreak of the Coronavirus pandemic in early March 2020. The event was planned to bring researchers whose work focuses on the notion of formal proof from either a philosophical, computational or mathematical perspective. With the obvious limitations of an online format, we wish to keep this original motivation, which looks even more timely in a time in which interdisciplinary interactions are made more difficult by the pandemic. The goal is that of creating an opportunity for members of different communities to interact and exchange their views on proofs, their identity conditions, and the more convenient ways of representing them formally. ******************************************************************************* SCOPE: Around thirty years after the fall of Hilbert's program, the proofs-as-programs paradigm established the view that a proof should not be identified, as in Hilbert's metamathematics, with a string of symbols in some formal system. Rather, proofs should consist in computational or epistemic objects conveying evidence to mathematical propositions. The relationship between formal derivations and proofs should then be analogous to the one between words and their meanings. This view naturally gives rise to questions such as ?which conditions should a formal arrangement of symbols satisfy to represent a proof?? or ?when do two formal derivations represent the same proof?". These questions underlie past and current research in proof theory both in the theoretical computer science community (e.g. categorical logic, domain theory, linear logic) and in the philosophy community (e.g. proof-theoretic semantics). In spite of these common motivations and historical roots, it seems that today proof theorists in philosophy and in computer science are losing sight of each other. This workshop aims at contributing to a renaissance of the interaction between researchers with different backgrounds by establishing a constructive environment for exchanging views, problems and results. ******************************************************************************* ORGANIZATION: The workshop series includes three events, each focusing on one specific aspect of proofs and their representation. To foster interaction and discussion, each event will consists in short talks followed by a 15 minutes slot during which participants can engage in discussion or just take a short break. 1. Infinity and co-inductive proofs September 7, 10-13 am (CET) In Hilbert's program, the role of proof theory was that of assuring a solid finitistic foundations for the use of infinitary concepts in mathematics. By contrast, and somehow paradoxically, the development of the discipline led to the study of proof systems explicitly incorporating infinitary ideas such as impredicativity, co-induction and other constructions. Speakers: - Laura Crosilla (University of Oslo) - Hidenori Kurokawa (Kanazawa University) - David Binder (University of T?bingen) - Gilda Ferreira (Lisbon University) 2. On the syntax of proofs September 28, 4-7 pm (CET) Both in natural deduction and in sequent calculs, as well as in their associated type systems, the rules of the standard connectives have been generalized in various ways, thereby obtaining proof-theoretic characterizations of various families of connectives or more generally of data type constructors. Although the motivations for such generalizations are apparently very different (ranging from considerations about the inherent duality of the calculi, to the relation between syntax and semantics, to questions arising in the study of proof-search strategies), they often have a lot in common. Speakers: - Gabriel Scherer (INRIA Paris-Saclay) - Bahareh Afshari (University of Gothenburg) - Herman Geuvers (Nijmegen & Eindhoven University) - Iris van der Giessen (Utrecht University) - Matteo Acclavio (Universit? Roma Tre) 3. On the nature of proofs December 7, 4-6 pm (CET) The developments of logic, and of proof theory in particular, have lead us to look at proofs primarily through the lens of various formal systems, such as natural deduction, sequent calculus, tableaux, proof nets etc. Yet, is it possible to investigate the nature of proofs, their identity conditions, their relations with computation and with meaning in a direct way, i.e. independently of the choice of a particular formal system? Speakers: - Noam Zeilberger (INRIA Paris-Saclay) - Alberto Naibo (Paris 1 University) - Antonio Piccolomini d'Aragona (Aix-Marseille University) ******************************************************************************* CALL FOR PARTICIPATION: If you wish to attend, please send an e-mail to luca.tranchini at gmail.com or paolo.pistone at uniroma3.it. ________________________________ Da: Paolo Pistone Inviato: luned? 11 luglio 2022 14:43 Oggetto: Call for Participation: Online Workshop Series "Proofs, Computation and Meaning" *Apologies for cross postings* ******************************************************************************* Call For Participation: Online Workshop Series "Proofs, Computation and Meaning" Online events: September 7, September 28 and December 7, 2022 ******************************************************************************* This online workshop series was originally planned as an in person meeting which was canceled due to the outbreak of the Coronavirus pandemic in early March 2020. The event was planned to bring researchers whose work focuses on the notion of formal proof from either a philosophical, computational or mathematical perspective. With the obvious limitations of an online format, we wish to keep this original motivation, which looks even more timely in a time in which interdisciplinary interactions are made more difficult by the pandemic. The goal is that of creating an opportunity for members of different communities to interact and exchange their views on proofs, their identity conditions, and the more convenient ways of representing them formally. ******************************************************************************* SCOPE: Around thirty years after the fall of Hilbert's program, the proofs-as-programs paradigm established the view that a proof should not be identified, as in Hilbert's metamathematics, with a string of symbols in some formal system. Rather, proofs should consist in computational or epistemic objects conveying evidence to mathematical propositions. The relationship between formal derivations and proofs should then be analogous to the one between words and their meanings. This view naturally gives rise to questions such as ?which conditions should a formal arrangement of symbols satisfy to represent a proof?? or ?when do two formal derivations represent the same proof?". These questions underlie past and current research in proof theory both in the theoretical computer science community (e.g. categorical logic, domain theory, linear logic) and in the philosophy community (e.g. proof-theoretic semantics). In spite of these common motivations and historical roots, it seems that today proof theorists in philosophy and in computer science are losing sight of each other. This workshop aims at contributing to a renaissance of the interaction between researchers with different backgrounds by establishing a constructive environment for exchanging views, problems and results. ******************************************************************************* ORGANIZATION: The workshop series includes three events, each focusing on one specific aspect of proofs and their representation. To foster interaction and discussion, each event will consists in short talks followed by a 15 minutes slot during which participants can engage in discussion or just take a short break. 1. Infinity and co-inductive proofs September 7, 10 am (CET) In Hilbert's program, the role of proof theory was that of assuring a solid finitistic foundations for the use of infinitary concepts in mathematics. By contrast, and somehow paradoxically, the development of the discipline led to the study of proof systems explicitly incorporating infinitary ideas such as impredicativity, co-induction and other constructions. Speakers: - Laura Crosilla (University of Oslo) - Hidenori Kurokawa (Kanazawa University) - David Binder (University of T?bingen) - Gilda Ferreira (Lisbon University) 2. On the syntax of proofs September 28, 4 pm (CET) Both in natural deduction and in sequent calculs, as well as in their associated type systems, the rules of the standard connectives have been generalized in various ways, thereby obtaining proof-theoretic characterizations of various families of connectives or more generally of data type constructors. Although the motivations for such generalizations are apparently very different (ranging from considerations about the inherent duality of the calculi, to the relation between syntax and semantics, to questions arising in the study of proof-search strategies), they often have a lot in common. Speakers: - Gabriel Scherer (INRIA Paris-Saclay) - Bahareh Afshari (University of Gothenburg) - Herman Geuvers (Nijmegen & Eindhoven University) - Iris van der Giessen (Utrecht University) - Matteo Acclavio (Universit? Roma Tre) 3. On the nature of proofs December 7, 4 pm (CET) The developments of logic, and of proof theory in particular, have lead us to look at proofs primarily through the lens of various formal systems, such as natural deduction, sequent calculus, tableaux, proof nets etc. Yet, is it possible to investigate the nature of proofs, their identity conditions, their relations with computation and with meaning in a direct way, i.e. independently of the choice of a particular formal system? Speakers: - Noam Zeilberger (INRIA Paris-Saclay) - Alberto Naibo (Paris 1 University) - Antonio Piccolomini d'Aragona (Aix-Marseille University) ******************************************************************************* CALL FOR PARTICIPATION: If you wish to attend, please send an e-mail to luca.tranchini at gmail.com or paolo.pistone at uniroma3.it. A link to access the online events will be shared later. -------------- next part -------------- An HTML attachment was scrubbed... URL: From ugo.dallago at unibo.it Sun Aug 28 10:21:52 2022 From: ugo.dallago at unibo.it (Ugo Dal Lago) Date: Sun, 28 Aug 2022 14:21:52 +0000 Subject: [TYPES/announce] FoPSS 2023 - Preliminary Announcement and Call for Participation Message-ID: We are very pleased to spread the first information about the 4th edition of the School on Foundations of Programming and Software Systems, to be held in Bertinoro on February 13-17, 2023. This will be the first edition of the school after the beginning of the COVID pandemic. The previous editions of the school took place in Porto [1], Oxford [2], and Warsaw [3]. The school is oriented to Master and PhD students, and to young scholars. It will be held at CEUB [4], which can be reached from Bologna in about 90 minutes. (We are considering, depending on the number of participants, to organize bus transfers to and from Bologna Airport on February 12 and 18, 2023). The main theme of this edition of FoPSS are the quantitative aspects of program semantics, verification, and transformation. The following researchers have accepted to give short courses or seminars as part of the school: Deepak Garg (MPI-SWS), on "Resource Analysis Using Types" Marco Gaboardi (Boston University), on "Relational Reasoning for Security and Privacy" Benjamin Kaminski (Saarland University), on "Quantitative Verification, Transformer-style" Delia Kesner (Universit? de Paris), on "Quantitative Types for Higher-Order Programming Languages" Aleks Kissinger (Oxford), on "Picturing Quantum Software" Damiano Mazza (CNRS), on "Introduction to Differentiable Programming" Prakash Panangaden (McGill), on "Bisimulation Metrics and Variations with Applications to Representation Learning" Christin Tasson (Sorbonne Universit?), on "Probabilistic Program Semantics" Valeria Vignudelli (CNRS), on "Equational Theories for Probabilistic Effects" Registration will cover participation to the school and accommodation at CEUB with half board. Thanks to the help of sponsors (including ETAPS, SIGLOG, SIGPLAN, the University of Bologna, and the DIAPASoN Project), we plan to keep the registration fee as low as possible. The reception capacity of the CEUB is big, but subject to limits. We therefore encourage those interested in participating to the school to pre-register by following the link below [5] and fill the form *by September 22, 2022*. This we will us to keep track of the numbers. A web page with more detailed information will soon be ready and accessible via [5]. We would be happy to answer any questions about the organization of the school. Just send us an email! Looking forward to seeing you in Bertinoro. Best Regards, Ugo Dal Lago, Francesco Gavazzo, Paolo Pistone. [1] https://urldefense.com/v3/__https://probprogschool2017.di.uminho.pt/__;!!IBzWLUs!QKTVEoBmwAruU5WiIIQ6HCZ7hKhPYNyQ6W0U21W3qdfAtre-Cg3WFMkBOxIf_3fCqg7fAEplu6ZLo9wQfG6bSVGL3zX1uS0BtEGj$ [2] https://urldefense.com/v3/__https://www.floc2018.org/fopss/__;!!IBzWLUs!QKTVEoBmwAruU5WiIIQ6HCZ7hKhPYNyQ6W0U21W3qdfAtre-Cg3WFMkBOxIf_3fCqg7fAEplu6ZLo9wQfG6bSVGL3zX1ub660Obb$ [3] https://urldefense.com/v3/__https://www.mimuw.edu.pl/*fopss19/__;fg!!IBzWLUs!QKTVEoBmwAruU5WiIIQ6HCZ7hKhPYNyQ6W0U21W3qdfAtre-Cg3WFMkBOxIf_3fCqg7fAEplu6ZLo9wQfG6bSVGL3zX1uUPgRwgv$ [4] https://urldefense.com/v3/__https://www.ceub.it/?lang=en__;!!IBzWLUs!QKTVEoBmwAruU5WiIIQ6HCZ7hKhPYNyQ6W0U21W3qdfAtre-Cg3WFMkBOxIf_3fCqg7fAEplu6ZLo9wQfG6bSVGL3zX1uU0IUt_E$ [5] https://urldefense.com/v3/__https://forms.gle/Z5sinvogkApZrgqaA__;!!IBzWLUs!QKTVEoBmwAruU5WiIIQ6HCZ7hKhPYNyQ6W0U21W3qdfAtre-Cg3WFMkBOxIf_3fCqg7fAEplu6ZLo9wQfG6bSVGL3zX1uSFuRCmM$ -------------- next part -------------- An HTML attachment was scrubbed... URL: From emilio.tuosto at gssi.it Mon Aug 29 07:10:52 2022 From: emilio.tuosto at gssi.it (emilio.tuosto at gssi.it) Date: Mon, 29 Aug 2022 04:10:52 -0700 (PDT) Subject: [TYPES/announce] Last CfP: FM 2023 - 25th International Symposium on Formal Methods (strict deadline: Sept. 4, 2022) Message-ID: <630c9ebc.df0a0220.7a699.7c02@mx.google.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!T9o6OwGXhaIfnKOz28gHtZ-U4Ts8Hsry67J2dw5V2pUSfmXzo3eExxppM_9s7VkUMHhtwluV2HbzIHXbVWukHwekxJdOC27f3Sz5nA$ ================================================== 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 Artefact submission: November 20, 2022, 23:59 AoE (firm) Camera ready: December 11, 2022, 23:59 AoE (firm) 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!T9o6OwGXhaIfnKOz28gHtZ-U4Ts8Hsry67J2dw5V2pUSfmXzo3eExxppM_9s7VkUMHhtwluV2HbzIHXbVWukHwekxJdOC26ba7T_hg$ Each paper will be evaluated by at least three PC members. Authors of papers reporting experimental work are strongly encouraged to make their experimental results available for use by the reviewers. 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 and are highly encouraged to participate in the artefact evaluation once their paper is accepted. 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 is 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. =Double Blind Review Process= FM 2023 will employ a double-blind review process except for (a) long tool papers and (b) short tool demonstration papers. Other short papers will be subject to a double-blind policy. The papers submitted must not reveal the authors? identities in any way: (a) Authors should leave out author names and affiliations from the body of their submission. (b) Authors should ensure that any citation to related work by themselves is written in third person, that is, ?the prior work of XYZ? as opposed to ?our prior work?. (c) Authors should not include URLs to author-revealing sites (tools, datasets). (e) You are encouraged to submit a link to a Web site or repository containing supplementary material (raw data, datasets, experiments, etc.), as long as it is blinded. The visit of such sites should not be needed to conduct the review. The PC will not necessarily consider it in the paper review process. For more information, please read How to disclose data for double-blind review and make it archived open data upon acceptance. As an alternative to having an external link, the submission form provides an option to attach a replication package. (f) Authors should anonymize author-revealing company names but instead provide general characteristics of the organizations involved needed to understand the context of the paper. (g) Authors should ensure that paper acknowledgements do not reveal the origin of their work. The double-blind process is ?heavy?, i.e., the paper anonymity will be maintained during the reviewers? discussion period. Authors with further questions on double-blind reviewing are encouraged to contact the PC chairs by email. Papers that do not comply with the double-blind review process will be desk-rejected. To prevent double submissions, the chairs might compare the submissions with related conferences that have overlapping review periods. The double submission restriction applies only to refereed journals and conferences, not to unrefereed forums (e.g. arXiv.org). To check for plagiarism issues, the chairs might use external plagiarism detection software. To facilitate double-blind reviewing, we advise the authors to postpone publishing their submitted work on arXiv or similar sites until after the notification of acceptance. However, if the authors have already published a version of their paper to arXiv or similar sites, we request authors to use a different title for their submission, so that author names are not inadvertently disclosed, e.g., via a notification on Google Scholar. =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, CA Joost-Pieter Katoen, RWTH Aachen University, DE & University of Twente, NL =Program Committee= Dalal Alrajeh, Imperial College, UK Luis Soares Barbosa, University of Minho, PT Ezio Bartocci, TU Vienna, AT Nikolaj Bj?rner, Microsoft, US Sandrine Blazy, University of Rennes, FR Borzoo Bonakdarpour, Michigan State University, US Pablo Castro, University of Rio Cuarto, AR Ana Cavalcanti, University of York, UK Milan ?eska, Brno University of Technology, CZ Nancy Day, University of Waterloo, CA Benrd Fischer, Stellenbosch University, ZA Arie Gurfinkel, University of Waterloo, CA Reiner H?hnle, TU Darmstadt, DE Ichiro Hasuo, National Institute of Informatics, JP Keijo Heljanko, University of Helsinki, FI Holger Hermanns, Saarland University, DE Peter H?fner, Australian National University, AU Marieke Huisman, University of Twente, NL Adrian Francalanza, University of Malta, MT Einar Broch Johnsen, University of Oslo, NO Sebastian Junges, Radboud University, NL Martin Leucker, University of L?beck, DE Yi Li, Nanyang Technological University, SG Lei Ma, University of Alberta, CA Mieke Massink, CNR-ISTI, IT Christoph Matheja, Technical University of Denmark, DK Annabelle McIver, Macquarie University, AU Claudio Menghi, McMaster University, CA Jan Peleska, University of Bremen, DE Andre Platzer, Carnegie Mellon University, USA Jan-Oliver Ringert, Bauhaus University Weimar, DE Baishakhi Ray, Columbia University, US Christina Seceleanu, Malardalen University, SE Marjan Sirjani, Malardalen University, SE Paola Spoletini, Kennesaw State University, US Jun Sun, Singapore University, SG Emilio Tuosto, Gran Sasso Science Institute, IT Matthias Volk, University of Twente (AE Chair), NL Ou Wei, Thales, CA Mike Whalen, Amazon Web Services, US Mingsheng Ying, University of Technology Sydney, AU Naijun Zhan, Chinese Academy of Sciences, CN ************************************************************ Emilio Tuosto Gran Sasso Science Institute Department of Computer Science ORCID: 0000-0002-7032-3281 Viale F. Crispi, 7 - 67100 L'Aquila (Italy) Office: Palazzo Mariani P1-N Phone: +39 0862 428 0312 homepage -> https://urldefense.com/v3/__https://cs.gssi.it/emilio.tuosto/__;!!IBzWLUs!T9o6OwGXhaIfnKOz28gHtZ-U4Ts8Hsry67J2dw5V2pUSfmXzo3eExxppM_9s7VkUMHhtwluV2HbzIHXbVWukHwekxJdOC242lH6HtQ$ ************************************************************ From m.r.mousavi at hh.se Mon Aug 29 07:52:12 2022 From: m.r.mousavi at hh.se (M.R. Mousavi) Date: Mon, 29 Aug 2022 12:52:12 +0100 Subject: [TYPES/announce] Postdoc Position in Testing AI Ethics at King's College London Message-ID: ============================================ Research Associate in Testing AI Ethics at King's College London Vacancy terms: Full time, fixed term contract for 18 months Salary: ?38,826 per annum, including London Weighting Allowance Deadline : 15 September 2022 Application link: https://urldefense.com/v3/__https://jobs.kcl.ac.uk/gb/en/job/049688/Research-Associate-in-Testing-AI-Ethics__;!!IBzWLUs!Wd037xsBfW7AStKnlyn6V4K1dYt3j8c9j1azBFKGMHsKFEqdL6ib8P0r1H9XvTdhrKbudbtLF28t6DVMEMgZtH0hY-pATf-DQBU$ ============================================ Job description Within the UKRI Trustworthy Autonomous System Node on Verifiability, we have an exciting opening for a postdoctoral researcher on testing ethical aspects of AI. These include testing aspects such as fairness and bias, as well as privacy and explainability. You will be working within a vigorous multi-disciplinary environment of the Trustworthy Autonomous System program with researchers across many disciplines designing and verifying the autonomous systems of the future. You will be using and advancing the state of the art in testing (validation and verification) methods to provide assurances of ethical decision making i n sub-symbolic AI components, such as neural networks and statistical machine learning techniques. This post will be offered on a fixed-term contract for 18 months This is a full-time post - 100% full time equivalent Key responsibilities Developing world-leading research results in collaboration with the team, on testing ethical concerns on AI; Developing a comprehensive and rigorous set of requirements for such ethical concerns; Developing public benchmarks and datasets for evaluating the developed techniques and their future alternatives; Coordinating the related activities within the team and within the larger project and program. The above list of responsibilities may not be exhaustive, and the post holder will be required to undertake such tasks and responsibilities as may reasonably be expected within the scope and gradin g of the post. Skills, knowledge, and experience Essential criteria A doctoral degree in Computer Science, Software Engineering, or closely related fields (also candidates with their dissertations submitted or under submission will be considered). Solid track record of study and research in software engineering and software testing (validation and verification) Proficiency in programming; familiarity with AI frameworks Possessing analytical skills; basic knowledge of statistical methods Desirable criteria Affinity with ethical theories and their formalisation Affinity with formal verification and mathematical modelling techniques -------------- next part -------------- An HTML attachment was scrubbed... URL: From bcpierce at cis.upenn.edu Tue Aug 30 13:23:00 2022 From: bcpierce at cis.upenn.edu (Benjamin Pierce) Date: Tue, 30 Aug 2022 13:23:00 -0400 Subject: [TYPES/announce] New release of Software Foundations Message-ID: The Software Foundations team is delighted to announce a new release of the entire SF series . Software Foundations is a set of textbooks on logic, programming language theory, functional algorithms, and machine-assisted proofs of functional and imperative programs, all 100% formalized and machine-checked in Coq. This release brings all volumes up to date with the current release of Coq (8.15.2) and of additional tools such as VST and QuickChick. Volumes 1 (Logical Foundations) is the entry-point to the series. It covers functional programming, basic concepts of logic, computer-assisted theorem proving, and Coq. Volume 2 (Programming Language Foundations) surveys the theory of programming languages, including operational semantics, Hoare logic, and static type systems. These two volumes have been extensively polished and refined, with many next exercises, improved explanations, and notational improvements -- in particular, the concrete syntax of program snippets in examples and proofs is significantly more readable. Volume 3 (Verified Functional Algorithms) shows how a variety of fundamental data structures can be specified and mechanically verified. The new release features improvements to the sorting and search-tree chapters. Volume 4 (QuickChick: Property-Based Testing in Coq) introduces tools for combining randomized property-based testing with formal specification and proof in the Coq ecosystem. The new release incorporates recent advances in property-based testing, notably automatic derivation of generators, enumerators, and checkers from inductive relations, plus a discussion of the new pragmas for typeclass instance declarations. Volume 5 (Verifiable C) is an introduction to verifying C programs with separation logic using the Verified Software Toolchain, with exercises that emphasize data abstraction. New in this release are an additional 10 chapters demonstrating how to use VST's (relatively) new Verified Software Units for modular verification of modular C programs with API interfaces between the modules. Volume 6 (Separation Logic Foundations) is an in-depth introduction to separation logic?a practical approach to modular verification of imperative programs?and how to build program verification tools on top of it. It has been polished throughout. Share and enjoy! - Benjamin Pierce and the Software Foundations team -------------- next part -------------- An HTML attachment was scrubbed... URL: From anuj.dawar at cl.cam.ac.uk Wed Aug 31 06:45:10 2022 From: anuj.dawar at cl.cam.ac.uk (Anuj Dawar) Date: Wed, 31 Aug 2022 11:45:10 +0100 Subject: [TYPES/announce] STACS 2023 - second call for papers Message-ID: <284ec46a-99e7-f799-7a50-e05b042ae1c2@cl.cam.ac.uk> STACS 2023 - Call for Papers ----------------------- The 40th International Symposium on Theoretical Aspects of Computer Science is planned to take place from 7 March to 10 March 2023 in Hamburg, Germany. For the first time, STACS 2023 will consist of two tracks, A and B, to facilitate the work of the program committee(s). Track A is dedicated to algorithms and data structures, complexity and games. Track B will cover automata, logic, semantics and theory of programming. LISTS OF TOPICS Authors are invited to submit papers presenting original and unpublished research on theoretical aspects of computer science. Typical areas include: Track A: algorithms and data structures, including: design of parallel, distributed, approximation, parameterized and randomized algorithms; analysis of algorithms and combinatorics of data structures; computational geometry, cryptography, algorithms for machine learning, algorithmic game theory, quantum algorithms complexity, including: computational and structural complexity theory, parameterized complexity, randomness in computation Track B: automata and formal languages, including: automata theory, games, algebraic and categorical methods, coding theory, models of computation, computability logic in computer science, including: finite model theory, database theory, semantics, type systems, program analysis, specification & verification, rewriting and deduction, learning theory, logical aspects of complexity These lists are not exhaustive. In particular, both tracks also welcome submissions about current challenges. PROGRAM COMMITTEE CHAIRS Track A: - Petra Berenbrink (Universit?t Hamburg, Germany) - Mamadou Moustapha Kant? (Universit? Clermont Auvergne, France) Track B: - Patricia Bouyer-Decitre (CNRS, France) - Anuj Dawar (University of Cambridge, UK) SUBMISSIONS Submissions will be through EasyChair (https://urldefense.com/v3/__https://easychair.org/my/conference?conf=stacs23__;!!IBzWLUs!Rh_ADt4Fp6pz_f4EBy2rFkU1nJnG_qIuKFCQf4YvGATFTDuwrlHOwkKsqWGKbnJVEqxy0D4OqMwYkuC6iGd_QmHBff6L4b42mfOYaSM$ ). Authors are invited to submit an extended abstract or full paper with at most 12 pages (excluding the title page and the references section) to the appropriate track. The title page consists of the title of the paper and the abstract, but *no* author information. The first section of the paper should start on the next page. The PCs reserve the right to reassign a paper to a different track. The usage of pdflatex and the LIPIcs style file are mandatory no changes to font size, page geometry, etc. are permitted (see https://urldefense.com/v3/__http://www.dagstuhl.de/en/publications/lipics__;!!IBzWLUs!Rh_ADt4Fp6pz_f4EBy2rFkU1nJnG_qIuKFCQf4YvGATFTDuwrlHOwkKsqWGKbnJVEqxy0D4OqMwYkuC6iGd_QmHBff6L4b42-8WVWw4$ ) . Submissions not in the correct format or submitted after the deadline will not be considered. The paper should contain a succinct statement of the issues and of their motivation, a summary of the main results, and a brief explanation of their significance, accessible to non-specialist readers. Proofs omitted due to space constraints must be put into an appendix, to be read by the program committee members at their discretion. Simultaneous submission to other conferences with published proceedings or to journals is not allowed. PC members are excluded from submitting. As in the previous two years, STACS 2023 will employ a lightweight double-blind reviewing process: submissions should not reveal the identity of the authors in any way. The purpose of the double-blind reviewing is to help PC members and external reviewers come to an initial judgment about the paper without bias, not to make it impossible for them to discover the authors if they were to try. Nothing should be done in the name of anonymity that weakens the submission or makes the job of reviewing the paper more difficult. In particular, important references should not be omitted or anonymized. In addition, authors should feel free to disseminate their ideas or draft versions of their paper as they normally would. For example, authors may post drafts of their papers on the web, submit them to arXiv, and give talks on their research ideas. There will be a rebuttal period for authors, see below for the dates. Authors will receive the reviews of their submissions (via EasyChair) and have three days to submit rebuttals (via EasyChair). These rebuttals become part of the PC discussions, but entail no specific responses. At least one author of each accepted paper is expected to register at the conference. For authors who cannot present their paper in person a possibility for remote presentation will be offered. Note that at least one of the authors will have to register for STACS'23 at the cost of around 400?. PROCEEDINGS Accepted papers will be published in the proceedings of the symposium. As usual, these proceedings will appear in the Leibniz International Proceedings in Informatics (LIPIcs) series, based at Schloss Dagstuhl. This guarantees perennial, free and easy electronic access, while the authors retain the rights over their work. With their submission, authors consent to sign a license authorizing the program committee chairs to organize the electronic publication of their paper, provided the paper is accepted. IMPORTANT DATES * Deadline for submissions: September 25, 2022 (AoE) * Rebuttal: November 14-16, 2022 * Author notification: December 4, 2022 * Final version: January 8, 2023 * STACS 2023: March 7-10, 2023 CONTACT INFORMATION Web: https://urldefense.com/v3/__http://www.stacs-conf.org__;!!IBzWLUs!Rh_ADt4Fp6pz_f4EBy2rFkU1nJnG_qIuKFCQf4YvGATFTDuwrlHOwkKsqWGKbnJVEqxy0D4OqMwYkuC6iGd_QmHBff6L4b42RCDW0Bg$ Email: petra.berenbrink at uni-hamburg.de From elenatalita at gmail.com Wed Aug 31 12:40:42 2022 From: elenatalita at gmail.com (Elena Di Lavore) Date: Wed, 31 Aug 2022 19:40:42 +0300 Subject: [TYPES/announce] SYCO 9 - Last call for participation Message-ID: -------------------------------------------------------- CALL FOR PARTICIPATION NINTH SYMPOSIUM ON COMPOSITIONAL STRUCTURES (SYCO 9) In person at University of Insubria, Como, Italy 8-9 September 2022 Registration deadline: 1 September 2022 (AoE) It is possible to attend online, but not to present online. Please register even when attending online. https://urldefense.com/v3/__https://www.cl.cam.ac.uk/events/syco/9/__;!!IBzWLUs!VJo9GsI23AViicJi9GzCKVT2l078vXWqjS-7T-zVeKYkNs_tcKlG85wsPUVMQGqBAccaVlvT8kXiiN7YON29MNPU07zAHlWPNxU$ -------------------------------------------------------- The Symposium on Compositional Structures (SYCO) is an interdisciplinary series of meetings aiming to support the growing community of researchers interested in the phenomenon of compositionality, from both applied and abstract perspectives, and in particular where category theory serves as a unifying common language. Previous SYCO events have been held at University of Birmingham, University of Strathclyde, University of Oxford, Chapman University, University of Leicester and Tallinn University of Technology. The programme consists of 2 invited talks and 14 contributed talks. -------------------------------------------------------- INVITED TALKS * Robert Furber (University of Edinburgh) - TBA * Olivia Caramello (University of Insubria) - Relative toposes as a generalization of locales -------------------------------------------------------- CONTRIBUTED TALKS Full schedule available at https://urldefense.com/v3/__https://www.cl.cam.ac.uk/events/syco/9/__;!!IBzWLUs!VJo9GsI23AViicJi9GzCKVT2l078vXWqjS-7T-zVeKYkNs_tcKlG85wsPUVMQGqBAccaVlvT8kXiiN7YON29MNPU07zAHlWPNxU$ * Jakob von Raumer - String Diagrams for Strings and Rings * Matthew Earnshaw and Pawe? Soboci?ski - Regular Monoidal Languages * Paolo Perrone - Lifting weights: enriched lenses between transport plans * Simona Paoli - Weak Globularity: a New Paradigm to Weaken Higher Categorical Structures * Malin Altenm?ller and Ross Duncan - A Category of Plane Graphs * Sebastian Stengele, Tobias Reinhart, Tom?? Gonda and Gemma De Las Cuevas - A Framework for Universality Across Disciplines * Morgan Rogers - Continuous monoid homomorphisms and geometric morphisms * Calin Tataru - Cubicalisation: an algorithm for generating cubical meshes from homotopy.io diagrams * Niels Voorneveld - Cylinder Diagrams: Visualizing Multi-Parameter Natural Transformations * Mattia G. Bergomi and Pietro Vertechi - Neural network layers as parametric spans * Lia Yeh - Conversation Logic: The Interplay of Negation, Conjunction, Disjunction, and Lexical Entailment * Dylan Braithwaite and Jules Hedges - Dependent Bayesian Lenses: Categories of Bidirectional Markov Kernels with Canonical Bayesian Inversion -------------------------------------------------------- REGISTRATION Registration is open until the 1st of September, 2022. You can register for either the in person meeting or for the online event. Please register via: https://urldefense.com/v3/__https://forms.gle/NURaeCEVsfpfZTJp9__;!!IBzWLUs!VJo9GsI23AViicJi9GzCKVT2l078vXWqjS-7T-zVeKYkNs_tcKlG85wsPUVMQGqBAccaVlvT8kXiiN7YON29MNPU07zAae5Uw4w$ Registration is free. More details are available on the conference website: https://urldefense.com/v3/__https://www.cl.cam.ac.uk/events/syco/9/__;!!IBzWLUs!VJo9GsI23AViicJi9GzCKVT2l078vXWqjS-7T-zVeKYkNs_tcKlG85wsPUVMQGqBAccaVlvT8kXiiN7YON29MNPU07zAHlWPNxU$ -------------------------------------------------------- COVID-19 SITUATION IN ITALY It is mandatory to wear FFP2 masks on all public transport in Italy. It is strongly recommended to wear them in all public places, including the university. At the moment, there are no restrictions for entering Italy. More information at https://urldefense.com/v3/__https://www.viaggiaresicuri.it/approfondimenti-insights/saluteinviaggio__;!!IBzWLUs!VJo9GsI23AViicJi9GzCKVT2l078vXWqjS-7T-zVeKYkNs_tcKlG85wsPUVMQGqBAccaVlvT8kXiiN7YON29MNPU07zAzog6SSQ$ (only in Italian). -------------------------------------------------------- PROGRAMME COMMITTEE Robin Cockett, University of Calgary Elena Di Lavore, Tallinn University of Technology Ross Duncan, University of Strathclyde Robert Furber, University of Edinburgh Amar Hadzihasanovic, Tallinn University of Technology Chris Heunen, University of Edinburgh Alex Kissinger, University of Oxford Martha Lewis, University of Bristol Jade Master, University of Strathclyde Konstantinos Meichanetzidis, Quantinuum Samuel Mimram, ?cole Polytechnique Simona Paoli, University of Aberdeen Mehrnoosh Sadrzadeh, University College London Pawel Sobocinski, Tallinn University of Technology Jamie Vicary, University of Cambridge John van de Wetering, Radboud University (chair) -------------------------------------------------------------- STEERING COMMITTEE Ross Duncan, University of Strathclyde Chris Heunen, University of Edinburgh Dominic Horsman, University of Grenoble Aleks Kissinger, University of Oxford Samuel Mimram, Ecole Polytechnique Simona Paoli, University of Aberdeen Mehrnoosh Sadrzadeh, University College London Pawel Sobocinski, Tallinn University of Technology Jamie Vicary, University of Cambridge From catherine.dubois at ensiie.fr Wed Aug 31 13:03:31 2022 From: catherine.dubois at ensiie.fr (Catherine DUBOIS) Date: Wed, 31 Aug 2022 19:03:31 +0200 Subject: [TYPES/announce] Formal Methods Teaching Workshop (FMTea 2023) Call for Paper Message-ID: ** * # Formal Methods Teaching Workshop (FMTea 2023) 6 March 2023 --- Affiliated with Formal Methods 2023 INVITED SPEAKERS to be announced soon IMPORTANT DATES * 3 November 2022: Deadline for submission of papers * 5 December 2022: Notifications to authors * 5 January 2023: Deadline for camera-ready version * 6 March 2023: FMTea 2023 Workshop OBJECTIVES AND SCOPE Formal Methods provide software engineering with tools and techniques for rigorously reasoning about the correctness of systems. While in recent years formal methods are increasingly being used in industry, university curricula are not adapting at the same pace. Some existing formal methods classes interest and challenge students, whereas others fail to ignite student motivation. It is thus important to develop, share, and discuss approaches to effectively teach formal methods to the next generations. This discussion is now more important than ever due to the challenges and opportunities that arose from the pandemic, which forced many educators to adapt and deliver their teaching online. Exchange of ideas is critical to making these new online approaches a success and having a greater reach. We envision this event as a one-day combination of keynote and workshop presentations, where various models of teaching are presented and explored, together with innovative approaches relevant for educators of Formal Methods in the 21st century. More details can be found on our website: https://urldefense.com/v3/__https://fmtea.github.io__;!!IBzWLUs!RdFoS6eJo0isNXeeuxPe6gavwwolU4YqSJ6tT97apeSa2KvBC8XxmpMgOywZE-p-F5NSeVJ1HjaYZWBMGwIdsLA1lzd-dcAtMFQT9Bl_dy8$ TOPICS We aim to attract papers detailing authors? experiences with FM Teaching. We would like to get papers discussing successes and failures of various methods, case studies, tools, etc. As self-learning seems to be an important aspect of FM teaching, we appreciate experiences with online teaching, including experiences with teaching formal methods via MOOCs. A non-exhaustive list of topics of interest for the FMTea23 workshop is below: * Experiences and proposals related with ?traditional? FM learning and teaching * Experiences and proposals related with online FM learning and teaching * Integrating/embedding FM teaching/thinking within other computer science courses * Teaching FM for industry * Student projects on FM, including group projects * Innovative learning and teaching methods for FM Computer science is transforming into a rigorous engineering discipline. Improved teaching techniques will ensure that FM is at the heart of this transformation process. ORGANIZATION FMTea 2023 is organized by FME?s Teaching Committee. Our broad aim is to support a worldwide improvement in learning Formal Methods, mainly by teaching but also via self-learning. To that end, we have already gathered a list of FM courses taught worldwide (https://urldefense.com/v3/__https://fme-teaching.github.io__;!!IBzWLUs!RdFoS6eJo0isNXeeuxPe6gavwwolU4YqSJ6tT97apeSa2KvBC8XxmpMgOywZE-p-F5NSeVJ1HjaYZWBMGwIdsLA1lzd-dcAtMFQThuN_0P8$ ) and plan to collect other resources as well, such as FM case studies, FM inspirational papers, etc. Furthermore, the FME Teaching Committee coordinates a tutorial series, held online via zoom. Tutorials are collected on the FME Teaching Committee website (https://urldefense.com/v3/__https://fme-teaching.github.io/__;!!IBzWLUs!RdFoS6eJo0isNXeeuxPe6gavwwolU4YqSJ6tT97apeSa2KvBC8XxmpMgOywZE-p-F5NSeVJ1HjaYZWBMGwIdsLA1lzd-dcAtMFQTI8fNOgI$ ). PROGRAM COMMITTEE (to be completed) * Catherine Dubois, ENSIIE, France (co-chair) * Pierluigi San Pietro, Politecnico di Milano, Italy? (co-chair) * Brijesh Dongol, University of Surrey, UK * Luigia Petre, ?bo Akademi University, Finland * Kristin Rozier, Iowa State University, US * Graeme Smith, The University of Queensland, Australia * Claudio Menghi,? University of Luxembourg, Luxembourg * Jo?o F. Ferreira, INESC-ID & IST, University of Lisbon, Portugal * Alexandra Mendez, INESC TEC & University of Beira Interior, Portugal * Sandrine Blazy, University of Rennes 1, France PREVIOUS EDITIONS Several events focused on teaching aspects for Formal Methods were held at the beginning of the 2000s: two BCS-FACS TFM workshops (Oxford in 2003 and London in 2006), the TFM 2004 conference in Ghent (with proceedings published as Springer LNCS Volume 3294), the FM-Ed 2006 workshop (Hamilton, co-located with FM'06), FORMED (Budapest, at ETAPS 2008), FMET 2008 (Kitakyushu 2008, co-located with ICFEM), and TFM 2009 (Eindhoven, at FM 2009 with proceedings published as Springer LNCS Volume 5846). The first? FMTea event was FMTea 2019, the Formal Methods Teaching Workshop and Tutorial, in October 2019 in Porto, Portugal, affiliated with the 3rd World Congress on Formal Methods (FM19) with proceedings as Springer LNCS 11758. The FMTea 2021 workshop, affiliated with FM 2021, the 24th International Symposium on Formal Methods, Beijing, was held only online? in November 2021, with proceedings published as Springer LNCS 13122. SUBMISSION DETAILS FMTea 2023 invites high quality papers reporting on opinions, approaches, and experiences related to the topic of teaching Formal Methods. Each submitted paper will be reviewed by at least three PC members. The conference proceedings will be published in Springer's Lecture Notes in Computer Science series. All submissions must be original, unpublished, and not submitted for publication elsewhere. Submissions must be in PDF format, using the Springer LNCS style files; we suggest to use the LaTeX2e package (the llncs.cls class file, available in llncs2e.zip and the typeinst.dem available in typeinst.zip as a template for your contribution). Papers should not exceed 15 pages in length. Submissions should be made using the FMTea 2023 Easychair web site: https://urldefense.com/v3/__https://easychair.org/conferences/?conf=fmtea2023__;!!IBzWLUs!RdFoS6eJo0isNXeeuxPe6gavwwolU4YqSJ6tT97apeSa2KvBC8XxmpMgOywZE-p-F5NSeVJ1HjaYZWBMGwIdsLA1lzd-dcAtMFQTJYfA0k0$ All accepted papers must be presented at the workshop. Their authors must be prepared to sign a copyright transfer statement. At least one author of each accepted paper must register to the conference by an early date, to be indicated by the FM2023 organizers, and present the paper. * -- Catherine Dubois, professor ENSIIE, lab. Samovar -------------- next part -------------- An HTML attachment was scrubbed... URL: -------------- next part -------------- A non-text attachment was scrubbed... Name: catherine_dubois.vcf Type: text/vcard Size: 4 bytes Desc: not available URL: From jan.kofron at d3s.mff.cuni.cz Wed Aug 31 02:56:00 2022 From: jan.kofron at d3s.mff.cuni.cz (Jan Kofron) Date: Wed, 31 Aug 2022 08:56:00 +0200 Subject: [TYPES/announce] ETAPS 2023 2nd joint call for papers Message-ID: <630f0600.zAJcI8iDu3+ZC9bh%jan.kofron@d3s.mff.cuni.cz> ****************************************************************** JOINT CALL FOR PAPERS 26th European Joint Conferences on Theory and Practice of Software ETAPS 2023 Paris, France, 22-27 April 2023 https://urldefense.com/v3/__https://etaps.org/2023__;!!IBzWLUs!W9lPCtrEPRfRgheI6Y7TpibedVG3eLp09c4Wd3Vt5L4Qsyr7Tij-z3IheC4FFnwI0J4hbaC6R3xfKhNr4u6SfUQT1VtZfTTurUgeTfnO8Qk$ ****************************************************************** -- ABOUT ETAPS -- ETAPS is the primary European forum for academic and industrial researchers working on topics relating to software science. ETAPS, established in 1998, is a confederation of four annual conferences accompanied by satellite workshops. ETAPS 2023 is the twenty-sixth event in the series. -- Why choose ETAPS? -- * ETAPS is one of the world's leading fora for research on software science, with a history of more than 25 years. * The proceedings of ETAPS appear in gold open access, with no article processing charge for the authors specifically. * ETAPS has low participation fees for all and students in particular. -- What is new in 2023? -- * The SPIN symposium will be co-located with ETAPS. More info at: https://urldefense.com/v3/__https://spin-web.github.io/SPIN2023/__;!!IBzWLUs!W9lPCtrEPRfRgheI6Y7TpibedVG3eLp09c4Wd3Vt5L4Qsyr7Tij-z3IheC4FFnwI0J4hbaC6R3xfKhNr4u6SfUQT1VtZfTTurUgeRnPrd2M$ . * TACAS will use a double-blind reviewing process. * ESOP, FASE, and newly also FoSSaCS welcome voluntary submissions of artefacts for evaluation after paper acceptance; the outcome will not change the paper acceptance decision. * Presentations of the test-of-time-award and the doctoral- dissertation-award winners will take place. * A plenary session for TOOLympics will be organised. -- MAIN CONFERENCES (24-27 April 2023) -- * ESOP: European Symposium on Programming (PC chair: Thomas Wies, New York University) * FASE: Fundamental Approaches to Software Engineering (PC chairs: Leen Lambers, BTU Cottbus-Senftenberg, and Sebasti?n Uchitel, University of Buenos Aires) * FoSSaCS: Foundations of Software Science and Computation Structures (PC chairs: Pawel Sobocinski, Tallinn University of Technology, and Orna Kupferman, Hebrew University of Jerusalem) * TACAS: Tools and Algorithms for the Construction and Analysis of Systems (PC chairs: Sriram Sankaranarayanan, University of Colorado, Boulder, CO, and Natasha Sharygina, University of Lugano) ETAPS'23 will also host another edition of TOOLympics, organised by Dirk Beyer, Fabrice Kordon, and Arnd Hartmanns. -- INVITED SPEAKERS -- * Unifying speakers: Thomas A. Henzinger (IST, Austria) V?ronique Cortier (Loria, France) * ESOP: Mooly Shagiv (Tel Aviv University, Israel) * FASE: Sven Apel (Saarland University, Germany) * Tutorial speakers: TBA -- IMPORTANT DATES -- * Paper submission: 13 October 2022, 23:59 AoE * TACAS artefact submission deadline: 10 November 2022 * Rebuttal (ESOP, FoSSaCS, partially TACAS): Tuesday 6 December - Thursday 8 December 2022 * Paper notification: 22 December, 2022 * ESOP, FASE, FoSSaCS artefact submission deadline: 5 January 2023 * Artefact notification TACAS: 19 January 2023 * Paper final version: 26 January 2023 * Artefact notification ESOP, FASE, FoSSaCS: 9 February 2023 -- SUBMISSION INSTRUCTIONS -- The four main conferences of ETAPS 2023 solicit contributions of the following types. All page limits are given **excluding the bibliography**. * ESOP: regular research papers of max 25 pp * FASE: regular research papers and empirical evaluation papers of max 18 pp, new ideas and emerging results (NIER) papers of max 8 pp, tool demonstration papers of max 6 pp (+ mandatory appendix of max 6 pp), * FoSSaCS: regular research papers of max 18 pp * TACAS: regular research papers, case study papers and regular tool papers of max 16 pp, tool demonstration papers of max 6 pp (+ mandatory appendix of max 6 pp), For definitions of the different paper types and specific instructions, where they are present, see the webpages of the individual conferences. All accepted papers will appear in the proceedings and have presentations during the conference. A condition of submission is that, if the submission is accepted, one of the authors attends the conference to give the presentation. We plan ETAPS 2023 as an on-site conference; nonetheless, remote attendance and presentation will be made possible. Submitted papers must be in English, presenting original research. They must be unpublished and not submitted for publication elsewhere. In particular, simultaneous submission of the same contribution to multiple ETAPS conferences is forbidden. Submissions must follow the formatting guidelines of Springer's LNCS (use the llncs.cls class) and be submitted electronically in pdf through the Easychair author interface of the respective conference. Submissions not adhering to the specified format and length may be rejected immediately. ESOP, FASE, and TACAS will use **double-blind reviewing**. Authors are asked to omit their names and institutions; refer to prior work in the third person, just as prior work by others; not to include acknowledgements that might identify them. ESOP and FoSSaCS will use an **author rebuttal phase**. TACAS will use rebuttal for selected submissions (those in the grey zone). Artefact submission and evaluation Regular tool paper and tool demonstration paper submissions to TACAS must be accompanied by an artefact submitted shortly after the paper. The artefact will be evaluated, and the outcome will be considered in the paper's acceptance decision. Authors of research papers and case study papers may submit an artefact for evaluation after receiving the acceptance notifications. The outcome of the artefact evaluation will not change the paper acceptance decision. ESOP, FASE, and FoSSaCS will accept artefact submissions; however, participation in it is voluntary; the artefact submission deadline is after the paper notification deadline. The outcome will not alter the paper acceptance decision. For specific instructions regarding artefacts, see the web pages of the individual conferences. -- PUBLICATION The proceedings will be published in the Advanced Research in Computing and Software Science (ARCoSS) subline of Springer's LNCS series. The proceedings volumes will appear in gold open access, so the published versions of all papers will be available for everyone to download from the publisher's website freely, from the date of online publication, perpetually. The copyright of the papers will remain with the authors. -- AWARDS The strongest papers from the four conferences will be nominated for the ETAPS best paper awards of EAPLS, EASST and EATCS, and the SCP best tool paper award. The ETAPS test-of-time award will be granted, recognising outstanding papers published at ETAPS more than ten years in the past. The Doctoral Dissertation Award will be granted to promote and recognise an outstanding dissertation in the research areas covered by the four main ETAPS conferences. -- SATELLITE EVENTS (22-23 April 2023) -- A number of satellite workshops and other events will take place during the weekend before the main conferences. In particular, there will be a PhD student mentoring workshop organised by Caterina Urban and Wolfgang Ahrendt. -- CITY AND HOST INSTITUTION -- ETAPS 2023 will take place in Paris, France. The conferences and satellite events will be hosted at Sorbonne Universit? and IHP (Institut Henri Poincar?), respectively. They are located in the very centre of the city, in the famous historic district of Quartier Latin. The new museum of mathematical sciences of IHP and the historical mathematics library are also in the same buildings as the satellite events. Several museums, churches and historical buildings can be visited in this area. The convenient location allows for accessing most places in Paris by public transport. ETAPS is organised by the MeFoSyLoMa community, which gathers all researchers on formal methods for software and hardware systems in the ?le-de-France region. -- ORGANISERS -- General co-chairs: * Fabrice Kordon (Sorbonne Universit?) * Laure Petrucci (Universit? Sorbonne Paris Nord) Workshop co-chairs: * Benedikt Bollig (CNRS) * Stefan Haar (Inria) Tutorial chair: * ?tienne Andr? (Universit? Sorbonne Paris Nord) Web co-chairs: * Denis Poitrenaud (Universit? Paris Cit?) * Stefan Schwoon (ENS Paris-Saclay) Publicity co-chairs * Beno?t Barbot (Universit? Paris-Est Cr?teil) * Nathalie Sznajder (Sorbonne Universit?) Sponsor chair * C?line Ghibaudo (Sorbonne Universit?) Communication chair * Anna-Marie Reytier (Sorbonne Universit?) From griggio at fbk.eu Thu Sep 1 04:10:13 2022 From: griggio at fbk.eu (Alberto Griggio) Date: Thu, 1 Sep 2022 10:10:13 +0200 Subject: [TYPES/announce] FMCAD 2022: Call for participation (Early registration by September 15th) Message-ID: <085b149f-f032-7fa6-2028-6fc14eeb2d72@fbk.eu> CALL FOR PARTICIPATION ====================================================== 2022 Formal Methods in Computer-Aided Design (FMCAD) ====================================================== Trento, Italy October 18-21, 2022 https://urldefense.com/v3/__https://fmcad.org/FMCAD22/__;!!IBzWLUs!WBd_hKmRnrfG5x8fMq0ILkuEh52Dau3nEfAP4JfOg_lr5Qf8eT5R583249k-b8Lk91Sjrw0iROdnZ9WQBhvcz9Oh5Jjm0w$ REGISTRATION ------------ Early registration deadline is September 15th, 2022. For more information, visit: https://urldefense.com/v3/__https://fmcad.org/FMCAD22/registration/__;!!IBzWLUs!WBd_hKmRnrfG5x8fMq0ILkuEh52Dau3nEfAP4JfOg_lr5Qf8eT5R583249k-b8Lk91Sjrw0iROdnZ9WQBhvcz9Pj5Yorng$ 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. PROGRAM ------- The FMCAD program will include 40 regular talks, and will feature 2 invited talks and 2 tutorials. Invited talks: - June Andronick The seL4 verification journey: how have the challenges and opportunities evolved - Hana Chockler Why do things go wrong (or right)? Applications of causal reasoning to verification Tutorials: - H?kan Hjort On applying Model Checking in Formal Verification - Oded Padon Verification of Distributed Protocols: Decidable Modeling and Invariant Inference The full program is available at https://urldefense.com/v3/__https://easychair.org/smart-program/FMCAD2022/__;!!IBzWLUs!WBd_hKmRnrfG5x8fMq0ILkuEh52Dau3nEfAP4JfOg_lr5Qf8eT5R583249k-b8Lk91Sjrw0iROdnZ9WQBhvcz9Og515I2w$ VENUE ----- FMCAD will take place at the Grand Hotel Trento, A 4 star hotel in the historic centre of Trento, in the heart of the Italian Alps. https://urldefense.com/v3/__https://www.grandhoteltrento.com/en/__;!!IBzWLUs!WBd_hKmRnrfG5x8fMq0ILkuEh52Dau3nEfAP4JfOg_lr5Qf8eT5R583249k-b8Lk91Sjrw0iROdnZ9WQBhvcz9N5cQ_H3Q$ 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!WBd_hKmRnrfG5x8fMq0ILkuEh52Dau3nEfAP4JfOg_lr5Qf8eT5R583249k-b8Lk91Sjrw0iROdnZ9WQBhvcz9MP2i1FFA$ -- -- 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 roberto.blanco at csp.mpg.de Fri Sep 2 03:31:22 2022 From: roberto.blanco at csp.mpg.de (Roberto Blanco) Date: Fri, 2 Sep 2022 09:31:22 +0200 Subject: [TYPES/announce] Day of the Camel 2022: OCaml in Academia and Industry (online, 9 September 2022) Message-ID: The Day of the Camel 2022 is a one-day hybrid workshop dedicated to the OCaml programming language and its industrial users. It comprises talks and discussions with members of the OCaml development team and companies using the language to solve complex and interesting problems. We will present a broad picture of the OCaml ecosystem and, more widely, of functional programming as a viable and powerful choice for building correct and reliable computer systems. The event is organized as part of an OCaml summer school at the University of Zaragoza, and sponsored by the OCaml Software Foundation. Participation is free and open to everyone. For more details about the schedule, updates and links to the online seminar, see the website: https://urldefense.com/v3/__https://webdiis.unizar.es/evpf/event.html__;!!IBzWLUs!TBPOf24TB1syiCfMFmR9vYJLQUgaWfeDkUBWvfFZvsrq0xb7G465uib7PodpzR_DEsNaSXTeY8b1lFqmp5YCcxF4yw5dGOMDJ1kvvd53Z74$ 9 September 2022, all times CEST (UTC+2) Morning - Language session 09:15-10:00: Welcome and reception Dar?o Su?rez (CS Department Secretary, University of Zaragoza) 10:00-11:00: Gabriel Scherer (Inria) - The OCaml project and ecosystem https://urldefense.com/v3/__https://ocaml.org/__;!!IBzWLUs!TBPOf24TB1syiCfMFmR9vYJLQUgaWfeDkUBWvfFZvsrq0xb7G465uib7PodpzR_DEsNaSXTeY8b1lFqmp5YCcxF4yw5dGOMDJ1kvmmaBGJE$ 11:00-11:30: Break 11:30-12:30: OCaml developers - Round table and Q&A Afternoon - Industry session 14:30-14:55: Paul-Elliot Angl?s d'Auriac (Tarides) https://urldefense.com/v3/__https://tarides.com/__;!!IBzWLUs!TBPOf24TB1syiCfMFmR9vYJLQUgaWfeDkUBWvfFZvsrq0xb7G465uib7PodpzR_DEsNaSXTeY8b1lFqmp5YCcxF4yw5dGOMDJ1kvCmeC_qs$ - Building functional systems 14:55-15:20: Nicol?s Ojeda B?r (LexiFi) https://urldefense.com/v3/__https://www.lexifi.com/__;!!IBzWLUs!TBPOf24TB1syiCfMFmR9vYJLQUgaWfeDkUBWvfFZvsrq0xb7G465uib7PodpzR_DEsNaSXTeY8b1lFqmp5YCcxF4yw5dGOMDJ1kvzG3uNCk$ - Modeling language for finance 15:20-15:45: Javier Ch?varri (Ahrefs) https://urldefense.com/v3/__https://ahrefs.com/__;!!IBzWLUs!TBPOf24TB1syiCfMFmR9vYJLQUgaWfeDkUBWvfFZvsrq0xb7G465uib7PodpzR_DEsNaSXTeY8b1lFqmp5YCcxF4yw5dGOMDJ1kvrqoNmoE$ - Petabyte-scale web crawler 15:45-16:10: Grant Passmore (Imandra) https://urldefense.com/v3/__https://www.imandra.ai/__;!!IBzWLUs!TBPOf24TB1syiCfMFmR9vYJLQUgaWfeDkUBWvfFZvsrq0xb7G465uib7PodpzR_DEsNaSXTeY8b1lFqmp5YCcxF4yw5dGOMDJ1kvlgIxBs4$ - Automated reasoning as a service 16:10-16:30: Break 16:30-17:30: Industry speakers - Round table and Q&A We look forward to seeing you there! From jan.bessai at tu-dortmund.de Fri Sep 2 16:43:05 2022 From: jan.bessai at tu-dortmund.de (Jan Bessai) Date: Fri, 02 Sep 2022 22:43:05 +0200 Subject: [TYPES/announce] Call for Papers: Unsound - Sources of Unsoundness in Verification (Deadline Extension: 2022-09-16) Message-ID: <99e6c8d064d06b6bd9bab41da79dc2fd@tu-dortmund.de> ================================================================== Call for Papers Unsound: 1st Workshop on Sources of Unsoundness in Verification at SPLASH 2022 https://urldefense.com/v3/__https://2022.splashcon.org/home/unsound-2022__;!!IBzWLUs!XVIDunRXNjARnUZmCH0D2auGeqoNvaxt4UWBtjmM6brQJUYsepQTqotN7hFP87p3eXdO-bwgibATu2fJf9n2XdWSDrPpRUbs9cCB3qXY$ Software and proof verification has grown significantly in the last 15 years. Growth has come to the point where verification systems are complex and manually proving the soundness of those verification systems sometimes exceeds what a single research group can understand and verify as correct. Even formally defining soundness can be challenging and its definition is varying from system to system. Specific research groups can have very specific notions of soundness they focus on, but those can diverge from what the users expect, especially if the users come from a different verification environment or they are approaching verification for the first time. Participants to Unsound will be able to share their experience and exploits on how different verification tools can either be broken or expose confusing behavior, likely to be unexpected by users. We think this would be greatly beneficial not only because it will help all of us to iron out those unsoundnesses but also because it will facilitate understanding of the foundational differences between the assumptions of the various research lines. The current academic environment encourages us to talk about the success case of our work. In this workshop we want to address and learn from failure cases and we want to reinforce the bedrock of our understanding. In practice, when we divert our focus to a specific aspect of verification we may (understandably) be less precise. For example, a line of research focusing on aliasing control in OO may be less precise when considering the implication in other areas, like termination. We believe that learning from the issues of many verification projects can broaden the attention of researchers to topics which so far escaped their focused area of research; e.g., from only type correctness to also avoiding stack overflows. We believe that this environment would be particularly beneficial for young researchers that are in search of open questions in verification. This may provide a motivation to deep dive into the details of any particular tool, or to expand their individual area of expertise to get a wider and more objective and critical view of the whole area of verification. We also wonder if in our fast expansion we accidentally glossed over some fundamental issue in verification, and if our mistake has now become engraved into the established wisdom and it is sometimes uncritically assumed as a valid reasoning stepping stone. We are particularly interested in sources of unsoundness that are accidentally shared by many different unrelated research lines, and to develop an understanding on why this is the case. The workshop would be its first instance and is meant to be welcoming for both people with strong theoretical skills, as well as people who just like hacking things. We do not expect fully polished submissions and we will not have formal proceedings. Students are especially welcome to attend. ### Examples for possible contributions would be: * Definition of sound and unsound and how they can diverge between tools. * Divergences between user assumptions and actual definitions of soundness. * Common sources of unsoundness and why they emerge. * Bugs and unsoundnesses in the process of extracting a concrete program from a verified environment, e.g., from Coq to Haskell. * Logic errors in the specification of a verification tool, e.g., universe inconsistencies. * Bugs in the implementation of proof checkers. * Overconfident generalizations of sound subsystems to larger settings, e.g., imperative techniques in OO settings. * Disproving soundness statements in published papers about verification. * Finding statements proven in published literature that should no longer be trusted because they relied on a broken verification system. * Simply proving False in a verification tool, in particular we are interested in practical ways to trick available tools to accept wrong statements. * Breaking reasoning about programs with types by breaking the type system of the programming language in new and interesting ways. * Bad interactions between axiomatic choices in libraries used in proofs. * Impacts of the false sense of security when the chain of trust is broken by subtle unsoundness in verification tools. ### Contributions: *Extended Deadline: 2022-09-16 (23:59 AOE)* Submissions should have 3 pages of text. Additional material (bibliography, related work, and code examples) will not count toward this limit. We strongly encourage authors to include instructions to reproduce results or exploits. There will be a friendly peer review process, focusing on checking that the submitted material is appropriate for the workshop. #### Publication Informal proceedings will be made publicly available on the workshop web page. However, presentation at Unsound does not count as prior publication, and can later be published at a conference of the authors' choosing. ### Instruction to Authors #### Submission Authors should be aware of ACM?s policies on plagiarism (https://urldefense.com/v3/__https://www.acm.org/publications/policies/plagiarism__;!!IBzWLUs!XVIDunRXNjARnUZmCH0D2auGeqoNvaxt4UWBtjmM6brQJUYsepQTqotN7hFP87p3eXdO-bwgibATu2fJf9n2XdWSDrPpRUbs9VUwQbnY$ ). Program Committee members are allowed to submit papers. Papers must be submitted online at: https://urldefense.com/v3/__https://unsound2022.hotcrp.com/__;!!IBzWLUs!XVIDunRXNjARnUZmCH0D2auGeqoNvaxt4UWBtjmM6brQJUYsepQTqotN7hFP87p3eXdO-bwgibATu2fJf9n2XdWSDrPpRUbs9TjWt0rM$ #### Formatting: Submitted papers should be in portable document format (PDF), formatted using the ACM SIGPLAN style guidelines. Authors should use the acmart format, with the acmsmall sub-format for ACM proceedings. For details, see: https://urldefense.com/v3/__http://www.sigplan.org/Resources/Author/*acmart-format__;Iw!!IBzWLUs!XVIDunRXNjARnUZmCH0D2auGeqoNvaxt4UWBtjmM6brQJUYsepQTqotN7hFP87p3eXdO-bwgibATu2fJf9n2XdWSDrPpRUbs9Q4SqRKB$ It is recommended to use the review option when submitting a paper; this option enables line numbers for easy reference in reviews. From denis.merigoux at inria.fr Sun Sep 4 11:07:30 2022 From: denis.merigoux at inria.fr (Denis Merigoux) Date: Sun, 4 Sep 2022 17:07:30 +0200 Subject: [TYPES/announce] ProLaLa 2023 -- Programming Languages and the Law (Jan 15th 2023, Boston) : Deadline Oct 27th 2022 Message-ID: An HTML attachment was scrubbed... URL: From wies at cs.nyu.edu Mon Sep 5 19:00:55 2022 From: wies at cs.nyu.edu (Thomas Wies) Date: Mon, 5 Sep 2022 19:00:55 -0400 Subject: [TYPES/announce] Call for Papers: ESOP 2023 Message-ID: <1e5b4c75-4e75-152c-306c-2c16bc5f4a37@cs.nyu.edu> Call for Papers [Apologies for multiple copies of this announcement] ******************************************************************************* CALL FOR PAPERS 32nd European Symposium on Programming ESOP 2023 organized within ETAPS 2023 Paris, France, 22-27 April 2023 https://urldefense.com/v3/__http://www.etaps.org/2023__;!!IBzWLUs!XsuEG94exgxlsKwk4kpb599m2MiGZTRDcZS0MGT_Hhr1l-j2CToCbN7LNZbQ1hEo1WA1axhhrTUIbNjiVXr4tee4DprWyQ$ ******************************************************************************* *Scope* ESOP is an annual conference devoted to fundamental issues in the specification, design, analysis, and implementation of programming languages and systems. ESOP seeks contributions on all aspects of programming language research including, but not limited to, the following areas: programming paradigms and styles, methods and tools to specify and reason about programs and languages, programming language foundations, methods and tools for implementation, concurrency and distribution, applications and emerging topics. Contributions bridging the gap between theory and practice are particularly welcome. *Important Dates AoE (UTC-12)* - Paper submission: October 13, 2022 - Rebuttal: Tuesday 6 December - Thursday 8 December, 2022 - Paper notification: December 22, 2022 - Artifact submission: January 5, 2023 - Paper final version: January 26, 2023 - Artifact notification: February 9, 2023 Conference Submission Link https://urldefense.com/v3/__https://easychair.org/conferences/?conf=esop2023__;!!IBzWLUs!XsuEG94exgxlsKwk4kpb599m2MiGZTRDcZS0MGT_Hhr1l-j2CToCbN7LNZbQ1hEo1WA1axhhrTUIbNjiVXr4tedNMp6g8w$ *Submissions and Review Process* ESOP 2023 has just one paper category: regular research papers of maximal 25 pages (excluding bibliography). Submissions are required to follow Springer's LNCS format. Formatting style files and further guidelines for formatting can be found at the Springer website: https://urldefense.com/v3/__https://www.springer.com/gp/computer-science/lncs/conference-proceedings-guidelines__;!!IBzWLUs!XsuEG94exgxlsKwk4kpb599m2MiGZTRDcZS0MGT_Hhr1l-j2CToCbN7LNZbQ1hEo1WA1axhhrTUIbNjiVXr4tec9L5KDbQ$ . Additional material intended for reviewers but not for publication in the final version - for example, details of proofs - may be placed in a clearly marked appendix that is not included in the page limit. Reviewers are at liberty to ignore appendices and papers must be understandable without them. The review process is double-blind, with a rebuttal phase. In your submission, omit your names and institutions; refer to your prior work in the third person, just as you refer to prior work by others; do not include acknowledgements that might identify you. Submission link: https://urldefense.com/v3/__https://easychair.org/conferences/?conf=esop2023__;!!IBzWLUs!XsuEG94exgxlsKwk4kpb599m2MiGZTRDcZS0MGT_Hhr1l-j2CToCbN7LNZbQ1hEo1WA1axhhrTUIbNjiVXr4tedNMp6g8w$ Accepted papers will be published in Springer's Lecture Notes in Computer Science series. *Artifacts* ESOP 2023 will have a post-paper-acceptance voluntary artifact evaluation. Authors will be welcome to submit artifacts for evaluation after paper notification. The outcome will not alter the paper acceptance decision. *Program Chair* Thomas Wies (New York University) *Program Committee* - Parosh Abdulla (Uppsala University) - Elvira Albert (University of Madrid) - Timos Antonopoulos (Yale University) - Suguman Bansal (University of Pennsylvania) - Josh Berdine (Meta Research) - Annette Bieniusa (Technical University of Kaiserslautern) - Sandrine Blazy (University of Rennes 1) - Johannes Borgstr?m (Uppsala University) - Georgiana Caltais (Konstanz University) - Ankush Das (AWS) - Cezara Dr?goi (INRIA, ENS) - Michael Emmi (AWS) - Simon Gay (University of Glasgow) - Silvia Ghilezan (University of Novi Sad) - Jan Hoffman (CMU) - Shachar Itzhaky (Technion) - Benjamin Kaminski (University College London) - Robbert Krebbers (Radboud University Nijmegen) - Viktor Kuncak (EPFL) - Roland Meyer (TU Braunschweig) - David Monniaux (VERIMAG) - Jorge P?rez (University of Groningen) - Andrei Popescu (The University of Sheffield) - Jonathan Protzenko (Microsoft Research) - Graeme Smith (University of Queensland) - Ana Sokolova (University of Salzburg) - Alexander Summers (UBC) - Tachio Terauchi (Waseda University) - Caterina Urban (INRIA) - Niki Vazou (IMDEA Software Institute) *Artifact Evaluation Chairs* - Niccol? Veltri (Tallinn University of Technology) - Sebastian Wolff (New York University) *Steering Committee* - Amal Ahmed (Northeastern University) - Luis Caires (Universidade Nova de Lisboa) - Peter Mueller (ETH Zurich) - Brigitte Pientka (McGill University) - Ilya Sergey (National University of Singapore) - Thomas Wies (New York University) - Nobuko Yoshida (Imperial College London) From nuno.lopes at tecnico.ulisboa.pt Tue Sep 6 05:16:39 2022 From: nuno.lopes at tecnico.ulisboa.pt (Nuno Lopes) Date: Tue, 6 Sep 2022 10:16:39 +0100 Subject: [TYPES/announce] PhD scholarship for compiler verification Message-ID: <003a01d8c1d1$5ef6d530$1ce47f90$@tecnico.ulisboa.pt> Dear students, We have an open call for one PhD scholarship for automated compiler verification. This is a 4-year position at the University of Lisbon / INESC-ID (Portugal). The position is fully funded by the Portuguese science foundation. I'll be the advisor. Potential candidates should consult my previous and ongoing work on my website: https://urldefense.com/v3/__https://web.ist.utl.pt/nuno.lopes/__;!!IBzWLUs!XAnQx_3NKo3T4Xy8T3CnSGfJiZGKNmftoSdX64dEfNNRnpPT_A9oTWplfAm1jSTcJDgPg_Fj8oU3Bb3_AIOlAhPBRutTAIUwv9Kk5ZDibZU$ Candidates *must* contact me before applying, as the application process requires a study plan and a letter from the advisor. Ideally (though not required) you should have some experience with SMT solving and/or compilers (namely LLVM). The monthly stipend is ?1,144.64 (exempt of taxes). More information about the call here: https://urldefense.com/v3/__https://www.inesc-id.pt/wp-content/uploads/2022/05/BD_PhD__UIDB_50021_2022_pt_en_dec_2022.pdf__;!!IBzWLUs!XAnQx_3NKo3T4Xy8T3CnSGfJiZGKNmftoSdX64dEfNNRnpPT_A9oTWplfAm1jSTcJDgPg_Fj8oU3Bb3_AIOlAhPBRutTAIUwv9KkkS42ueY$ The deadline for applications is 15/December, though candidates should contact me well in advance. Thanks, Nuno Lopes From cenea at irif.fr Wed Sep 7 13:16:26 2022 From: cenea at irif.fr (Constantin Enea) Date: Wed, 7 Sep 2022 19:16:26 +0200 Subject: [TYPES/announce] CAV 2023 PC Nomination Message-ID: <4EB057EE-DFD7-4D9E-9908-FEEAA71E116F@irif.fr> CAV 2023 (35th International conference on Computer Aided Verification) is inviting nominations for its Program Committee. You can nominate yourself or someone else. Nominations are due September 23rd! The CAV (Computer Aided Verification) conference is dedicated to the advancement of the theory and practice of computer-aided formal analysis methods for hardware, software, and computing systems. The conference covers the spectrum from theoretical results to concrete applications, with an emphasis on practical verification tools and the algorithms and techniques that are needed for their implementation. We expect that PC members will review approximately 10-12 papers. The reviewing process will be double-blind and will include an author response. To respect the double-blind process, we will request PC members to review the papers by themselves (with exceptions allowed in consultation with the PC Chairs). Please note that serving on the PC involves a serious commitment to scientific excellence and professional responsibility, along with availability for providing timely reviews and engaging in online PC discussions. We expect that nominees for the PC will have a record of publishing at CAV or related top-tier conferences in formal methods and programming languages. We also seek experts in application domain areas (e.g., network/distributed systems, machine learning, biological systems) where interest in formal methods is high and growing. It is not necessary for nominees to have served on a CAV PC before, and we welcome all excellent nominees. Please use the form at the following link: https://urldefense.com/v3/__https://docs.google.com/forms/d/e/1FAIpQLSd_w-apI43OZhJVT2FktI8z9Y-lwd_5vcoB6VzeTMaNfshtSA/viewform?fbclid=IwAR2_HWoxi_fAqR1tIKpdHosH1LChwLszFNolhcJjt6KD_AA_EHePxLSMD3c__;!!IBzWLUs!WcHeEQAvvZM3z2HVBcTwzOJzucL_d2qpq7xcFbwTt5wvf324sV1R5P2ppmuAsRbWhkWUBq2hYWcq0gYVB2N7GzQWEuqR$ -------------- next part -------------- An HTML attachment was scrubbed... URL: From pierre-marie.pedrot at inria.fr Thu Sep 8 05:03:43 2022 From: pierre-marie.pedrot at inria.fr (=?UTF-8?Q?Pierre-Marie_P=c3=a9drot?=) Date: Thu, 8 Sep 2022 11:03:43 +0200 Subject: [TYPES/announce] TYPES 2022 First Post-proceeding CfP Message-ID: <23859e34-c630-3201-a758-4ec2dfaf6300@inria.fr> TYPES is a major forum for the presentation of research on all aspects of type theory and its applications. TYPES 2022 was held from 20 to 25 June at LS2N, University of Nantes, France. The post-proceedings volume will be published in LIPIcs, Leibniz International Proceedings in Informatics, an open-access series of conference. Submission Guidelines Submission is open to everyone, also to those who did not participate in the TYPES 2022 conference. We welcome high-quality descriptions of original work, as well as position papers, overview papers, and system descriptions. Submissions should be written in English, and being original, i.e. neither previously published, nor simultaneously submitted to a journal or a conference. - Papers have to be formatted with the current LIPIcs style and adhere to the style requirements of LIPIcs. - The upper limit for the length of submissions is 20 pages, excluding bibliography (but including title and appendices). - Papers have to be submitted as PDF. A link to the submission system will be made available on https://types22.inria.fr/. - Authors have the option to attach to their submission a zip or tgz file containing code (formalised proofs or programs), but reviewers are not obliged to take the attachments into account and they will not be published. Deadlines - Abstract Submission : 31 October 2022 (AoE) - Paper submission: 30 November 2022 (AoE) - Author notification: 31 March 2022 List of Topics The scope of the post-proceedings is the same as the scope of the conference: the theory and practice of type theory. In particular, we welcome submissions on the following topics: - Foundations of type theory; - Applications of type theory (e.g. linguistics or concurrency); - Constructive mathematics; - Dependently typed programming; - Industrial uses of type theory technology; - Meta-theoretic studies of type systems; - Proof assistants and proof technology; - Automation in computer-assisted reasoning; - Links between type theory and functional programming; - Formalising mathematics using type theory; - Homotopy type theory and univalent mathematics. Editors Delia Kesner, Universit? Paris Cit?, FR (delia.kesner at irif.fr) Pierre-Marie P?drot, INRIA, FR (pierre-marie.pedrot at inria.fr) Contact In case of questions, contact the editors directly. -------------- next part -------------- A non-text attachment was scrubbed... Name: OpenPGP_signature Type: application/pgp-signature Size: 840 bytes Desc: OpenPGP digital signature URL: From andreeac at comp.nus.edu.sg Fri Sep 9 04:13:58 2022 From: andreeac at comp.nus.edu.sg (Andreea Costea) Date: Fri, 09 Sep 2022 16:13:58 +0800 Subject: [TYPES/announce] OOPSLA 2023: Round 1 Call for Papers Message-ID: ======================================================================== PACMPL Issue OOPSLA 2023 Call for Papers OOPSLA 2023 will be held as part of The ACM Conference on Systems, Programming, Languages, and Applications: Software for Humanity (SPLASH'23) October 23-27, 2023, Lisbon, Portugal https://urldefense.com/v3/__https://2023.splashcon.org/track/splash-2023-oopsla__;!!IBzWLUs!WLYMMuJasLN1Fp5eir6D2YL_xTGyQuMq-2Uu0NgMek9tmKyKcgASDENdz6nSZ83zmuyLQqaoDVLBnX84WDGVtm3wu993-Iotg3zQhTA$ ======================================================================== ### Important dates ROUND 1: Submission Deadline: Fri Oct 28, 2022 Author Response: Wed Dec 07 - Fri Dec 9 Author Notification: Thu Dec 22 Submission of Revisions: Mon Feb 13 - Fri Feb 24 ROUND 2: Submission Deadline: Fri Apr 14, 2023 Author Response: Wed Jun 14 - Fri Jun 16 Author Notification: Fri Jun 30 Submission of Revisions: Mon Aug 14 - Fri Aug 18 Camera ready: Thu Aug 31 Papers accepted at either of the rounds will be published in the 2023 volume of PACMPL(OOPSLA) and invited to be presented at the SPLASH conference in October 2023. ### 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 PACMPL(OOPSLA) has two _rounds_ of reviewing. The final outcome of each round can be one of Accept, Revise or Reject. *Accept*: Accepted papers will appear at the next PACMPL(OOPSLA). *Revise*: Papers in this category are invited to submit a revision to the _next round_ of submissions with a specific set of expectations to be met. When authors resubmit, they should clearly explain how the revisions address the comments of the reviewers. The revised paper will be re-evaluated, and either accepted or rejected. Resubmitted papers will retain the same reviewers throughout the process. *Reject*: Rejected papers will not be included in the 2023 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 and whether, in this case, it will be reviewed or not is at the discretion of the Chair. Obviously, this same policy applies to papers that were rejected for inclusion in the 2022 volume of PACMPL(OOPSLA). 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!WLYMMuJasLN1Fp5eir6D2YL_xTGyQuMq-2Uu0NgMek9tmKyKcgASDENdz6nSZ83zmuyLQqaoDVLBnX84WDGVtm3wu993-IotHBbZ8_E$ ). 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!WLYMMuJasLN1Fp5eir6D2YL_xTGyQuMq-2Uu0NgMek9tmKyKcgASDENdz6nSZ83zmuyLQqaoDVLBnX84WDGVtm3wu993-IotWzMRzzM$ ). 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!WLYMMuJasLN1Fp5eir6D2YL_xTGyQuMq-2Uu0NgMek9tmKyKcgASDENdz6nSZ83zmuyLQqaoDVLBnX84WDGVtm3wu993-Iot2uJbCx8$ ). 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!WLYMMuJasLN1Fp5eir6D2YL_xTGyQuMq-2Uu0NgMek9tmKyKcgASDENdz6nSZ83zmuyLQqaoDVLBnX84WDGVtm3wu993-Iotqh6AQo4$ ). ### 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. ### Additional Information Consult FAQ in Call for Papers at: https://urldefense.com/v3/__https://2023.splashcon.org/track/splash-2023-oopsla__;!!IBzWLUs!WLYMMuJasLN1Fp5eir6D2YL_xTGyQuMq-2Uu0NgMek9tmKyKcgASDENdz6nSZ83zmuyLQqaoDVLBnX84WDGVtm3wu993-Iotg3zQhTA$ ### Review Committee PC Chair: Mira Mezini (TU Darmstadt) Jonathan Aldrich (CMU, USA) Karim Ali (U. Alberta, Canada) Peter Alvaro (UC Santa Cruz, USA) Stefanie Balzer (CMU, USA) Osbert Bastani (U. Penn, USA) Annette Bieniusa (U. Kaiserslautern, Germany) Sebastian Burkhardt (MSR, Switzerland) Satish Chandra (Facebook, USA) James Cheney (University of Edinburgh; Alan Turing Institute, UK) Albert Cohen (Google, France) Wolfgang De Meuter (VUB, BE) Dominique Devriese (KU Leuven, Belgium) Dana Drachsler Cohen (Technion, Israel) Derek Dreyer (MPI Saarbr?cken, DE) Sophia Drosopolou (Imperial College, UK) Jana Dunfield (Queen?s University in Kingston, Ontario, CA) Sebastian Erdweg (U. Mainz, Germany) Patrick Eugster (USI, Switzerland) Matthew Flatt (U. Utah, USA) Jeremy Gibbons (U. Oxford, UK) Anitha Gollamudi (UMass, USA) Elisa Gonzalez Boix (VUB, Belgien) Andrew Gordon (MS Research, Edinburgh, UK) Dan Grossman (U. Washington, USA) Arjun Guha (Northeastern U., USA) Philipp Haller (KTH, Sweden) G?rel Hedin (Lund University, Sweden) Steven Holtzen (Northeastern U., USA) Justin Hsu (Cornell University, USA) Atsushi Igarashi (Kyoto U., Japan) Ranjit Jhala (UC San Diego, USA) Gowtham Kaki (U. Colorado, USA) Shriram Krishnamurthi (Brown University, USA) Neel Krishnaswami (Cambridge, UK) Burcu Kulahcioglu Ozkan (Delft University of Technology, The Netherlands) Sorin Lerner (UCSD, USA) Hongjin Liang (Nanjing University, CN) Crista Lopes (UC Irvine, USA) Kenji Maillard (Inria Nantes & University of Chile) Hidehiko Masuhara (Tokyo Institute of Technology, Japan) Ana Milanova (Rensselaer Polytechnic Institute) Heather Miller (CMU, USA) Ragnar Mogk (TU Darmstadt, DE) Anders M?ller (Aarhus U,, Danemark) Fabrizio Montesi (Univ. of Southern Denmark, Denmark) Sarah Nadi (U. Alberta, Canada) James Noble (U. Wellington, New Zealand) Bruno C. d. S. Oliveira (U. Hong Kong, Hong Kong) Klaus Ostermann (U. T?bingen, Germany) Mangpo Phothilimthana (Google Brain, USA) Benjamin Pierce (UPenn, USA) Nadia Polikarpova (UC San Diego, USA) Michael Pradel (U. Stuttgart, Germany) Shaz Qadeer (Facebook, USA) Marianna Rapoport (Amazon Web Services, Canada) Cindy Rubio-Gonz?lez (UC Davis, USA) Sukyoung Ryu (KAIST, Korea) Guido Salvaneschi (U. St. Gallen, Switzerland) Mark Santolucito (Columbia, USA) Ilya Sergey (National University of Singapore, Singapore) Armando Solar-Lezama (MIT, USA) Manu Sridharan (University of California, USA) Charles Sutton (Google, UK) Joseph Tassarotti (New York University, USA) Ross Tate (Cornell U., USA) Peter Thiemann (U. Freiburg, Germany) Bernardo Toninho (Universidade Nova de Lisboa, Portugal) Viktor Vafeiadis (MPI, Germany) Tijs van der Storm (CWI; University of Groningen, Netherlands) Vasco Vasconcelos (U. Lisbon, Portugal) Jan Vitek (Northeastern U./Czech Technical University) Dimitrios Vytiniotis (DeepMind, UK) David Walker (Princeton, USA) Conrad Watt (U. Cambridge, UK) Pascal Weisenburger (U. St. Gallen, Switzerland) Qirun Zhang (Gatech, USA) From luigi.santocanale at lis-lab.fr Fri Sep 9 10:20:32 2022 From: luigi.santocanale at lis-lab.fr (Luigi Santocanale) Date: Fri, 9 Sep 2022 16:20:32 +0200 Subject: [TYPES/announce] RAMiCS 2023 - Third call for papers Message-ID: <8d95251c-7c66-9670-c562-0c69c5b7f17e@lis-lab.fr> (Apologies for multiple posting) THIRD AND LAST CALL FOR PAPERS ???????????????????? 20th International Conference on ?????????? Relational and Algebraic Methods in Computer Science ?????????????????????????????? RAMiCS 2023 ??????????3 to 6 April 2023, Technologiezentrum Augsburg, Germany https://urldefense.com/v3/__https://ramics20.lis-lab.fr/__;!!IBzWLUs!UpoPqAnNHJkSI6SFXO--ahknU1Ah8SFfEJQWhmCRfgeRv3TuLwziFRFG0SxrBab4JM4xr1NYf4TXWYk2xRfvTdloM3Bjp-jBZd7EIEeeyDzB$ IMPORTANT DATES: ??? Abstract Submission:??? September 23, 2022 ??? Paper Submission:? ?????September 30, 2022 ??? Author Notification:??? December 09, 2022 ??? Final Version:????????? January 06, 2023 ??? RAMiCS 2023:??????????? April 03-06, 2023 GENERAL INFORMATION: Since 1994, the RAMiCS conference series has been the main venue for research on relation algebras, Kleene algebras and similar algebraic formalisms, and their applications as conceptual and methodological tools in computer science and beyond. RAMiCS 2023 will take place at the Technologiezentrum Augsburg. Depending on the Covid-19 situation, it will take the form of a physical conference, a virtual conference, or a hybrid between the two. TOPICS: We invite submissions in the general fields of algebras relevant to computer science and applications of such algebras. Topics include but are not limited to: * Theory ?? - algebras such as semigroups, residuated lattices, semirings, Kleene algebras, relation algebras and quantales - their connections with program logics and other logics ?? - their use in the theories of automata, concurrency, formal languages, ???? games, networks and programming languages ?? - the development of algebraic, algorithmic, category-theoretic, ???? coalgebraic and proof-theoretic methods for these theories ?? - their formalisation with theorem provers * Applications ?? - tools and techniques for program correctness, specification and ???? verification ?? - quantitative and qualitative models and semantics of computing ???? systems and processes ?? - algorithm design, automated reasoning, network protocol analysis, ???? social choice, optimisation and control ?? - industrial applications INVITED SPEAKERS ??? Alexander Knapp, Augsburg University, Germany ??? John Stell, University of Leeds, UK ??? Valeria Vignudelli, CNRS/ENS Lyon, France SUBMISSION INSTRUCTIONS: Submission is via EasyChair at https://urldefense.com/v3/__https://www.easychair.org/conferences/?conf=ramics2023__;!!IBzWLUs!UpoPqAnNHJkSI6SFXO--ahknU1Ah8SFfEJQWhmCRfgeRv3TuLwziFRFG0SxrBab4JM4xr1NYf4TXWYk2xRfvTdloM3Bjp-jBZd7EIAGY7Vot$ All papers will be peer-reviewed by at least three referees. The proceedings will be published in an LNCS volume by Springer, ready at the conference. Submissions must not be published or under review for publication elsewhere. Submissions must be in English using a PDF not exceeding 16 pages in LNCS style. Submissions must provide sufficient information to judge their merits. Additional material may be provided in a clearly marked appendix or by a reference to a manuscript on a web site. Experimental data, software or mathematical components for theorem provers must be available in sufficient detail for referees. Deviation from these requirements may lead to rejection. One author of each accepted paper is expected to present the paper at the conference. Accepted papers must be produced with LaTeX. Formatting instructions and LNCS style files are available at https://urldefense.com/v3/__http://www.springer.de/comp/lncs/authors.html__;!!IBzWLUs!UpoPqAnNHJkSI6SFXO--ahknU1Ah8SFfEJQWhmCRfgeRv3TuLwziFRFG0SxrBab4JM4xr1NYf4TXWYk2xRfvTdloM3Bjp-jBZd7EII1M62sc$ As for earlier RAMiCS conferences, we intend to publish a journal special issue with revised and extended versions of a selection of the best papers. COMMITTEES: ?? Organising Committee ?? -------------------- ?? Conf. & PC Co-Chair: Roland Gl?ck, Deutsches Zentrum f?r Luft- und Raumfahrt, Germany Conf. & PC Co-Chair: Luigi Santocanale, LIS, Aix-Marseille University, France ?? Conf. & PC Co-Chair: Michael Winter, Brock University, Canada ???Programme Committee ?? ------------------- ??? Adriana Balan, University Politechnic of Bucharest, Romania ??? Manuel Bodirsky, Technical University Dresden, Germany ??? Paul Brunet, Paris-East Cr?teil University, France ??? Miguel Couceiro, Loria, Nancy, France ??? Manfred Droste, Leipzig University, Germany ??? Uli Fahrenberg, Epita, France ??? Hitoshi Furusawa, Kagoshima University, Japan ??? Wesley Fussner, University of Bern, Switzerland ??? Silvio Ghilardi, University of Milan, Italy ??? Roland Glueck, German Aerospace Center, Augsburg, Germany ??? Walter Guttmann, University of Canterbury, New Zealand ??? Robin Hirsch, University College London, UK ??? Peter H?fner, Australian National University, Canberra, Australia ??? Marcel Jackson, La Trobe University, Melbourne, Australia ??? Ali Jaoua, Qatar University, Qatar ??? Peter Jipsen, Chapman University, Orange, USA ??? Sebastian Joosten, Dartmouth College, Hanover, USA ??? Barbara K?nig, University of Duisburg/Essen, Germany ??? Wendy MacCaull, St. Francis Xavier University, Antigonish, Canada ??? Roger Maddux, Iowa State University, Ames, USA ??? Nelma Moreira, University of Porto, Portugal ??? Martin Mueller, University of Applied Sciences, Bonn-Rhein-Sieg, Germany ??? Damien Pous, CNRS, ENS Lyon, France ??? Luigi Santocanale, Aix-Marseille University, France ??? Ana Sokolova, University of Salzburg, Austria ??? Sara Ugolini, Artificial Intelligence Research Institute of the CSIC, Spain ??? Michael Winter, Brock University, St. Catharines, Canada ??? Sam van Gool, University Paris, France -------------- next part -------------- An HTML attachment was scrubbed... URL: From andrzej.murawski at cs.ox.ac.uk Sat Sep 10 06:43:36 2022 From: andrzej.murawski at cs.ox.ac.uk (Andrzej Murawski) Date: Sat, 10 Sep 2022 11:43:36 +0100 Subject: [TYPES/announce] 2022 Alonzo Church Award Announcement Message-ID: <3034C8AC-71D8-4CD7-AB45-9BF0723A8546@cs.ox.ac.uk> 2022 ALONZO CHURCH AWARD ANNOUNCEMENT The ACM Special Interest Group on Logic (SIGLOG), the European Association for Theoretical Computer Science (EATCS), the European Association for Computer Science Logic (EACSL), and the Kurt Goedel Society (KGS) are pleased to announce that Dexter Kozen has been selected as the winner of the 2022 Alonzo Church Award for Outstanding Contributions to Logic and Computation for his fundamental work on developing the theory and applications of Kleene Algebra with Tests, an equational system for reasoning about iterative programs, published in: Kleene Algebra with Tests. ACM Transactions on Programming Languages and Systems 19(3): 427-443 (1997). THE CONTRIBUTION This work on Kleene Algebra with Tests (KAT) is one of the high points among remarkable contributions of Dexter Kozen to logics of programs. It is a culmination of a series of articles by Dexter Kozen that define and apply Kleene Algebra with Tests (KAT), an equational system that combines Kleene Algebra (the algebra of regular expressions) with Boolean Algebra (the tests). Together, the terms of the two algebras are capable of representing while programs, and their combined equational theory is capable of proving a wide range of important properties of programs. Although reasoning in KAT under arbitrary commuting conditions is undecidable, Kozen observes that when the commuting conditions are limited to including tests, it is decidable and in PSPACE. He illustrates the power of KAT with these decidable commuting conditions by proving a well-known folk theorem: Every while program can be simulated by a program with just one loop. KAT has been successfully applied to a variety of problems over the past 25 years, including modeling and reasoning about packet-switched networks. The 2022 Church Award was selected by a jury consisting of Thomas Colcombet, Mariangiola Dezani, Javier Esparza, Radha Jagadeesan (chair), and Igor Walukiewicz. From catalin.hritcu at gmail.com Sun Sep 11 03:02:59 2022 From: catalin.hritcu at gmail.com (Catalin Hritcu) Date: Sun, 11 Sep 2022 09:02:59 +0200 Subject: [TYPES/announce] Looking for PostDoc on Program Verification Techniques in F* and Coq Message-ID: Hello everyone, A Postdoctoral Research position on Program Verification Techniques in F* and Coq is available in my group at the Max Planck Institute for Security and Privacy (MPI-SP). I am looking for candidates with an excellent research track record and publications at top conferences (especially POPL and ICFP). I am particularly looking for someone with research expertise in: formal verification, proof assistants (particularly Coq and/or F*), type theory, effects, monads, functional programming, parametricity, programming language semantics, etc. Candidates are expected to work collaboratively on topics of joint interest and to help co-advise students, but can also dedicate some of their time to their own independent projects. MPI-SP is a relatively new research institute founded in 2019 and is part of the Computer Science area of the Max Planck Society . We are located on the campus of Ruhr University Bochum, in the Rhein-Ruhr metropolitan region, Germany?s largest academic hub. The working language of MPI-SP is English, and no knowledge of German is required for this job. Do not hesitate to contact me if you are interested in this position! (or to forward this to someone who could be interested) Kind Regards, Catalin Hritcu https://urldefense.com/v3/__https://catalin-hritcu.github.io__;!!IBzWLUs!RyFIxUeMi0ltHMQ9-5t9wrWLjyB73bjk00RlD0_Cm53yM5JR8kX24ufewVt472yH3PiZF4ziz4WRozLvY-_vDo5JqDdfMlkITE9O7Dk$ PS: If you?re interested in this position, in a couple of days I can also provide you with a large (non-exhaustive) list of potential research topics on which we could work together. In the meantime, here are our recent papers in this space: Verifying non-terminating programs with IO in F* . Cezar-Constantin Andrici, Th?o Winterhalter, C?t?lin Hri?cu, and Exequiel Rivas. To be presented at the 10th ACM SIGPLAN Workshop on Higher-Order Programming with Effects (HOPE 2022) . 11 September 2022 (today!). Partial Dijkstra Monads for All . Th?o Winterhalter, Cezar-Constantin Andrici, C?t?lin Hri?cu, Kenji Maillard, Guido Mart?nez, and Exequiel Rivas. Presented at the 28th International Conference on Types for Proofs and Programs (TYPES 2022) . 2022. SSProve: A Foundational Framework for Modular Cryptographic Proofs in Coq . Carmine Abate, Philipp G. Haselwarter, Exequiel Rivas, Antoine Van Muylder, The?o Winterhalter, C?t?lin Hri?cu, Kenji Maillard, and Bas Spitters. In 34th IEEE Computer Security Foundations Symposium (CSF) . 2021. Distinguished Paper Award. Dynamic IFC Theorems for Free! Maximilian Algehed, Jean-Philippe Bernardy, and C?t?lin Hri?cu. In 34nd IEEE Computer Security Foundations Symposium (CSF) . 2021. Hybrid Enforcement of IO Trace Properties . Cezar-Constantin Andrici. 1st prize in the Student Research Competition of ICFP 2020 . The Next 700 Relational Program Logics . Kenji Maillard, C?t?lin Hri?cu, Exequiel Rivas, and Antoine Van Muylder. PACMPL, 4(POPL ), 2020. Dijkstra Monads for All . Kenji Maillard, Danel Ahman, Robert Atkey, Guido Mart?nez, C?t?lin Hri?cu, Exequiel Rivas, and ?ric Tanter. PACMPL, 3(ICFP ), 2019. Recalling a Witness: Foundations and Applications of Monotonic State . Danel Ahman, C?dric Fournet, C?t?lin Hri?cu, Kenji Maillard, Aseem Rastogi, and Nikhil Swamy. PACMPL, 2(POPL ), 2018. -------------- next part -------------- An HTML attachment was scrubbed... URL: From andreeac at comp.nus.edu.sg Tue Sep 13 22:03:15 2022 From: andreeac at comp.nus.edu.sg (Andreea Costea) Date: Wed, 14 Sep 2022 10:03:15 +0800 Subject: [TYPES/announce] PLMW@SPLASH 2022: Call for Student Participation! Programming Languages Mentoring Workshop Message-ID: <2a56a6ceedeb5fc012ab03545255bf88@comp.nus.edu.sg> ACM SIGPLAN Programming Languages Mentoring Workshop December 6-7, 2022 The organizing committee of the Programming Languages Mentoring Workshop (PLMW) at SPLASH 2022 [1] is looking for students who are interested in programming languages and software engineering research to apply. The workshop is aimed at late-stage undergraduates interested in graduate school, as well as early-career Masters/PhD students. A key mission of this workshop is to increase the diversity of students who apply to (and, crucially, remain in) PhD programs. Attending conferences is often a transformative experience for students and can go a long way to make them feel part of the research community. Coupled with the mentorship that PLMW provides, we hope to build excitement about research and nurture an environment of inclusivity. The attached flyer explains what programming languages research is and why students might want to apply to PLMW. They can find more information and insights from previous participants at the workshop website [1]. Applications are required (due by September 26th for full consideration) and there are scholarships available for both in person and virtual participation. PLMW highly encourages applicants from first time conference attendees and members of underrepresented groups in computing. Please feel free to ask any questions via the contact form [2]. Youyou Cong, Molly Feldman, James Tizard and Lukasz Ziarek Organizing Committee for PLMW at SPLASH 2022 P.S. If students are interested in attending a PLMW, but the timing/location of PLMW at SPLASH does not work well, consider the next PLMW iteration in 2023: https://urldefense.com/v3/__https://popl23.sigplan.org/home/PLMW-POPL-2023__;!!IBzWLUs!X_UGrJsLMqmbyH9ms23DPgwmfeW8WaK9db_zIfvWyuMO_c5d4bk6YXSreHgcZAb64DCLejWrEckOIFTP9U5yuY8GEWYcRbjo1dO_DGM$ Links: ------ [1] https://urldefense.com/v3/__https://2022.splashcon.org/track/splash-2022-PLMW__;!!IBzWLUs!X_UGrJsLMqmbyH9ms23DPgwmfeW8WaK9db_zIfvWyuMO_c5d4bk6YXSreHgcZAb64DCLejWrEckOIFTP9U5yuY8GEWYcRbjoF4nMLqc$ [2] https://urldefense.com/v3/__https://2022.splashcon.org/contact2/splash-2022-PLMW__;!!IBzWLUs!X_UGrJsLMqmbyH9ms23DPgwmfeW8WaK9db_zIfvWyuMO_c5d4bk6YXSreHgcZAb64DCLejWrEckOIFTP9U5yuY8GEWYcRbjoClx4Rg8$ -------------- next part -------------- An HTML attachment was scrubbed... URL: -------------- next part -------------- A non-text attachment was scrubbed... Name: PLMW at SPLASH 2022 Recruitment Poster.pdf Type: application/pdf Size: 334366 bytes Desc: not available URL: From christine.tasson at lip6.fr Wed Sep 14 03:01:59 2022 From: christine.tasson at lip6.fr (Christine Tasson) Date: Wed, 14 Sep 2022 09:01:59 +0200 Subject: [TYPES/announce] LAFI 2023 - Call for Extended Abstracts (deadline Oct. 20) - POPL 2023 workshop on Languages for Inference Message-ID: ?===================================================================== ???????????????????? Call for Extended Abstracts ????????????????????????????? LAFI 2023 ???????????? POPL 2023 workshop on Languages for Inference ??????????????????????????? January 15, 2023 https://urldefense.com/v3/__https://popl23.sigplan.org/home/lafi-2023__;!!IBzWLUs!We13TOkHK6r79ITgJsnjSiC0J-JvnnUEmorBUJceT1pQydIhGTH1g6q6xM1cJbfefFQGlBtYx08xx9pHkEPJ1ImAH5z60u0AeP5wQzKGoZc$ ?????????????? Submission deadline on October 20, 2022! ==================================================================== ** Submission Summary Deadline: October 20, 2022 (AoE) Link: https://urldefense.com/v3/__https://lafi23.hotcrp.com/__;!!IBzWLUs!We13TOkHK6r79ITgJsnjSiC0J-JvnnUEmorBUJceT1pQydIhGTH1g6q6xM1cJbfefFQGlBtYx08xx9pHkEPJ1ImAH5z60u0AeP5wWzrAsS8$ Format: extended abstract (2 pages + references) ** Call for Extended Abstracts Inference concerns re-calibrating program parameters based on observed data, and has gained wide traction in machine learning and data science. Inference can be driven by probabilistic analysis and simulation, and through back-propagation and differentiation. Languages for inference offer built-in support for expressing probabilistic models and inference methods as programs, to ease reasoning, use, and reuse. The recent rise of practical implementations as well as research activity in inference-based programming has renewed the need for semantics to help us share insights and innovations. This workshop aims to bring programming-language and machine-learning researchers together to advance all aspects of languages for inference. Topics include but are not limited to: - design of programming languages for inference and/or differentiable programming; - inference algorithms for probabilistic programming languages, including ones that incorporate automatic differentiation; - automatic differentiation algorithms for differentiable programming languages; - probabilistic generative modeling and inference; - variational and differential modeling and inference; - semantics (axiomatic, operational, denotational, games, etc) and types for inference and/or differentiable programming; - efficient and correct implementation; - and last but not least, applications of inference and/or differentiable programming. We expect this workshop to be informal, and our goal is to foster collaboration and establish common ground. Thus, the proceedings will not be a formal or archival publication, and we expect to spend only a portion of the workshop day on traditional research talks. Nevertheless, as a concrete basis for fruitful discussions, we call for extended abstracts describing specific and ideally ongoing work on probabilistic and differential programming languages, semantics, and systems. ** Submission guidelines - Submission deadline on October 20, 2022 (AoE) - Submission link: https://urldefense.com/v3/__https://lafi23.hotcrp.com/__;!!IBzWLUs!We13TOkHK6r79ITgJsnjSiC0J-JvnnUEmorBUJceT1pQydIhGTH1g6q6xM1cJbfefFQGlBtYx08xx9pHkEPJ1ImAH5z60u0AeP5wWzrAsS8$ Anonymous extended abstracts are up to 2 pages in PDF format, excluding references. In line with the SIGPLAN Republication Policy, inclusion of extended abstracts in the program is not intended to preclude later formal publication. -------------- next part -------------- An HTML attachment was scrubbed... URL: From duongtd at jaist.ac.jp Wed Sep 14 04:30:54 2022 From: duongtd at jaist.ac.jp (TRAN Dinh Duong) Date: Wed, 14 Sep 2022 17:30:54 +0900 Subject: [TYPES/announce] (Deadline Extended: Sep 22) Call for Papers for FAVPQC 2022 - International Workshop on Formal Analysis and Verification of Post-Quantum Cryptographic Protocols 2022 Message-ID: Call for Papers for International Workshop on Formal Analysis and Verification of Post-Quantum Cryptographic Protocols 2022 https://urldefense.com/v3/__https://favpqc2022.gitlab.io/__;!!IBzWLUs!UJA_K5vD_BJN3ESCz7bFaTIIqC0QJHjOtU2oDF9PfWOeWtPVCH7leM_frSCmSO7YPOyyIQR60MqgjBom7R4NGIiZZlDIw1Tba-o$ SUBMISSION DEADLINE: September 22, 2022 (EXTENDED) SPECIAL ISSUE SUBMISSION INVITATION We plan a special issue of FAVPQC at PeerJ Computer Science (Q1 for 2017-2019, Q2 for 2020) as follows: On behalf of the Organising Committee, we are pleased to offer you the opportunity to submit your full research papers to the collection "Practical and Theoretical Aspects of Logic, Cyber Security and Cryptography", which will be published in the journal PeerJ Computer Science. See the homepage here: https://urldefense.com/v3/__https://peerj.com/special-issues/117-logic-cs-crypt__;!!IBzWLUs!UJA_K5vD_BJN3ESCz7bFaTIIqC0QJHjOtU2oDF9PfWOeWtPVCH7leM_frSCmSO7YPOyyIQR60MqgjBom7R4NGIiZZlDIRDHc4bc$ . Once published, this collection will become a highly-visible showcase of the most recent research focused on Logic, Cyber Security and Cryptography. Authors wishing to be included should read the PeerJ Computer Science author instructions and then submit via https://urldefense.com/v3/__https://peerj.com/new/__;!!IBzWLUs!UJA_K5vD_BJN3ESCz7bFaTIIqC0QJHjOtU2oDF9PfWOeWtPVCH7leM_frSCmSO7YPOyyIQR60MqgjBom7R4NGIiZZlDISu46nJ8$ . Please include "Submitted to the Logic, CyberSecurity and Cryptography Collection - PJCS-COLL-LCSC" in the Confidential Note to Staff field of the submission form. The deadline for submissions is 20th January 2023. If accepted for publication, authors will be required to pay either an Article Processing Charge or a PeerJ Lifetime Membership, please see https://urldefense.com/v3/__https://peerj.com/pricing/__;!!IBzWLUs!UJA_K5vD_BJN3ESCz7bFaTIIqC0QJHjOtU2oDF9PfWOeWtPVCH7leM_frSCmSO7YPOyyIQR60MqgjBom7R4NGIiZZlDIvydWpLc$ for details. TOPICS OF INTEREST Authors are invited to submit papers describing original and unpublished work somehow related to formal analysis and verification of post-quantum cryptographic protocols. Topics of interest include, but are not limited to: - Post-quantum cryptosystems - Post-quantum cryptographic protocols - Logics of quantum computing/algorithms/programs - Formal analysis/verification of those related to the above-mentioned PUBLICATION Proceedings shall be submitted to CEUR-WS.org for online publication. Therefore, authors are supposed to use the CEUR-ART template style for preparing papers. In addition to regular papers (12 - 16 pages), authors are also recommended to submit short papers (6 - 8 pages), such as work-in-progress ones and tool demonstration ones. Papers submitted as regular papers may be accepted as short papers. PAPER SUBMISSIONS Submissions must be uploaded to the following EasyChair website: https://urldefense.com/v3/__https://easychair.org/conferences/?conf=favpqc2022__;!!IBzWLUs!UJA_K5vD_BJN3ESCz7bFaTIIqC0QJHjOtU2oDF9PfWOeWtPVCH7leM_frSCmSO7YPOyyIQR60MqgjBom7R4NGIiZZlDIcoqM254$ IMPORTANT DATES - Paper submission due: September 22, 2022 (Extended) - Notification: September 30, 2022 - Camera-ready: October 14, 2022 PROGRAM COMMITTEE CO-CHAIRS - Sedat Akleylek, Ondokuz Mayis University, Turkey (co-chair) - Santiago Escobar, Polytechnic University of Valencia, Spain (co-chair) - Kazuhiro Ogata, Japan Advanced Institute of Science and Technology, Japan (co-chair) - Ayoub Otmani, University of Rouen Normandie, France (co-chair) PUBLICITY CHAIR - Duong Dinh Tran, Japan Advanced Institute of Science and Technology, Japan (duongtd at jaist.ac.jp) Best regards -------------- next part -------------- An HTML attachment was scrubbed... URL: From dpw at cs.princeton.edu Wed Sep 14 14:04:51 2022 From: dpw at cs.princeton.edu (David Walker) Date: Wed, 14 Sep 2022 14:04:51 -0400 (EDT) Subject: [TYPES/announce] Teaching faculty positions at Princeton CS Message-ID: <1433174499.2414335.1663178691402.JavaMail.zimbra@cs.princeton.edu> I would like to bring to your attention that we at Princeton CS have multiple teaching faculty positions. Please reach out to me or to Mark Braverman [mbraverm at cs.princeton.edu] if you might be interested. I added some information below. Also, please forward this email if you know someone else who might be a good fit for the position. Thanks! David Walker -------------- Job Responsibilities Job responsibilities can include working with a team to teach and manage our large introductory and upper-level courses, advising undergraduate research, contributing to curriculum development, leading outreach programs for under-represented groups, developing EdTech tools, and creating online content. The position features many compelling elements: ? Advancing in career-oriented, teaching-stream faculty ranks: Lecturer, Senior Lecturer, University Lecturer. ? Maintaining a teaching load of only one prep per semester, leaving ample time and opportunity to innovate. ? Engaging with outstanding undergraduate students, undergraduate graders, and graduate TAs. ? Advising undergraduate independent work projects and potentially master?s theses, which can amplify your research agenda. ? Participating in department/university governance. ? Earning competitive compensation and benefits, including funding for professional development and opportunities to receive summer support. Application To apply, please follow the instructions at https://urldefense.com/v3/__https://puwebp.princeton.edu/AcadHire/apply/application.xhtml?listingId=27501__;!!IBzWLUs!UYQoguQkAlzXPK8ANHS06moHfSOE6FmeN8doGIbaEmDH2YW7nT80eB_OW9QXe8csISnlujJteCCJuKBltgXv4kOkKNQTGanM$ Note that applications are being reviewed on a rolling basis From Matteo.Sammartino at rhul.ac.uk Fri Sep 16 05:44:28 2022 From: Matteo.Sammartino at rhul.ac.uk (Sammartino, Matteo) Date: Fri, 16 Sep 2022 09:44:28 +0000 Subject: [TYPES/announce] Postdoc Position on Hardware Verification via Model Learning, Royal Holloway University of London -- Application deadline 15 Oct 2022 Message-ID: - Application deadline: Midnight, 15 Oct 2022 - Salary: ?37,467 - Duration: until November 2023 Applications are invited for the post of Post-Doctoral Research Assistant in the Computer Science Department at Royal Holloway, University of London. The post holder will have an exciting opportunity to work on the EPSRC-funded "Verification of Hardware Concurrency via Model Learning" (CLeVer) project (EP/S028641/1), led by Prof. Alexandra Silva (UCL/Cornell) and Matteo Sammartino (RHUL), in collaboration with ARM, world-leading designer of multi-core chips. For an informal discussion about the post, please contact Dr. Matteo Sammartino on matteo.sammartino at rhul.ac.uk. # Brief description of the project Digital devices are increasingly complex, therefore there is a pressing need to automate the assessment of their correctness. Formal verification provides highly effective techniques to assess the correctness of systems. However, formal models are usually built by humans, and as such can be error-prone and inaccurate. The project aims to develop a novel verification framework for hardware, which combines learning, testing and model-checking. Not all models are suitable for this purpose and hence specific classes of models will need to be developed, depending on the task at hand. Subsequently, learning and verification techniques for these classes need to be devised and tested in realistic case studies. We have an industrial partner, ARM, that will provide valuable guidance on the design and development of the aforementioned tasks. # The ideal candidate We are looking for candidates with a PhD in one of the following areas: model-based testing and verification, model learning, automated analysis of hardware systems. Experience in multiple areas will be valued. Candidates ideally should also have strong programming skills. # Where to apply https://urldefense.com/v3/__https://jobs.royalholloway.ac.uk/0922-411__;!!IBzWLUs!UHRVDKYuGBisANVHYXkRq9B3MgRVK7e_eBNc9OvbewBWtdzXJdp8PWhGd3OtSRBvpXV5hVLVaqRZO0QebeM5Cd07RV69HWCsb5Y_vDKT_18g$ ============================== Matteo Sammartino, Lecturer Royal Holloway University of London Department of Computer Science Tel.: (+44) (0) 1784 44 3690 Office: 2-07, Bedford Building https://urldefense.com/v3/__https://matteosammartino.com/__;!!IBzWLUs!UHRVDKYuGBisANVHYXkRq9B3MgRVK7e_eBNc9OvbewBWtdzXJdp8PWhGd3OtSRBvpXV5hVLVaqRZO0QebeM5Cd07RV69HWCsb5Y_vF-Ta8ou$ 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. -------------- next part -------------- An HTML attachment was scrubbed... URL: From David.Delahaye at lirmm.fr Fri Sep 16 07:02:37 2022 From: David.Delahaye at lirmm.fr (David Delahaye) Date: Fri, 16 Sep 2022 13:02:37 +0200 Subject: [TYPES/announce] Recruitment of a research engineer in automated proof at LIRMM in Montpellier (France) Message-ID: <8bc76f8d-7ad1-f1a9-4fb6-bfa238219416@lirmm.fr> *** Please feel free to circulate this message *** *** Sorry for the multiple receptions *** The LIRMM (UMR 5506, University of Montpellier, CNRS) is recruiting a full-time research engineer for a period of 12 months in the field of automated proof. The desired start date is January 1, 2023, and the position will be located in Montpellier (France). *Assignments:* The purpose of this position is to strengthen the software development capabilities of the MaREL team (specialized in the field of software engineering) of the Computer Science department of LIRMM.The person hired will be involved in the development of Go?land, an automated reasoning tool developed in the team by Julie Cailler (PhD student) for over a year. This tool is based upon a new proof search procedure for first-order logic, which leverages concurrency to produce proofs in the context of the tableaux method. This tool currently gives excellent results (as measured by the number of solved problems) in comparison with similar tools. Notably, it achieves better results in some problem categories than similar (tableaux-based) tools, some of which have been established for years. A conference article on Go?land has been accepted for publication at IJCAR 2022, a rank A conference, demonstrating the interest of the community for the approach used by that tool. Furthermore, Go?land has taken part in the CASC-J11 competition, organized in parallel with IJCAR 2022, and in which the current best automated deduction tools compete on different sets of problems. The tool has been awarded the ?best newcomer? distinction during this competition. The hired person will participate in the development and maintenance of the Go?land software, which is developed using Go, a language suited to concurrent programming. The aim of this position is twofold. The first mission is to get the tool in working for competitions, particularly CASC, a yearly occurrence that serves as a display of our work. The second is to apply the tool in a more industrial setting. A benchmark of problems originating from the modeling of industrial applications with the B method is already available (as a result of the ANR project Bware) but a number of extensions to Go?land are needed before it can be used on this benchmark. In more detail, the assignments of the hired person will include: * Improving tests for proof search with equality. Equality reasoning is implemented but further testing is required for validation. * Integrating polymorphism in the proof search. Proof search with polymorphic types has been developed recently, but this feature has yet to be integrated and also requires tests for validation. * Integrating linear arithmetic reasoning in the proof search. Currently, the simplex method (for problems involving rational numbers) and the branch and cut algorithm (for problems involving integers) have been developed but their integration and testing remain to be done. * Testing the tool on the whole TPTP problems collection. This library of problems is used in particular for the CASC competition. * Testing the tool on the benchmark of industrial problems taken from the ANR project BWare . This test can only be carried out after the integration of polymorphism and linear reasoning in the tool. *Activities:* The hired person will work under the direction of David Delahaye (PR/full professor in the team MaREL), Simon Robillard (MCF/associate professor in the team MaREL), and Julie Cailler (PhD student in the team MaREL, with a thesis on the topic, and the main developer of Go?land). The technical program follows the assignments described in the previous section. The order of assignments is not critical, with the exception of tests on the BWare benchmarks, for which the integration of polymorphism and linear arithmetic reasoning are prerequisites. *Skills:* The candidate must demonstrate the following: * High motivation for exploratory work in coordination with researchers * Familiarity with the notions of proof and proof search * Familiarity with concurrent programming (regardless of the programming language) * Aptitude for collaborative development and version management using Git * Experience with Agile project management * Excellent aptitude to work in collaboration and to engage external users * Fluency in English, both written and oral, for the purpose of scientific communication * Basic knowledge of French, with the intent to learn the language * Autonomy and initiative, aptitude to make technical decisions and justify them in the context of the project * Affinity for open-source software development *Context:* LIRMM (Laboratoire d'Informatique, de Robotique et de Micro?lectronique de Montpellier) is a research department (/unit? mixte de recherche/) headed by CNRS and the University of Montpellier. It hosts 410 employees, including 192 permanent positions. It is organized in three divisions: Computer Science, Robotics and Micro-Electronics, as well as centralized services, among which the Research Support Service (SAR, comprising 16 engineers) that provides technical support for research projects and manages the technology platforms of the department. The hired engineer will join this service and provide support for researchers in the department. The research topics of the Computer Science division cover a large spectrum ranging from the foundations of computer science (algorithms, computation, data science, software engineering, AI) to inter-disciplinary research (environment, health, biology). This division hosts 106 permanent positions (researchers, teacher-researchers and engineers) and 71 PhD students in 15 teams. The hired person will more specifically join the MaREL team. *Contact :* To send your application or simply to have more information about this position, contact the following people: * David Delahaye (_David.Delahaye at lirmm.fr _). * Simon Robillard (_Simon.Robillard at lirmm.fr _). -- 7.5.8 - 27/08/2021 David DELAHAYE Professor Head of the Computer Science Departement Faculty of Sciences LIRMM UMR 5506 Bt. 4 ? CC477 ? 161 rue Ada 34095 Montpellier Cedex 5 ? France Phone: +33 (0)4 67 41 86 01 David.Delahaye at lirmm.fr https://urldefense.com/v3/__http://www.lirmm.fr/*delahaye/__;fg!!IBzWLUs!Sq5R6Eo4VzKVeT7DWPoeMDo_6DNQIYq46XnCx3kkb206N0_VRQbwbIkBNZ2RWQ4Ra_-A_UlPp2P3i_btw3uECf-oLCD0g84A3GqAzj3X$ UNIVERSIT? DE MONTPELLIER D?partement Informatique Bt. 16 ? CC 12 ? Place Eug?ne Bataillon 34095 Montpellier cedex 05 ? France informatique-fds.edu.umontpellier.fr <#> <#> <#> <#> <#> -------------- next part -------------- An HTML attachment was scrubbed... URL: -------------- next part -------------- A non-text attachment was scrubbed... Name: ocokibhefnkhbicp.png Type: image/png Size: 2928 bytes Desc: not available URL: -------------- next part -------------- A non-text attachment was scrubbed... Name: iejffghdiimoijnj.png Type: image/png Size: 85 bytes Desc: not available URL: From jeremy.gibbons at cs.ox.ac.uk Fri Sep 16 09:23:46 2022 From: jeremy.gibbons at cs.ox.ac.uk (Jeremy Gibbons) Date: Fri, 16 Sep 2022 14:23:46 +0100 Subject: [TYPES/announce] Faculty positions at Oxford Message-ID: <8EB0E969-53CA-4E60-B5A2-F6972A60203D@cs.ox.ac.uk> Oxford University?s Computer Science Department is hiring four new faculty. The positions are open to all areas of computer science and the closing date is 12 noon on 14 December 2022. For more information, see https://urldefense.com/v3/__https://www.cs.ox.ac.uk/aboutus/vacancies/vacancy-faculty-hiring.html__;!!IBzWLUs!V57LUu-qnhr5lyXYJTYlgr4x2YxBREjB5cPifFV41hysW9WqOhs5P5NRUhSKKDSrnlbrn3EXWbPdHsh4M-epV2UPsaEAS8AfhuWY1pDvqYA$ Jeremy Jeremy.Gibbons at cs.ox.ac.uk Oxford University Department of Computer Science, Wolfson Building, Parks Road, Oxford OX1 3QD, UK. +44 1865 283521 https://urldefense.com/v3/__http://www.cs.ox.ac.uk/people/jeremy.gibbons/__;!!IBzWLUs!V57LUu-qnhr5lyXYJTYlgr4x2YxBREjB5cPifFV41hysW9WqOhs5P5NRUhSKKDSrnlbrn3EXWbPdHsh4M-epV2UPsaEAS8AfhuWYO_e9VHI$ -------------- next part -------------- An HTML attachment was scrubbed... URL: From Crystal.Din at uib.no Mon Sep 19 11:03:41 2022 From: Crystal.Din at uib.no (Crystal Chang Din) Date: Mon, 19 Sep 2022 15:03:41 +0000 Subject: [TYPES/announce] NWPT 2022 call for contributions Message-ID: The 33rd Nordic Workshop on Programming Theory, NWPT '22 2-4 November 2022, Bergen, Norway https://urldefense.com/v3/__https://nwpt.w.uib.no/__;!!IBzWLUs!S-7wI5jXnWECbp3H6Kgnh30vv1l8NFRdcU-qm6wgzmvpy4tejUmedDjDVR7106TzjFI_dTeqoAkhktmexL-Xq-Aw8jSjo9geKT0$ ---------------------------------------------------------------------- Important dates (AoE) Submission of abstracts: 2 October 2022 23:59 AoE Notification: 17 October 2022 Early bird registration: before 17 October 2022 Regular registration: before 24 October 2022 Final versions: 31 October 2022 Conference dates: 2-4 November 2022 ---------------------------------------------------------------------- NWPT is a series of annual regional-scope workshops on programming theory, targeted especially at younger researchers. In 2022, the workshop will take place in Bergen, Norway. We hope this will be a nice opportunity to present recent results and/or work-in-progress, and to meet colleagues from the Nordic and Baltic countries. We encourage PhD students and postdocs to contribute. Topics of interest include (but are not limited to) - semantics of programming languages, - programming language design and programming methodology, - programming logics, - formal specification of programs, - program verification, - program construction, - tools for program verification and construction, - program transformation and refinement, - real-time and hybrid systems, - models of concurrency and distributed computing, - model-based testing, - language-based security. Contributed talks Authors wishing to give a talk at the workshop are requested to submit abstracts of 2-3 pages (pdf, printable on A4 paper, typeset with LaTeX with easychair.cls) through EasyChair by 02 October: https://urldefense.com/v3/__https://easychair.org/conferences/?conf=nwpt22__;!!IBzWLUs!S-7wI5jXnWECbp3H6Kgnh30vv1l8NFRdcU-qm6wgzmvpy4tejUmedDjDVR7106TzjFI_dTeqoAkhktmexL-Xq-Aw8jSjXHDfnL4$ Work in progress as well as abstracts of manuscripts submitted for formal publication elsewhere are permitted. The abstracts of the accepted contributions will be available electronically before the workshop. By submitting to EasyChair you agree that your abstract will be publicly available. Moreover, you as an author are responsible for the content. Organizers Mikhail Barash, Crystal Chang Din, H?kon Robbestad Gylterud, and Magne Haveraaen Contact the organisers at nwpt_22 at uib.no -------------- next part -------------- An HTML attachment was scrubbed... URL: From leonidas at umd.edu Mon Sep 19 12:48:03 2022 From: leonidas at umd.edu (Leonidas Lampropoulos) Date: Mon, 19 Sep 2022 12:48:03 -0400 Subject: [TYPES/announce] NJPLS on Friday, October 21st, at UMD Message-ID: Hello all! The next iteration of NJPLS will happen at the University of Maryland, College Park, on Friday October 21st. As before, details about the precise timing will follow, but if you're interested in giving a talk, please fill out the following form: https://urldefense.com/v3/__https://forms.gle/9eCvJeXkpjtonWVk6__;!!IBzWLUs!VZWteZ6g2MPo8OwhtOBBfymH8rrObM4Xvhohfr34REkj56P9Gf_-rRGmfZdx3voSmJ_cOVjTGRDpM_jGPEGWTbag1GWr7GD8$ We'll figure out the precise timing of the event soon. If you are interested in giving a talk, please fill out the following form. Please submit talk proposals by Wednesday, September 28th. We hope to finalize the schedule in the beginning of October. This run of NJPLS will also be in-person only, with no accommodations for hybrid or remote participation. If there are, e.g., new variants or university policy changes, we will simply cancel the event. Cheers, Leo -------------- next part -------------- An HTML attachment was scrubbed... URL: From P.Achten at cs.ru.nl Mon Sep 19 14:03:00 2022 From: P.Achten at cs.ru.nl (Peter Achten) Date: Mon, 19 Sep 2022 20:03:00 +0200 Subject: [TYPES/announce] [TFP 2023 Call for Papers] 24th International Symposium on Trends in Functional Programming Message-ID: <6dc2899e-3c21-80fc-3c10-831b1f111d47@cs.ru.nl> # TFP 2023 -- Call for Papers (trendsfp.github.io) ## Important Dates Submission deadline: pre-symposium, full papers,? Wednesday 23rd November, 2022 Submission deadline: pre-symposium, draft papers, Friday 16th December, 2022 Notification:??????? pre-symposium submissions,?? Friday 23rd December, 2022 Registration:???????????????????????????????????? Friday 6th January, 2023 TFPIE Workshop:?????????????????????????????????? Thursday 12th January, 2023 TFP Symposium:??????????????????????????????????? Friday 13th - Sunday 15th January, 2023 Submission deadline: post-symposium review,?????? Friday 17th February, 2023 Notification:??????? post-symposium submissions,? Friday 31st March, 2023 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. This year, TFP will take place in-person at UMass Boston, Massachusetts in the United States.? It is co-located with the Trends in Functional Programming in Education (TFPIE) workshop, which will take on the day before the main symposium. Please be aware that TFP has several submission deadlines. The first, November 23, is for authors that wish to have their full paper reviewed prior to the symposium. Papers that are accepted in this way must also be presented at the symposium. The second, December 16, is for authors that wish to present their work or work-in progress at the symposium first without submitting to the full review process for publication. These authors can then take into account feedback received at the symposium and submit a full article for review by the third deadline, February 17. ## 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 2023 program chair, Stephen Chang. ## Best Paper Awards TFP awards two prizes for the best papers each year. First, to reward excellent contributions, TFP awards a prize for the best overall paper accepted for the post-conference formal proceedings. Second, a prize for the best student paper is awarded each year. 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. In both cases, it is the PC of TFP that awards the prize. In case the best paper happens to be a student paper, then that paper will receive both prizes. ## Instructions to Authors Papers must be submitted at: ? Authors of papers have the choice of having their contributions formally reviewed either before or after the Symposium. Further, pre-symposium submissions may either be full (earlier deadline) or draft papers (later deadline). ## Pre-symposium formal review Papers to be formally reviewed before the symposium should be submitted before the early deadline and will receive their reviews and notification of acceptance for both presentation and publication before the symposium. A paper that has been rejected for publication but accepted for presentation may be resubmitted for the post-symposium formal review. ## Post-symposium formal review Draft papers will receive minimal reviews and notification of acceptance for presentation at the symposium. Authors of draft papers will be invited to submit revised papers based on the feedback receive 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 Peter Achten,????????????? Radboud University Nijmegen, Netherlands Nada Amin,???????????????? Harvard University, USA Ambrose Bonnaire-Sergeant, Untypable LLC, USA Laura M. Castro,?????????? University of A Coru?a, Spain Stephen Chang (Chair),???? University of Massachusetts Boston, US John Clements,???????????? Cal Poly, USA Youyou Cong,?????????????? Tokyo Institute of Technology, Japan Paul Downen,?????????????? University of Massachusetts Lowell, USA Kathy Gray,??????????????? Meta Platforms, Inc., UK Ben Greenman,????????????? University of Utah, USA Jason Hemann,????????????? Seton Hall University, USA Patricia Johann,?????????? Appalachian State University, USA Alexis King,?????????????? Tweag, USA Julia Lawall,????????????? Inria-Paris, France Barak Pearlmutter,???????? Maynooth University, Ireland Norman Ramsey,???????????? Tufts University, USA Ilya Sergey,?????????????? National University of Singapore, Singapore Melinda T?th,????????????? E?tv?s Lor?nd University, Hungary Ningning Xie,????????????? University of Toronto, Canada From miltner at sfu.ca Tue Sep 20 19:13:42 2022 From: miltner at sfu.ca (Anders Miltner) Date: Tue, 20 Sep 2022 23:13:42 +0000 Subject: [TYPES/announce] PLDI 2023 First Call for Papers Message-ID: <62429325-A197-4716-9F4F-14D1185F53D1@sfu.ca> Please distribute widely. *Call for Papers* ==================== 2023 ACM Conference on Programming Language Design and Implementation (PLDI) Mon 19 - Wed 21 June 2023 Orlando, Florida, United States https://urldefense.com/v3/__https://pldi23.sigplan.org/track/pldi-2023-pldi*Call-for-Papers__;Iw!!IBzWLUs!TIq9kL-IM6S_viVUfySFK2lPXrVZM_1ImC4hlSa0zU_CKYq9YQ1hOYEmJRyf1-ILJ4PzUTaLvFk9YpMQk9jAmefL-m1LJw$ PACMPL Issue PLDI 2023 seeks contributions on all aspects of programming languages research, broadly construed, including design, implementation, theory, applications, and performance. Authors of papers published in PACMPL Issue PLDI 2023 will be invited to present their work in the PLDI conference in June 2023, which is sponsored by ACM SIGPLAN. *Important Dates* =============== Thu 10 Nov 2022, Submission Deadline Mon 6 Feb - Wed 8 Feb 2023, Author Response Fri 24 Feb 2023, Author Notification *Author Instructions* ================== https://urldefense.com/v3/__https://pldi23.sigplan.org/track/pldi-2023-pldi*Call-for-Papers__;Iw!!IBzWLUs!TIq9kL-IM6S_viVUfySFK2lPXrVZM_1ImC4hlSa0zU_CKYq9YQ1hOYEmJRyf1-ILJ4PzUTaLvFk9YpMQk9jAmefL-m1LJw$ Submission site: https://urldefense.com/v3/__https://pldi2023.hotcrp.com/__;!!IBzWLUs!TIq9kL-IM6S_viVUfySFK2lPXrVZM_1ImC4hlSa0zU_CKYq9YQ1hOYEmJRyf1-ILJ4PzUTaLvFk9YpMQk9jAmec1Bde3tw$ *Organizing Committee* ==================== - General Chair: Steve Blackburn, Google and Australia National U. - Program Chair: Nate Foster, Cornell U. - Web Co-Chairs: - Dan Barowy, Williams College - Jedidiah McClurg, Colorado State U. - Publicity Co-Chairs: - William J. Bowman, U. of British Columbia - Anders Miltner, Simon Fraser U. - Sponsorship Co-Chairs: - Sasa Misailovic, U. of Illinois at Urbana-Champaign - Deian Stefan, U. of California at San Diego - Workshops Co-Chairs: - Nadia Polikarpova, U. of California at San Diego - Zachary Tatlock, U. of Washington - Student Research Competition Co-Chairs: - Chandrakana Nandi, Certora - Jubi Taneja, Microsoft Research - Artifact Evaluation Co-Chairs: - Manuel Rigger, National U. of Singapore - Xinyu Wang, U. of Michigan - Diversity and Inclusion Co-Chairs: - Madan Musuvathi, Microsoft Research - Fernando Magno Quint?o Pereira, Federal U. of Minas Gerais - Social Events Co-Chairs: - Rachit Nigam, Cornell U. - Alex Renda, Massachusetts Institute of Technology - Video Chair: Guilherme Espada, U. de Lisboa - Volunteers Co-Chairs: - Hanneli Tavante, McGill U. - Michael James, U. of California at San Diego https://urldefense.com/v3/__https://pldi23.sigplan.org/committee/pldi-2023-organizing-committee__;!!IBzWLUs!TIq9kL-IM6S_viVUfySFK2lPXrVZM_1ImC4hlSa0zU_CKYq9YQ1hOYEmJRyf1-ILJ4PzUTaLvFk9YpMQk9jAmedr971wIA$ -- Anders Miltner From kyrozier at iastate.edu Tue Sep 20 20:49:20 2022 From: kyrozier at iastate.edu (Rozier, Kristin-Yvonne [AER E]) Date: Wed, 21 Sep 2022 00:49:20 +0000 Subject: [TYPES/announce] 1st Call for Papers: NASA Formal Methods (NFM) 2023 Message-ID: <1d20c571-da7e-4f37-616d-40a06ca587b6@iastate.edu> ***************************************************** ???? The Fifteenth NASA Formal Methods Symposium https://urldefense.com/v3/__https://conf.researchr.org/home/nfm-2023__;!!IBzWLUs!XOkKka_seEkO6JGA4HkCBe768k-xMTacQbtr9gLmwk--BYM-ajJ5_OxiisjroNJozOTN49VAqScuqWSrurRwUbdaNfWEcOBKEVI$ ?????????????????? 16 - 18 May 2023 University of Houston Clear Lake, Houston, Texas, USA ***************************************************** Theme of the Symposium: ----------------------- The widespread use and increasing complexity of mission-critical and safety-critical systems at NASA and in the aerospace industry require advanced techniques that address these systems' specification, design, verification, validation, and certification requirements. The NASA Formal Methods Symposium (NFM) is an annual forum to foster collaboration between theoreticians and practitioners from NASA, academia, and industry. NFM's goals are to identify challenges and to provide solutions for achieving assurance for such critical systems. New developments and emerging applications like autonomous software for uncrewed deep space human habitats, caretaker robotics, Unmanned Aerial Systems (UAS), UAS Traffic Management (UTM), and the need for system-wide fault detection, diagnosis, and prognostics provide new challenges for system specification, development, and verification approaches. The focus of these symposiums are on formal techniques and other approaches for software assurance, including their theory, current capabilities and limitations, as well as their potential application to aerospace, robotics, and other NASA-relevant safety-critical systems during all stages of the software life-cycle. Topics of Interest: ------------------- We encourage submissions on cross-cutting approaches that bring together formal methods and techniques from other domains such as probabilistic reasoning, machine learning, control theory, robotics, and quantum computing among others. ??? * Formal verification, including theorem proving, model checking, and static analysis ??? * Advances in automated theorem proving including SAT and SMT solving ??? * Use of formal methods in software and system testing ??? * Run-time verification ??? * Techniques and algorithms for scaling formal methods, such as abstraction and symbolic methods, compositional techniques, as well as parallel and/or distributed techniques ??? * Code generation from formally verified models ??? * Safety cases and system safety ??? * Formal approaches to fault tolerance ??? * Theoretical advances and empirical evaluations of formal methods techniques for safety-critical systems, including hybrid and embedded systems ??? * Formal methods in systems engineering and model-based development ??? * Correct-by-design controller synthesis ??? * Formal assurance methods to handle adaptive systems Important Dates: ---------------- Abstract Submission:? 9 Dec 2022 Paper Submission:??? 16 Dec 2022 Paper Notifications: 20 Feb 2023 Camera-ready Papers: 12 Mar 2023 Symposium:??????? 16-18 May 2023 Location & Cost: ---------------- The symposium will take place in the STEM Building at University of Houston Clear Lake, Houston, Texas, USA, 16-18 May 2023. There will be no registration fee for participants. All interested individuals, including non-US citizens, are welcome to attend, to listen to the talks, and to participate in discussions; however, all attendees must register. Submission Details: ------------------- There are two categories of submissions: ?? 1. Regular papers describing fully developed work and complete results (15 pages + references) ?? 2. Two categories of short papers: (6 pages + references) ?? (a) Tool Papers describing novel, publicly-available tools ?? (b) Case Studies detailing complete applications of formal methods to real systems with publicly-available artifacts All papers should be in English and describe original work that has not been published or submitted elsewhere. All submissions will be fully reviewed by members of the Programme Committee. Papers will appear in the Formal Methods subline of Springer's Lecture Notes in Computer Science (LNCS) and must use LNCS style formatting (https://urldefense.com/v3/__https://www.springer.com/gp/computer-science/lncs/conference-proceedings-guidelines__;!!IBzWLUs!XOkKka_seEkO6JGA4HkCBe768k-xMTacQbtr9gLmwk--BYM-ajJ5_OxiisjroNJozOTN49VAqScuqWSrurRwUbdaNfWEAkBEOs4$ ). Papers must be submitted in PDF format at the EasyChair submission site: https://urldefense.com/v3/__https://easychair.org/conferences/?conf=nfm2023__;!!IBzWLUs!XOkKka_seEkO6JGA4HkCBe768k-xMTacQbtr9gLmwk--BYM-ajJ5_OxiisjroNJozOTN49VAqScuqWSrurRwUbdaNfWE4aF5qnY$ Organizers: ----------- Swarat Chaudhuri (UT Austin) Jim Dabney (University of Houston Clear Lake/NASA JSC) Kristin Yvonne Rozier (Iowa State University/NASA JSC) -- ____________________________________________________________ __ /\ \ \_____ / \ ###[==_____> / \ /_/ __ / __ \ \ \_____ | ( ) | ###[==_____> /| /\/\ |\ /_/ / | | | | \ / |=|==|=| \ Kristin Yvonne Rozier, Ph.D. / | | | | \ Black&Veatch Associate Prof, Iowa State Univ / USA | ~||~ |NASA \ |______| ~~ |______| Fall, 2022: at Carnegie Mellon (__||__) Office: GHC 7211 /_\ /_\ !!! !!! laboratory.temporallogic.org From luca.tranchini at gmail.com Wed Sep 21 05:43:22 2022 From: luca.tranchini at gmail.com (Luca Tranchini) Date: Wed, 21 Sep 2022 11:43:22 +0200 Subject: [TYPES/announce] [CfPart / Reminder] Proofs, computation and meaning II (28 September, online) Message-ID: Call For Participation: Online Workshop Series "Proofs, Computation and Meaning" Online events: September 7, *September 28* and December 7, 2022 ******************************************************************************* This online workshop series was originally planned as an in person meeting which was canceled due to the outbreak of the Coronavirus pandemic in early March 2020. The event was planned to bring researchers whose work focuses on the notion of formal proof from either a philosophical, computational or mathematical perspective. With the obvious limitations of an online format, we wish to keep this original motivation, which looks even more timely now that interdisciplinary interactions are made more difficult by the pandemic. The goal is to create an opportunity for members of different communities to interact and exchange their views on proofs, their identity conditions, and the more convenient ways of representing them formally. ******************************************************************************* SCOPE: Around thirty years after the fall of Hilbert's program, the proofs-as-programs paradigm established the view that a proof should not be identified, as in Hilbert's metamathematics, with a string of symbols in some formal system. Rather, proofs should consist in computational or epistemic objects conveying evidence to mathematical propositions. The relationship between formal derivations and proofs should then be analogous to the one between words and their meanings. This view naturally gives rise to questions such as ?which conditions should a formal arrangement of symbols satisfy to represent a proof?? or ?when do two formal derivations represent the same proof?". These questions underlie past and current research in proof theory both in the theoretical computer science community (e.g. categorical logic, domain theory, linear logic) and in the philosophy community (e.g. proof-theoretic semantics). In spite of these common motivations and historical roots, it seems that today proof theorists in philosophy and in computer science are losing sight of each other. This workshop aims at contributing to a renaissance of the interaction between researchers with different backgrounds by establishing a constructive environment for exchanging views, problems and results. ******************************************************************************* ORGANIZATION: The workshop series includes three events, each focusing on one specific aspect of proofs and their representation. To foster interaction and discussion, each event will consist of short talks followed by a 15 minutes slot during which participants can engage in discussion or just take a short break. 1. Infinity and co-inductive proofs [held on September 7, 10 am (CEST)] In Hilbert's program, the role of proof theory was that of assuring a solid finitistic foundations for the use of infinitary concepts in mathematics. By contrast, and somehow paradoxically, the development of the discipline led to the study of proof systems explicitly incorporating infinitary ideas such as impredicativity, co-induction and other constructions. Speakers: - David Binder (T?bingen University) - Laura Crosilla (University of Oslo) - Gilda Ferreira (Universidade Aberta & University of Lisbon) - Hidenori Kurokawa (Kanazawa University) *2. On the syntax of proofs [September 28, 4-7 pm (CEST)*] Both in natural deduction and in sequent calculus, as well as in their associated type systems, the rules of the standard connectives have been generalized in various ways, thereby obtaining proof-theoretic characterizations of various families of connectives or more generally of data type constructors. Although the motivations for such generalizations are apparently very different (ranging from considerations about the inherent duality of the calculi, to the relation between syntax and semantics, to questions arising in the study of proof-search strategies), they often have a lot in common. Speakers: - Matteo Acclavio (INRIA Paris-Saclay) - Bahareh Afshari (University of Gothenburg) - Herman Geuvers (Nijmegen & Eindhoven University) - Iris van der Giessen (Utrecht University) - Gabriel Scherer (INRIA Paris-Saclay) 3. On the nature of proofs [December 7, 4 pm (CET)] The developments of logic, and of proof theory in particular, have lead us to look at proofs primarily through the lens of various formal systems, such as natural deduction, sequent calculus, tableaux, proof nets etc. Yet, is it possible to investigate the nature of proofs, their identity conditions, their relations with computation and with meaning in a direct way, i.e. independently of the choice of a particular formal system? Speakers: - Noam Zeilberger (INRIA Paris-Saclay) - Alberto Naibo (Paris 1 University) - Antonio Piccolomini d'Aragona (Aix-Marseille University) ******************************************************************************* CALL FOR PARTICIPATION: If you wish to attend, please send an e-mail to luca.tranchini at gmail.com or paolo.pistone at uniroma3.it. Participants will receive a link a few days before each event. -------------- next part -------------- An HTML attachment was scrubbed... URL: From theo at irif.fr Thu Sep 22 05:11:57 2022 From: theo at irif.fr (=?UTF-8?Q?Th=C3=A9o_Zimmermann?=) Date: Thu, 22 Sep 2022 11:11:57 +0200 Subject: [TYPES/announce] Summary of results from the Coq Community Survey 2022 Message-ID: Dear TYPES/announce subscribers, The Coq Community Survey 2022 was an online public survey conducted during February 2022, previously announced on this mailing list. The survey working group (WG) is happy to announce that a summary of results from the survey is now available. The main goal of the survey was to get an updated picture of the Coq user community and inform future decisions made by the Coq team and other Coq ecosystem participants. The survey was advertised to Coq users primarily via the Coq Discourse forum, the Coq Zulip chat, Coq-club mailing list, Coq Twitter, and the Coq website, as well as related mailing lists such as this one. On behalf of the survey WG, I would like to thank everyone in the type theory community that participated by responding to the survey. The survey was available in English and Chinese, and had 109 questions, some of which were only visible depending on answers to previous questions. Answering was optional for all survey questions, and most questions allowed free-text answers. The survey received 466 responses, and the WG has now collaboratively produced three posts that summarize these responses. Post 1: Who is using Coq and in what context? ( https://urldefense.com/v3/__https://coq.discourse.group/t/coq-community-survey-2022-results-part-i/1730__;!!IBzWLUs!S0edeJeC_2Oe_NYHa0nZu4zhCu32CkpWG5kLqd3VkuJqGM6y82PA3kJNA6z7if9OJueOdSkB8am3Ws2udjDATsDnRuM$ ) This post examines the demographics of the Coq users who took the survey, and in what context they are using Coq. ?Context? here means users? experience before they started to use Coq, their reasons for using Coq, and their experience with related languages and tools. The demographic responses suggest that the Coq community is tilted toward computer science, not least in educational background and application areas. France and the United States are where half of the respondents are located, but we observed more diversity in the locations of newcomers. Post 2: How people are using Coq ( https://urldefense.com/v3/__https://coq.discourse.group/t/coq-community-survey-2022-results-part-ii/1746__;!!IBzWLUs!S0edeJeC_2Oe_NYHa0nZu4zhCu32CkpWG5kLqd3VkuJqGM6y82PA3kJNA6z7if9OJueOdSkB8am3Ws2udjDAN4xD4HM$ ) This post examines how respondents use Coq on a daily (or weekly or yearly) basis. This includes the Coq version and IDE, and software infrastructure such as operating system and package management. The responses suggest that most Coq users run Linux-based systems and directly use the opam package manager. Emacs (with ProofGeneral) remains the most popular Coq code editor, but is closely followed by CoqIDE and VS Code. Post 3: Usage of Coq features, tools, and libraries ( https://urldefense.com/v3/__https://coq.discourse.group/t/coq-community-survey-2022-results-part-iii/1777__;!!IBzWLUs!S0edeJeC_2Oe_NYHa0nZu4zhCu32CkpWG5kLqd3VkuJqGM6y82PA3kJNA6z7if9OJueOdSkB8am3Ws2udjDAjcfnjao$ ) This post examines responses related to Coq features, Coq-related plugins and tools, and Coq libraries, in particular their respective popularity and criticality. The responses suggest that Coq?s typeclasses are relatively popular (trailing inductive types and modules as a language feature), that the Dune build system is gaining users, and that Mathematical Components is the most popular general library besides Coq?s standard library. In addition, proof automation tools such as CoqHammer and SMTCoq, and modern tactic languages such as Ltac2, currently have few users, but many prospective users. The WG welcomes feedback from the type theory community as replies in each Discourse forum post. In particular, we welcome suggestions for improvements or questions that could be answered with the survey data. Other Discourse forum posts as well as more formal publications may follow to complete the analysis of the results. Th?o Zimmermann, for the Coq Community Survey 2022 working group -------------- next part -------------- An HTML attachment was scrubbed... URL: From tchajed at gmail.com Thu Sep 22 11:58:20 2022 From: tchajed at gmail.com (Tej Chajed) Date: Thu, 22 Sep 2022 08:58:20 -0700 Subject: [TYPES/announce] CoqPL 2023: Call for Presentations Message-ID: =================================================================== CoqPL 2023 9th International Workshop on Coq for Programming Languages -- January 21, 2023, co-located with POPL Boston, Massachusetts, USA CALL FOR PRESENTATIONS https://urldefense.com/v3/__https://popl23.sigplan.org/home/CoqPL-2023__;!!IBzWLUs!V6-nThRLWsw60gamE3zgs1xB3KIDzedzOvTO9PSvyGFk6OSSksINku58xxbPxTeK3mT8t8JUAJ7u0Fk9OOmKR2KdGJi5Qg$ =================================================================== Workshop Overview ----------------- The series of CoqPL workshops provide an opportunity for programming languages researchers and practitioners with an interest in Coq to meet and interact with one another and members from the core Coq development team. At the meeting, we will discuss upcoming new features, see talks and demonstrations of exciting current projects, solicit feedback for potential future changes to Coq itself, and generally work to strengthen the vibrant community around our favorite proof assistant. Topics in scope include: - Formalizations of PL research in Coq - General purpose libraries and tactic language extensions - Domain-specific libraries for programming language formalization and verification - IDEs, profilers, tracers, debuggers, and testing tools - Reports on ongoing proof efforts conducted via (or in the context of) the Coq proof assistant - Experience reports from Coq usage in educational or industrial contexts Workshop Format --------------- The workshop format will be driven by you, members of the community. We will solicit abstracts for talks and proposals for demonstrations and flesh out format details based on responses. We expect the final program to include experiment reports, panel discussions, and invited talks (details TBA). Talks will be selected according to relevance to the workshop, based on the submission of an extended abstract. To foster open discussion of cutting edge research which can later be published in full conference proceedings, we will not publish papers from the workshop. However, presentations may be recorded and the videos may be made publicly available. Submission Details ------------------ Submission page: https://urldefense.com/v3/__https://coqpl23.hotcrp.com/__;!!IBzWLUs!V6-nThRLWsw60gamE3zgs1xB3KIDzedzOvTO9PSvyGFk6OSSksINku58xxbPxTeK3mT8t8JUAJ7u0Fk9OOmKR2LB7ZbTDA$ Important Dates: - Submission: Thursday, October 20, 2022 - Notification: Thursday, November 17, 2022 - Workshop: Saturday, January 21, 2023 Submissions for talks and demonstrations should be described in an extended abstract, between 1 and 2 pages in length (excluding bibliography). We suggest formatting the text using the two-column ACM SIGPLAN latex style (9pt font). Templates are available from the ACM SIGPLAN page: https://urldefense.com/v3/__https://www.sigplan.org/Resources/Author__;!!IBzWLUs!V6-nThRLWsw60gamE3zgs1xB3KIDzedzOvTO9PSvyGFk6OSSksINku58xxbPxTeK3mT8t8JUAJ7u0Fk9OOmKR2JK8XPulA$ . Program Committee ----------------- Co-chairs: - Tej Chajed, VMware Research and University of Wisconsin, USA - Benjamin Pierce, University of Pennsylvania, USA Program Committee: - Danil Annenkov, Aarhus University, Denmark - Qinxiang Cao, Shanghai Jiao Tong University, China - Tej Chajed, VMware Research and University of Wisconsin, USA - Maxime Denes, INRIA, France - Hugo Herbelin, INRIA, France - Benjamin C. Pierce, University of Pennsylvania, USA - Clement Pit-Claudel, EPFL, Switzerland - Talia Ringer, University of Illinois, USA - Christine Rizkallah, University of Melbourne, Australia - Zoe Paraskevopoulou, Northeastern University, USA Covid / Remote Participation Plans ---------------------------------- We will follow the same protocol for virtual / hybrid attendance as POPL 2023 as a whole. From luigi.santocanale at lis-lab.fr Fri Sep 23 10:10:26 2022 From: luigi.santocanale at lis-lab.fr (Luigi Santocanale) Date: Fri, 23 Sep 2022 16:10:26 +0200 Subject: [TYPES/announce] RAMiCS 2023 - Deadline extension Message-ID: <892034d7-77a3-3ff6-5a8d-3efa1b854987@lis-lab.fr> (Apologies for multiple posting) RAMICS DEADLINE EXTENDED ???????????????????? 20th International Conference on ?????????? Relational and Algebraic Methods in Computer Science ?????????????????????????????? RAMiCS 2023 ??????????3 to 6 April 2023, Technologiezentrum Augsburg, Germany https://urldefense.com/v3/__https://ramics20.lis-lab.fr/__;!!IBzWLUs!XYWrstHBZ_uK4HpIMZK-XcVyNhC3scY4uee5vLn3Fa7PN5_7sdAJgDdfWMMFcQY4GO2wipSIBCrsGBBZR4u1Estzk5VKmalhcac9eITI0Lo6$ IMPORTANT DATES: ??? Abstract Submission (extended): October 7, 2022 ??? Paper Submission (extended): October 14, 2022 ??? Author Notification:??? December 16, 2022 ??? Final Version:????????? January 06, 2023 ??? RAMiCS 2023:??????????? April 03-06, 2023 GENERAL INFORMATION: Since 1994, the RAMiCS conference series has been the main venue for research on relation algebras, Kleene algebras and similar algebraic formalisms, and their applications as conceptual and methodological tools in computer science and beyond. RAMiCS 2023 will take place at the Technologiezentrum Augsburg. Depending on the Covid-19 situation, it will take the form of a physical conference, a virtual conference, or a hybrid between the two. TOPICS: We invite submissions in the general fields of algebras relevant to computer science and applications of such algebras. Topics include but are not limited to: * Theory ?? - algebras such as semigroups, residuated lattices, semirings, Kleene algebras, relation algebras and quantales - their connections with program logics and other logics ?? - their use in the theories of automata, concurrency, formal languages, ???? games, networks and programming languages ?? - the development of algebraic, algorithmic, category-theoretic, ???? coalgebraic and proof-theoretic methods for these theories ?? - their formalisation with theorem provers * Applications ?? - tools and techniques for program correctness, specification and ???? verification ?? - quantitative and qualitative models and semantics of computing ???? systems and processes ?? - algorithm design, automated reasoning, network protocol analysis, ???? social choice, optimisation and control ?? - industrial applications INVITED SPEAKERS ??? Alexander Knapp, Augsburg University, Germany ??? John Stell, University of Leeds, UK ??? Valeria Vignudelli, CNRS/ENS Lyon, France SUBMISSION INSTRUCTIONS: Submission is via EasyChair at https://urldefense.com/v3/__https://www.easychair.org/conferences/?conf=ramics2023__;!!IBzWLUs!XYWrstHBZ_uK4HpIMZK-XcVyNhC3scY4uee5vLn3Fa7PN5_7sdAJgDdfWMMFcQY4GO2wipSIBCrsGBBZR4u1Estzk5VKmalhcac9ePtgp2iZ$ All papers will be peer-reviewed by at least three referees. The proceedings will be published in an LNCS volume by Springer, ready at the conference. Submissions must not be published or under review for publication elsewhere. Submissions must be in English using a PDF not exceeding 16 pages in LNCS style. Submissions must provide sufficient information to judge their merits. Additional material may be provided in a clearly marked appendix or by a reference to a manuscript on a web site. Experimental data, software or mathematical components for theorem provers must be available in sufficient detail for referees. Deviation from these requirements may lead to rejection. One author of each accepted paper is expected to present the paper at the conference. Accepted papers must be produced with LaTeX. Formatting instructions and LNCS style files are available at https://urldefense.com/v3/__http://www.springer.de/comp/lncs/authors.html__;!!IBzWLUs!XYWrstHBZ_uK4HpIMZK-XcVyNhC3scY4uee5vLn3Fa7PN5_7sdAJgDdfWMMFcQY4GO2wipSIBCrsGBBZR4u1Estzk5VKmalhcac9eBET7Cvl$ As for earlier RAMiCS conferences, we intend to publish a journal special issue with revised and extended versions of a selection of the best papers. COMMITTEES: ?? Organising Committee ?? -------------------- ?? Conf. & PC Co-Chair: Roland Gl?ck, Deutsches Zentrum f?r Luft- und Raumfahrt, Germany Conf. & PC Co-Chair: Luigi Santocanale, LIS, Aix-Marseille University, France ?? Conf. & PC Co-Chair: Michael Winter, Brock University, Canada ???Programme Committee ?? ------------------- ??? Adriana Balan, University Politechnic of Bucharest, Romania ??? Manuel Bodirsky, Technical University Dresden, Germany ??? Paul Brunet, Paris-East Cr?teil University, France ??? Miguel Couceiro, Loria, Nancy, France ??? Manfred Droste, Leipzig University, Germany ??? Uli Fahrenberg, Epita, France ??? Hitoshi Furusawa, Kagoshima University, Japan ??? Wesley Fussner, University of Bern, Switzerland ??? Silvio Ghilardi, University of Milan, Italy ??? Roland Glueck, German Aerospace Center, Augsburg, Germany ??? Walter Guttmann, University of Canterbury, New Zealand ??? Robin Hirsch, University College London, UK ??? Peter H?fner, Australian National University, Canberra, Australia ??? Marcel Jackson, La Trobe University, Melbourne, Australia ??? Ali Jaoua, Qatar University, Qatar ??? Peter Jipsen, Chapman University, Orange, USA ??? Sebastian Joosten, Dartmouth College, Hanover, USA ??? Barbara K?nig, University of Duisburg/Essen, Germany ??? Wendy MacCaull, St. Francis Xavier University, Antigonish, Canada ??? Roger Maddux, Iowa State University, Ames, USA ??? Nelma Moreira, University of Porto, Portugal ??? Martin Mueller, University of Applied Sciences, Bonn-Rhein-Sieg, Germany ??? Damien Pous, CNRS, ENS Lyon, France ??? Luigi Santocanale, Aix-Marseille University, France ??? Ana Sokolova, University of Salzburg, Austria ??? Sara Ugolini, Artificial Intelligence Research Institute of the CSIC, Spain ??? Michael Winter, Brock University, St. Catharines, Canada ??? Sam van Gool, University Paris, France -------------- next part -------------- An HTML attachment was scrubbed... URL: From kbh at umn.edu Fri Sep 23 12:00:00 2022 From: kbh at umn.edu (Favonia) Date: Fri, 23 Sep 2022 11:00:00 -0500 Subject: [TYPES/announce] PLMW@POPL 2023: Call For Scholarship Applications (DEADLINE: 10/14 AoE) Message-ID: CALL FOR SCHOLARSHIP APPLICATIONS *DEADLINE: 14 October 2022, 23:59 AoE* (Anywhere on Earth) ACM SIGPLAN Programming Languages Mentoring Workshop Location: Boston, Massachusetts, USA Date: Tuesday, January 17, 2023 Web page: https://urldefense.com/v3/__https://popl23.sigplan.org/home/PLMW-POPL-2023__;!!IBzWLUs!SfULz9cuefqyGcx252YVq0ht6NFIui1MeK69FFzFJ6D8Qa5Iw0dVTDwbqR7hjWKRF9GAicgcgBRolXGiwt2Poj_2wQ$ Following the success of the first eleven Programming Languages Mentoring Workshops at POPL 2012-2022, we are pleased to announce the 12th SIGPLAN Programming Languages Mentoring Workshop (PLMW), co-located with POPL 2023 and organized by Hannah Gommerstadt, Michael Greenberg, Kuen-Bang Hou (Favonia), and Robbert Krebbers. The workshop will take place *in person* in Boston. PLMW aims to encourage graduate students and senior undergraduate students to pursue careers in programming language (PL) research. This workshop will bring together world leaders in PL research and teaching from both academia and industry to provide (a) technical sessions on cutting-edge PL research and (b) mentoring sessions on how to prepare for a research career. The workshop will help students imagine how they might contribute to our vibrant and thriving research community. We especially encourage women, members of underrepresented minorities, and people with disabilities to attend PLMW. This workshop is part of the activities surrounding POPL, the Symposium on Principles of Programming Languages, and takes place the day before the main conference. One goal of the workshop is to make the POPL conference more accessible to newcomers. We hope that participants will stay for the whole conference. A number of sponsors (listed below) have generously donated scholarship funds for qualified students to attend PLMW. These scholarships can cover expenses (airfare, hotel, and registration fees) for attendance at both the workshop and the POPL conference itself. The workshop registration is open to all (with or without scholarships). Students with alternative sources of funding are welcome as well. APPLICATION FOR PLMW SCHOLARSHIP The application form can be accessed at the following URL: https://urldefense.com/v3/__https://forms.gle/Ct19QcsKjSLoE38B9__;!!IBzWLUs!SfULz9cuefqyGcx252YVq0ht6NFIui1MeK69FFzFJ6D8Qa5Iw0dVTDwbqR7hjWKRF9GAicgcgBRolXGiwt3B-jR0oA$ The deadline for full consideration of funding is *14 October 2022, 23:59 AoE.* Confirmed sponsors so far: - NSF - ACM SIGPLAN - Jane Street - Galois -------------- next part -------------- An HTML attachment was scrubbed... URL: From jonathan.aldrich at cs.cmu.edu Fri Sep 23 15:22:16 2022 From: jonathan.aldrich at cs.cmu.edu (Jonathan Aldrich) Date: Fri, 23 Sep 2022 15:22:16 -0400 Subject: [TYPES/announce] UPDATED CfP: Eelco Visser Commemorative Symposium In-Reply-To: <172FD611-6DD8-4518-ACE5-DF9EFDBB364E@tudelft.nl> References: <499E2C90-96E2-4837-B1BF-5840ABC192ED@tudelft.nl> <14F82413-3506-4CE6-9677-12F39775FD4B@tudelft.nl> <0da0d8b85dee494194726d01f4e2b584@fernuni-hagen.de> <08bc5a4963ec493e9f8aff7b59a7350d@fernuni-hagen.de> <42DBE8A1-6B4B-4AAF-903A-227222DC7EEA@irisa.fr> <4CB7FF76-D7CF-4556-8CBE-EAE7BADEE6EC@tudelft.nl> <803D792C-F0F9-49C5-9014-957EF81CCAF3@tudelft.nl> <28C79EA8-2251-4888-9659-32817ECBEDEA@tudelft.nl> <960A2E4A-0342-48F5-A497-E5893274F64F@tudelft.nl> <4A4E74AD-1B72-4EDA-9863-007573AA2E7C@tudelft.nl> <172FD611-6DD8-4518-ACE5-DF9EFDBB364E@tudelft.nl> Message-ID: Two updates: - The proceedings of the symposium are to be published as a volume in the Dagstuhl OpenAccess Series in Informatics (OASIcs). - The submission website is at https://urldefense.com/v3/__https://easychair.org/my/conference?conf=evcs2023__;!!IBzWLUs!WIdfeiryDRFhvDvJBXRAcaaUUmJK51ikH8k_CNwSI1CU57yglC_mK21oMk4iQOELc-VhDc0poj4nFTy6vyYMb9c5ieBFPbZVf67b_IXnNdS2$ A reminder that the deadline to declare your intent to submit (optional, but appreciated) is coming up on 30 September 2022! Final deadline to submit is on 28 October. Eelco Visser Commemorative Symposium 5 April 2023, Delft, The Netherlands https://urldefense.com/v3/__https://symposium.eelcovisser.org__;!!IBzWLUs!WIdfeiryDRFhvDvJBXRAcaaUUmJK51ikH8k_CNwSI1CU57yglC_mK21oMk4iQOELc-VhDc0poj4nFTy6vyYMb9c5ieBFPbZVf67b_Inzolv7$ Eelco Visser (1966?2022) was Antoni van Leeuwenhoek Professor of Computer Science and Chair of the Programming Languages Group in the Department of Software Technology at TU Delft. His research career started with studies at the University of Amsterdam and CWI, followed by appointments at Oregon Graduate Institute and Utrecht University. He was highly influential in the software language engineering and programming language design communities. His many scientific contributions about meta-languages and domain-specific languages have been of high importance in both the scientific and industrial communities. He was a founding member of IFIP Working Groups 2.11 (Program Generation) and 2.16 (Programming Language Design). Eelco Visser?s work on the cutting-edge language workbench *Spoofax* started with a ground-breaking publication in 2010, for which he received a *Most Influential Paper* award at OOPSLA 2020. As a strong advocate of tool-supported programming education, he led the development of *WebLab* , a learning management system that is in use for a range of programming languages and courses at TU Delft. He also led the design, implementation and use of conf.researchr.org, a content management system for scientific events used by hundreds of international events since 2014. 2nd Call for Papers A commemorative symposium for Eelco Visser is to be held on the first anniversary of his untimely passing in April 2022. It will bring together colleagues from various communities, with presentations of papers on topics related to his research and his other academic activities. Topics of interest include, but are not limited to: - Language engineering - Program transformation - Language workbenches - Declarative language specification - Name binding and scope graphs - Type soundness and intrinsically-typed interpreters - Language specification testing - Language implementation generation - Domain-specific programming languages - DSLs for software deployment - DSLs for web application development - Tool-supported programming education Important Dates - *Friday 30 September 2022: Declaration of intent to submit* - *Friday 28 October 2022: Paper submission deadline* - *Monday 28 November 2022: Notifications* - *Wednesday 5 April 2023: Symposium* Types of Submissions - *Unpublished research:* These are *extended abstracts* of novel research contributions related to Eelco Visser?s work. Papers may range from 4 to 8 pages in length, and may optionally include up to 2 further pages of bibliography. Papers will be reviewed by selected members of the relevant research communities. Subsequent submission of full papers including the same results to other venues is encouraged. - *On the relationship between Eelco Visser?s work and other frameworks:* These are papers that present some framework and explain its relationship to his work, but *without* novel research contributions. Papers may range from 4 to 8 pages in length, and may optionally include up to 2 further pages of bibliography. Papers will be reviewed by experts on the relevant topics. - *Personal reflections on Eelco Visser?s activities:* These are short papers that recall and reflect upon personal experiences of his contributions in academia or industry. Papers may range from 1 to 4 pages in length, including bibliography. Papers will be lightly reviewed for relevance. Submissions The submission website is on EasyChair . *Declaration of intent to submit* is optional, but helpful for allocation of appropriate reviewers. It is to include a provisional title, the type of submission, and an indication of the topics covered. *Submitted papers *should be formatted using LaTeX according to the author instructions for the Dagstuhl OpenAccess Series in Informatics (OASIcs) , respecting the page limits indicated above. Publication All accepted papers will appear in the *Proceedings of the EVCS*, to be published as a volume in the Dagstuhl OpenAccess Series in Informatics (OASIcs). Authors retain copyright. Presentations All accepted papers are to be presented at the symposium. Presenters may choose between 5, 10, and 15-minute slots (including questions) subject to availability. Remote presentations are possible. O rganising Committee Jonathan Aldrich, Carnegie Mellon University Benoit Combemale, University of Rennes, Inria, and IRISA Paul Klint, CWI and University of Amsterdam Ralf L?mmel, University of Koblenz Peter Mosses (chair), TU Delft and Swansea University Friedrich Steimann, Fernuniversit?t in Hagen Tijs van der Storm, CWI and University of Groningen Eric Van Wyk, University of Minnesota Local Organisation Committeee Arie van Deursen Peter Mosses Roniet Sharabi Sh?mara van der Zwet For all enquiries about the symposium, please use the contact form or email symposium at eelcovisser.org -------------- next part -------------- An HTML attachment was scrubbed... URL: From vmvasconcelos at fc.ul.pt Mon Sep 26 05:43:15 2022 From: vmvasconcelos at fc.ul.pt (Vasco Thudichum Vasconcelos) Date: Mon, 26 Sep 2022 09:43:15 +0000 Subject: [TYPES/announce] Postdoc contract at the University of Lisbon Message-ID: <85858591-BC32-41F9-828C-C42E7A386B13@ciencias.ulisboa.pt> We are looking to fill a postdoc position at the University of Lisbon in one or more of the below topics. Particularly interesting to types is the "Reliable Software Systems" research line, where candidates are expected to work in the area of programming languages and program verification. * Accessibility and Ageing * Cyber?physical Systems * Data and Systems Intelligence * Health and Biomedical Informatics * Reliable Software Systems * Resilient Distributed and Networked Systems The positions are associated with LASIGE (https://urldefense.com/v3/__https://lasige.ciencias.ulisboa.pt__;!!IBzWLUs!RK6EJE1LsZom3NYlgNxn9dPGMooxlzaEqtz12D3a5DwLLp0DyDVi3sM117Pvs_RxbEJc20djsRxn7ZEMPOosAqzxXuX1S034PCjfpnZK$ ), a research unit at the Faculty of Sciences, University of Lisbon. LASIGE was evaluated as excellent in the last nationwide evaluation process. The position is funded by the Foundation for Science and Technology and lasts until December 31str 2023. Applications are open until October 13, 2022. Plase find tge Call for Applications in https://urldefense.com/v3/__https://euraxess.ec.europa.eu/jobs/836534__;!!IBzWLUs!RK6EJE1LsZom3NYlgNxn9dPGMooxlzaEqtz12D3a5DwLLp0DyDVi3sM117Pvs_RxbEJc20djsRxn7ZEMPOosAqzxXuX1S034PBzrL_kE$ . Further information can be obtained from lasige at ciencias.ulisboa.pt, from myself, or from any of the researchers at LASIGE, https://urldefense.com/v3/__https://lasige.ciencias.ulisboa.pt/phd-collaborators__;!!IBzWLUs!RK6EJE1LsZom3NYlgNxn9dPGMooxlzaEqtz12D3a5DwLLp0DyDVi3sM117Pvs_RxbEJc20djsRxn7ZEMPOosAqzxXuX1S034PPU8IBpc$ . Vasco T. Vasconcelos University of Lisbon About the University of Lisbon and the LASIGE research lab The University of Lisbon (ULisboa) is the largest university in Portugal and a leading one within wider Europe. Comprising eighteen faculties, ULisboa offers 400 degree programmes at undergraduate and postgraduate level. Each year it accepts more than 5,000 international students ? around 10% of its total cohort ? who represent 100 different countries. ULisboa leads the main international rankings, is amongst the 200 best universities worldwide according to the 2019 Shanghai Ranking. LASIGE is a research unit at ULisboa evaluated as Excellent by the Portuguese Science Agency (FCT) in 2018, with a perfect score of 15 points. LASIGE closely mentors more than 100 young researchers (at masters, doctoral, and post-doctoral level), continually stimulating excellence in research. LASIGE members teach MSc and PhD level courses in Computer Science and Engineering (CSE) at ULisboa, regularly publish in top venues, and enjoy top-notch bibliometric indices. LASIGE runs a large number of international projects, boasts three spin-offs, and multiple technology transfers. The high-level research conducted at LASIGE, the scientific background and international projection of its group leaders, the academic and industrial network to which it belongs, and the experience in advanced training of its members makes LASIGE the perfect research unit to work as a postdoc. If this was not enough, the city of Lisbon offers history and culture, shopping, restaurants, nearby beaches and a vibrant nightlife. -------------- next part -------------- An HTML attachment was scrubbed... URL: From jsiek at indiana.edu Mon Sep 26 09:06:57 2022 From: jsiek at indiana.edu (Siek, Jeremy) Date: Mon, 26 Sep 2022 13:06:57 +0000 Subject: [TYPES/announce] Faculty positions at Indiana University Message-ID: The Computer Science Department at Indiana University is hiring four faculty this year. Two of the positions are an open search, including programming languages: https://urldefense.com/v3/__https://indiana.peopleadmin.com/postings/14021__;!!IBzWLUs!SJz316YDOlTSoBV8gornu6WncZBaPGJMOwnw1hu5uMQ5l3cXUTUe4e-yef-Yvr5TQIQbqipcOh90d_6gJcXHyu7DYtxiDtk$ One of the positions is in databases: https://urldefense.com/v3/__https://indiana.peopleadmin.com/postings/14117__;!!IBzWLUs!SJz316YDOlTSoBV8gornu6WncZBaPGJMOwnw1hu5uMQ5l3cXUTUe4e-yef-Yvr5TQIQbqipcOh90d_6gJcXHyu7D7A8X0dw$ And the fourth position is in quantum computing: https://urldefense.com/v3/__https://indiana.peopleadmin.com/postings/14116__;!!IBzWLUs!SJz316YDOlTSoBV8gornu6WncZBaPGJMOwnw1hu5uMQ5l3cXUTUe4e-yef-Yvr5TQIQbqipcOh90d_6gJcXHyu7DBmItTvM$ If you have any questions, please do not hesitate to contact me! Best regards, Jeremy jsiek at iu.edu Professor of Computer Science Indiana University Luddy School of Informatics, Computing, and Engineering -------------- next part -------------- An HTML attachment was scrubbed... URL: From famontesi at gmail.com Mon Sep 26 09:12:29 2022 From: famontesi at gmail.com (Fabrizio Montesi) Date: Mon, 26 Sep 2022 15:12:29 +0200 Subject: [TYPES/announce] Postdoc Positions in Programming Languages, Types, Choreographies (Protocols), and Distributed Systems -- University of Southern Denmark -- Deadline: 6 October 2022 Message-ID: The University of Southern Denmark is inviting applications for postdoctoral positions in programming languages, types, choreographies (protocols), and distributed systems. Full announcement: https://urldefense.com/v3/__https://eapls.org/items/4097/__;!!IBzWLUs!Xuf_usEnrdrec7PPlJ4rrniWpzSTyc7_JeH0WVy2xfWVlRnVMccILXe-5S6Bwm7zEmtaXQ_QcsI_xhmTSdL-0MeVw5mb9zKl$ Apply at: https://urldefense.com/v3/__https://www.sdu.dk/en/service/ledige_stillinger/1195426__;!!IBzWLUs!Xuf_usEnrdrec7PPlJ4rrniWpzSTyc7_JeH0WVy2xfWVlRnVMccILXe-5S6Bwm7zEmtaXQ_QcsI_xhmTSdL-0MeVw6V_zo9J$ Expected start: early 2023 **Deadline: 6 October 2022** -------------- next part -------------- An HTML attachment was scrubbed... URL: From hridesh at iastate.edu Mon Sep 26 10:30:10 2022 From: hridesh at iastate.edu (Rajan, Hridesh [COM S]) Date: Mon, 26 Sep 2022 14:30:10 +0000 Subject: [TYPES/announce] Faculty positions at Iowa State University Message-ID: Dear Colleagues, We are hiring for three faculty positions at Iowa State University. One of them includes programming languages as an area. If you have any questions, please do feel free to contact me or search committee chair Prof. Gianfranco Ciardo. We appreciate your referrals as we find they are so often some of our strongest candidates. We will be sure to follow-up. Best wishes, Hridesh Dr. Hridesh Rajan Professor and Department Chair Department of Computer Science Iowa State University https://urldefense.com/v3/__https://www.cs.iastate.edu/hridesh/__;!!IBzWLUs!XGBazoQ-CRk4qCw6YaSlKaAGV2IAr98GwqkmP_7aKp6XMxKBMpDindLjJrKE0ofQ1tX81IvnWjnyLTcqi4Y-kbSw5czzOTEAPQ$ * Multiple Tenure-Track Faculty Positions in Computer Science * The Department of Computer Science in the College of Liberal Arts and Sciences at Iowa State University in Ames, Iowa, seeks outstanding applicants for three tenure-track faculty positions at the rank of Assistant Professor. We are looking for candidates in all areas of Computer Science who complement and expand our current research strengths, including but not limited to, broad areas of software engineering and programming languages, systems and networks including cybersecurity, bioinformatics and computational biology, and theoretical foundations. The successful candidate will be expected to develop and sustain a strong Computer Science research program; develop collaborative and interdisciplinary research; publish in top venues; provide outstanding graduate student supervision; teach undergraduate and graduate Computer Science courses; and enhance ISU through professional and institutional service. We are interested in exceptional candidates who can expand our research profile in new areas. Iowa State University strives to be the university that cultivates a diverse, equitable and inclusive environment where students, faculty and staff flourish. To that end, we welcome candidates from diverse and underrepresented backgrounds to apply. We are dedicated to work-life balance through an array of flexible policies. We are responsive to the needs of dual-career couples. The Department of Computer Science resides in the College of Liberal Arts and Sciences offering B.S., B.A., M.S., and Ph.D. degrees in Computer Science and a brand-new M.S. degree in Artificial Intelligence. The department is proud to be one of the founding departments for the B.S. in Software Engineering, B.S. in Data Science, Data Science Minor and Certificate along with the B.S. and Ph.D. degrees in Bioinformatics and Computational Biology. We are active in interdepartmental graduate programs in Bioinformatics and Computational Biology, Human-Computer Interactions, and Information Assurance. The department participates in many interdisciplinary research collaborations, including partnerships with faculty in bio-sciences, mathematical sciences, and engineering. The Department of Computer Science has 38 faculty professionals, 150 Ph.D. students, 71 M.S. students, and 1530 B.S. students. All admitted Ph.D. students are offered a two-year teaching assistantship from the department, and almost all are supported by research or teaching assistantships after that. We have strong research and educational programs in Artificial Intelligence, Machine Learning and Data Science, Bioinformatics and Computational Biology, Human Computer Interaction, Robotics and Autonomous Systems, Software Engineering and Programming Languages, Systems and Networking, and Theoretical Foundations. Our department has over $16 million in active research grants, including the interdisciplinary activities mentioned, and we contribute to active research and training grants totaling approximately $25 million. All interested, qualified persons can find more information, including required and preferred qualifications and where to apply, at https://urldefense.com/v3/__https://www.cs.iastate.edu/open-positions__;!!IBzWLUs!XGBazoQ-CRk4qCw6YaSlKaAGV2IAr98GwqkmP_7aKp6XMxKBMpDindLjJrKE0ofQ1tX81IvnWjnyLTcqi4Y-kbSw5cx0HAsjjg$ . To ensure full consideration, applications should be received by November 21, 2022, but will be accepted until the position is filled. Iowa State University is an Equal Opportunity/Affirmative Action employer. All qualified applicants will receive consideration for employment without regard to race, color, age, religion, sex, sexual orientation, gender identity, genetic information, national origin, marital status, disability, or protected veteran status and will not be discriminated against. Inquiries can be directed to the Office of Equal Opportunity, 3410 Beardshear Hall, 515 Morrill Road, 515 294-7612, email eooffice at iastate.edu. From kkmicins at syr.edu Fri Sep 30 19:00:40 2022 From: kkmicins at syr.edu (Kristopher K Micinski) Date: Fri, 30 Sep 2022 23:00:40 +0000 Subject: [TYPES/announce] POPL 2023 Call for Tutorials Message-ID: CALL FOR TUTORIALS POPL 2023 50th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages POPL: 18 - 20 January 2023 Affiliated Events: 15-17 and 21 January 2023 Venue: Boston, MA, USA https://urldefense.com/v3/__https://popl23.sigplan.org/__;!!IBzWLUs!TQkdJ49faPfl7vfeYYhD-5CXLxWnuILpKxBP8obqUMjh_l4qOb2j8LQ95NcwcVSLKbLtauiCke662JkIjyogib_vRDHmFLDs$ The 50th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL 2023) will be held in Boston, Massachusetts, United States. POPL provides a forum for the discussion of fundamental principles and important innovations in the design, definition, analysis, transformation, implementation and verification of programming languages, programming systems, and programming abstractions. Tutorials for POPL 2023 are solicited on any topic relevant to the POPL community. We particularly encourage submissions of introductory tutorials that make the research presented at POPL more accessible to the participants. Tutorials will be held on Monday, January 16 and Tuesday, January 17, 2023. The expected length of a tutorial is 3 hours, including questions and discussion (Q&A). POPL is currently planned to be an in-person/hybrid meeting. However, circumstances may force a switch to a virtual meeting. --------------------------------------------------------------------- Submission details * Deadline for submission: 15 October 2022 * Notification of acceptance: 25 October 2022 A tutorial proposal should provide the following information. * Tutorial title * Presenter(s), affiliation(s), and contact information * 1-3 page description (for evaluation). This should include the objectives, topics to be covered, presentation approach, target audience, prerequisite knowledge, and if the tutorial was previously held, the location (i.e. which conference), date, and number of attendees if available. * 1-2 paragraph abstract suitable for tutorial publicity. * 1 paragraph biography suitable for tutorial publicity. Proposal must be submitted in pdf or txt form by email to the associated events chairs William Bowman (wjb at williambowman.com) and Anders Miltner (miltner at cs.sfu.ca). --------------------------------------------------------------------- Further information Any query regarding POPL 2023 tutorial proposals should be addressed to the associated events chairs William Bowman (wjb at williambowman.com) and Anders Miltner (miltner at cs.sfu.ca). From marco.guarnieri at imdea.org Sat Oct 1 13:57:22 2022 From: marco.guarnieri at imdea.org (Marco Guarnieri) Date: Sat, 1 Oct 2022 19:57:22 +0200 Subject: [TYPES/announce] Call for Presentations - 7th Workshop on Principles of Secure Compilation (PriSC - colocated with POPL) Message-ID: ================================================ Call for Presentations: PriSC 2023 @ POPL 2023 ================================================ Secure compilation is an emerging field that puts together advances in security, programming languages, compilers, verification, systems, and hardware architectures in order to devise more secure compilation chains that eliminate many of today?s security vulnerabilities and that allow sound reasoning about security properties in the source language. For a concrete example, all modern languages provide a notion of structured control flow and an invoked procedure is expected to return to the right place. However, today?s compilation chains (compilers, linkers, loaders, runtime systems, hardware) cannot efficiently enforce this abstraction against linked low-level code, which can call and return to arbitrary instructions or smash the stack, blatantly violating the high-level abstraction. Other problems arise because today?s languages fail to specify security policies, such as data confidentiality, and the compilation chains thus fail to enforce them, especially against powerful side-channel attacks. The emerging secure compilation community aims to address such problems by identifying precise security goals and attacker models, designing more secure languages, devising efficient enforcement and mitigation mechanisms, and developing effective verification techniques for secure compilation chains. 7th Workshop on Principles of Secure Compilation (PriSC 2023) ============================================================= The Workshop on Principles of Secure Compilation (PriSC) is an informal 1-day workshop without any proceedings. The goal of this workshop is to identify interesting research directions and open challenges and to bring together researchers interested in working on building secure compilation chains, on developing proof techniques and verification tools, and on designing software or hardware enforcement mechanisms for secure compilation. The 7th edition of PriSC will be held on January 21 in Boston, Massachusetts, United State together with the ACM SIGPLAN Symposium on Principles of Programming Languages (POPL), 2023. Important Dates =============== * Thu 27 Oct 2022: Submission Deadline * Thu 24 Nov 2022: Acceptance Notification * Sat 21 Jan 2023: Workshop Presentation Proposals and Attending the Workshop ================================================= Anyone interested in presenting at the workshop should submit an extended abstract (up to 2 pages, details below) covering past, ongoing, or future work. Any topic that could be of interest to secure compilation is in scope. Secure compilation should be interpreted very broadly to include any work in security, programming languages, architecture, systems or their combination that can be leveraged to preserve security properties of programs when they are compiled or to eliminate low-level vulnerabilities. Presentations that provide a useful outside view or challenge the community are also welcome. This includes presentations on new attack vectors such as microarchitectural side-channels, whose defenses could benefit from compiler techniques. Specific topics of interest include but are not limited to: * Attacker models for secure compiler chains. * Secure compiler properties: fully abstract compilation and similar properties, memory safety, control-flow integrity, preservation of safety, information flow and other (hyper-)properties against adversarial contexts, secure multi-language interoperability. * Secure interaction between different programming languages: foreign function interfaces, gradual types, securely combining different memory management strategies. * Enforcement mechanisms and low-level security primitives: static checking, program verification, typed assembly languages, reference monitoring, program rewriting, software-based isolation/hiding techniques (SFI, crypto-based, randomization-based, OS/hypervisor-based), security-oriented architectural features such as Intel?s SGX, MPX and MPK, capability machines, side-channel defenses, object capabilities. * Experimental evaluation and applications of secure compilers. * Proof methods relevant to compilation: (bi)simulation, logical relations, game semantics, trace semantics, multi-language semantics, embedded interpreters. * Formal verification of secure compilation chains (protection mechanisms, compilers, linkers, loaders), machine-checked proofs, translation validation, property-based testing. Guidelines for Submitting Extended Abstracts ============================================ Extended abstracts should be submitted in PDF format and not exceed 2 pages (references not included). They should be formatted in two-column layout, 10pt font, and be printable on A4 and US Letter sized paper. We recommend using the new acmart LaTeX style in sigplan mode. Submissions are not anonymous and should provide sufficient detail to be assessed by the program committee. Presentation at the workshop does not preclude publication elsewhere. Contact and More Information ============================ You can find more information on the workshop website: https://urldefense.com/v3/__https://popl23.sigplan.org/home/prisc-2023__;!!IBzWLUs!VbcAUl1Ek3khubX0p8sMRXgUDC0-glXQDU_ImVFmvBftcnhV2lF09bxFhhr6CN5ZLB6pDs1HX2mE0bYS0o0J_Vc89jRq_uoCoQ9f1Fti$ Submission website: https://urldefense.com/v3/__https://prisc2023.hotcrp.com/__;!!IBzWLUs!VbcAUl1Ek3khubX0p8sMRXgUDC0-glXQDU_ImVFmvBftcnhV2lF09bxFhhr6CN5ZLB6pDs1HX2mE0bYS0o0J_Vc89jRq_uoCoYwUaFiO$ For questions please contact the workshop chairs, Marco Guarnieri (marco.guarnieri at imdea.org) and Shweta Shinde (shweta.shivajishinde at inf.ethz.ch). From nicolai.kraus at gmail.com Sun Oct 2 07:11:14 2022 From: nicolai.kraus at gmail.com (Nicolai Kraus) Date: Sun, 2 Oct 2022 12:11:14 +0100 Subject: [TYPES/announce] Call for Participation (online/in-person): type theory workshop, Nottingham, 12 Oct Message-ID: Dear all, on Wednesday, 12 October 2022, we will hold a workshop in honour of Thorsten Altenkirch's 60th birthday: https://urldefense.com/v3/__http://www.cs.nott.ac.uk/*psznk/events/thorsten60/__;fg!!IBzWLUs!XaCm6duELdY95K6G69k40IaAKydYQedNSDhfawOFDSPFHqIG8cdN4i8qCpVSU4Vgx-a9F_3dM2ivhgcMBV0g0qtBO7j4iW-jUGm9jQ$ If you would like to participate (online or in person), please fill out the Google form at https://urldefense.com/v3/__https://docs.google.com/forms/d/e/1FAIpQLSf99-Tw-FnWWTRwaR22Qn63nMurg6oUAKH8nk9ahx2y6N_KXw/viewform?usp=sf_link__;!!IBzWLUs!XaCm6duELdY95K6G69k40IaAKydYQedNSDhfawOFDSPFHqIG8cdN4i8qCpVSU4Vgx-a9F_3dM2ivhgcMBV0g0qtBO7j4iW_t6Y_gXg$ Zoom details for online participants will be sent out closer to the event. Best wishes, Nicolai Kraus, Conor McBride, Tarmo Uustalu -------------- next part -------------- An HTML attachment was scrubbed... URL: From ecb10 at st-andrews.ac.uk Mon Oct 3 19:24:16 2022 From: ecb10 at st-andrews.ac.uk (Edwin Brady) Date: Mon, 3 Oct 2022 23:24:16 +0000 Subject: [TYPES/announce] CFP for PEPM 2023 (Partial Evaluation and Program Manipulation) Message-ID: (Apologies for any duplicate copies) -- CALL FOR PAPERS -- ACM SIGPLAN Workshop on PARTIAL EVALUATION AND PROGRAM MANIPULATION (PEPM) 2022 =============================================================================== * Website : https://urldefense.com/v3/__https://popl23.sigplan.org/home/pepm-2023__;!!IBzWLUs!WSBLdmLOpRoCXHXVOIzA1aJ4tBMB4JzixFMUfoOZ1x_6H5J2Qq8VM04LJlZPjSiScBPD4I0HpwtMUHMVuzVqgRU5szEZ0xnNcdU$ * Time : 16th--17th January 2023 * Place : Boston, Massachusetts, United States (co-located with POPL 2023) The ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation (PEPM) has a history going back to 1991 and has been co-located with POPL every year since 2006. It originated with the discoveries of useful automated techniques for evaluating programs with only partial input. Over the years, the scope of PEPM has expanded to include a variety of research areas centred around the theme of semantics-based program manipulation ? the systematic exploitation of treating programs not only as subjects to black-box execution but also as data structures that can be generated, analysed, and transformed while establishing or maintaining important semantic properties. Scope ----- In addition to the traditional PEPM topics (see below), PEPM 2023 welcomes submissions in new domains, in particular: * Semantics based and machine-learning based program synthesis and program optimisation. * Modelling, analysis, and transformation techniques for distributed and concurrent protocols and programs, such as session types, linear types, and contract specifications. More generally, topics of interest for PEPM 2023 include, but are not limited to: * Program and model manipulation techniques such as: supercompilation, partial evaluation, fusion, on-the-fly program adaptation, active libraries, program inversion, slicing, symbolic execution, refactoring, decompilation, and obfuscation. * Techniques that treat programs/models as data objects including metaprogramming, generative programming, embedded domain-specific languages, program synthesis by sketching and inductive programming, staged computation, and model-driven program generation and transformation. * Program analysis techniques that are used to drive program/model manipulation such as: abstract interpretation, termination checking, binding-time analysis, constraint solving, type systems, automated testing and test case generation. * Application of the above techniques including case studies of program manipulation in real-world (industrial, open-source) projects and software development processes, descriptions of robust tools capable of effectively handling realistic applications, benchmarking. Examples of application domains include legacy program understanding and transformation, DSL implementations, visual languages and end-user programming, scientific computing, middleware frameworks and infrastructure needed for distributed and web-based applications, embedded and resource-limited computation, and security. This list of categories is not exhaustive, and we encourage submissions describing new theories and applications related to semantics-based program manipulation in general. If you have a question as to whether a potential submission is within the scope of the workshop, please contact the programme co-chairs, Edwin Brady (ecb10 at st-andrews.ac.uk) and Jens Palsberg (palsberg at ucla.edu). Submission categories and guidelines ------------------------------------ Two kinds of submissions will be accepted: * Regular Research Papers should describe new results, and will be judged on originality, correctness, significance, and clarity. Regular research papers must not exceed 12 pages. * Short Papers may include tool demonstrations and presentations of exciting if not fully polished research, and of interesting academic, industrial, and open-source applications that are new or unfamiliar. Short papers must not exceed 6 pages. References and appendices are not included in page limits. Appendices may not be read by reviewers. Both kinds of submissions should be typeset using the two-column ?sigplan? sub-format of the new ?acmart? format available at: https://urldefense.com/v3/__http://sigplan.org/Resources/Author/__;!!IBzWLUs!WSBLdmLOpRoCXHXVOIzA1aJ4tBMB4JzixFMUfoOZ1x_6H5J2Qq8VM04LJlZPjSiScBPD4I0HpwtMUHMVuzVqgRU5szEZDnDN8x8$ and submitted electronically via HotCRP: https://urldefense.com/v3/__https://pepm23.hotcrp.com/__;!!IBzWLUs!WSBLdmLOpRoCXHXVOIzA1aJ4tBMB4JzixFMUfoOZ1x_6H5J2Qq8VM04LJlZPjSiScBPD4I0HpwtMUHMVuzVqgRU5szEZC1c8n5w$ Reviewing will be single-blind. Submissions are welcome from PC members (except the two co-chairs). Accepted regular research papers will appear in formal proceedings published by ACM, and be included in the ACM Digital Library. Accepted short papers do not constitute formal publications and will not appear in the proceedings. At least one author of each accepted contribution must attend the workshop (physically or virtually) and present the work. In the case of tool demonstration papers, a live demonstration of the described tool is expected. Important dates --------------- * Paper submission deadline : **Thursday 13th October 2022 (AoE)** * Author notification : **Thursday 10th November 2022 (AoE)** * Workshop : **Monday 16th January 2023 to Tuesday 17th January 2023** Best paper award ---------------- PEPM 2023 continues the tradition of a Best Paper award. The winner will be announced at the workshop. Programme committee ------------------- * Chairs: Edwin Brady (University of St Andrews, UK) Jens Palsberg (University of California Los Angeles, USA) * Nada Amin Harvard (USA) * Adam Barwell (Imperial College London, UK) * Nicolas Biri (Input Output Global) * David Castro-Perez (University of Kent at Canterbury, UK) * Cristina David (University of Bristol, UK) * Atsushi Igarashi (Kyoto University, Japan) * Yukiyoshi Kameyama (University of Tsukuba, Japan) * Geoffrey Mainland (Drexel University, USA) * Hila Peleg (Technion Israel Institute of Technology, Israel) * Casper Bach Poulsen (Delft University of Technology, Netherlands) * Sukyoung Ryu (KAIST, Korea) * Sven-Bodo Scholz (Radboud University Nijmegen, Netherlands) * Ilya Sergey (National University of Singapore, Singapore) * Satnam Singh (Groq Inc, USA) * Elena Zucca (University of Genova, Italy) -------------- next part -------------- An HTML attachment was scrubbed... URL: From matteo.maffei at tuwien.ac.at Tue Oct 4 05:28:51 2022 From: matteo.maffei at tuwien.ac.at (Maffei, Matteo) Date: Tue, 4 Oct 2022 09:28:51 +0000 Subject: [TYPES/announce] Postdoc position (6 years) at the Security and Privacy group, TU Wien Message-ID: <3EE20809-EFEC-4809-96C6-2779BC6E6CD3@tuwien.ac.at> TU Wien is Austria's largest institution of research and higher education in the fields of technology and natural sciences. With over 26,000 students and more than 4000 scientists, research, teaching and learning dedicated to the advancement of science and technology have been conducted here for more than 200 years, guided by the motto "Technology for People". As a driver of innovation, TU Wien fosters close collaboration with business and industry and contributes to the prosperity of society. The Institute of Logic and Computation, research unit Security and Privacy, at TU Wien offers a position as a university assistant (post-doc) limited to 6 years for 40 hours/week. Expected start: November 2022 Tasks: * Deep interest in scientific problems and the motivation for independent and goal-oriented research * Independent teaching or participation in teaching and supervision of students * Ability to develop methods, concepts, as well as their realization and evaluation and the willingness to contribute in interdisciplinary scientific projects * Participation in organizational and administrative tasks of the research division and the faculty Your profile: * Completion of an appropriate doctorate and in-depth knowledge of the subject area * An outstanding publication record in top security and privacy conferences * Research background in one of the following topics: formal methods for security and privacy, blockchain technologies, intersection between machine learning and security or privacy, or web security * Experience in teaching and publication activities as well as interest and pleasure in research and working with students * Organisational and analytical skills as well as a structured way of working * Excellent skills in English communication and writing, knowledge of German (level B2) or willingness to learn it in the first year. We offer: * Continuing personal and professional education and flexible working hours * Central location of workplace with very good accessibility (U1/U4 Karlsplatz) * A creative environment in one of the most liveable cities in the world * A highly competitive salary (B1 scale, 56.861,70 EUR per year before tax) * Additional benefits for employees can be found at the following link: Fringe-Benefit Catalogue of TU Wien * An international and interdisciplinary research environment: the Security and Privacy research unit (https://urldefense.com/v3/__https://secpriv.wien__;!!IBzWLUs!SvPQr1OZoU1RRA3LigsMVUxZ3xa47mAchnIsQUUXE82u81Rnw2OhRHTU4A4iQfsN-BQy_oXOOKB4whJ0vLwRH46awM5KXiTlVk_a9PE8RYE$ ) works on various aspects of security and privacy (e.g., system security, web security, mobile security, IoT security, formal methods, machine learning, cryptography, and blockchain), researchers come from all over the world and frequently interact with each other on interdisciplinary research projects, the working language in the research unit is English. TU Wien is committed to increasing the proportion of women in particular in leadership positions. Female applicants are explicitly encouraged to apply. Preference will be given to women when equally qualified, unless reasons specific to a male applicant tilt the balance in his favour. People with special needs are equally encouraged to apply. In case of any questions, please contact the confidant for disabled persons at the university, Mr. Gerhard Neust?tter. Entry level salary is determined by the pay grade B1 of the Austrian collective agreement for university staff. This is a minimum of currently EUR 4,061.50/month gross, 14 times/year for 40 hours/week. Relevant working experiences may increase the monthly income. We look forward to receiving your application until 10.11.2022. Applications are only processed online: https://urldefense.com/v3/__https://jobs.tuwien.ac.at/Job/194015__;!!IBzWLUs!SvPQr1OZoU1RRA3LigsMVUxZ3xa47mAchnIsQUUXE82u81Rnw2OhRHTU4A4iQfsN-BQy_oXOOKB4whJ0vLwRH46awM5KXiTlVk_adw27RcA$ For formal inquiries, please contact Univ.-Prof. Dr. Matteo Maffei. -------------- next part -------------- An HTML attachment was scrubbed... URL: From m.stannett at sheffield.ac.uk Tue Oct 4 07:29:37 2022 From: m.stannett at sheffield.ac.uk (Mike Stannett) Date: Tue, 4 Oct 2022 12:29:37 +0100 Subject: [TYPES/announce] Faculty position in Verification at Sheffield University Message-ID: The Computer Science Department at Sheffield University is currently looking to hire a Lecturer in Verification. The deadline is October 14th. See: https://urldefense.com/v3/__https://www.jobs.ac.uk/job/CTU424/lecturer-in-verification__;!!IBzWLUs!XnnAwiU24Q94Qk0XanmPSsWWw2IOEtwRcskVcRCAOmPqX-aSZbaXY5czG-4fmYokbb0fiJZFFJgdHYNifT-maitzW4lepUhHJvbzXiRgZg$ We are seeking candidates with an outstanding record of scholarship in the logical and mathematical foundations of computing, including hardware and software verification. You will work within the Verification Group, a well-established research group in the Department of Computer Science which currently hosts six members of staff and one Research Assistant. Current research of the group ranges from the mathematical and logical foundations of computing to practical verification methods and tools to support these. Particular strengths of the group include the semantic, algebraic and categorical foundations of concurrent and distributed systems, computational logics, finite model theory and descriptive complexity, formal methods for hardware and software systems, verification of quantitative systems, verification of hybrid and cyber physical systems, verification of multi-core programs and weak memory models, as well as interactive and automated theorem proving. To expand and complement these strengths we encourage applications in any of the fields mentioned above, and beyond that broadly on foundational aspects of computer science. Sheffield provides a great environment for computer science research. In the recent UK Research Excellence Framework (REF 2021), 99% of our research was rated in the highest two categories (4* and 3*), meaning that it is classed as world-leading or internationally excellent. Half of our research outputs were judged to be world-leading. We were rated as 8th in the UK (out of 90 institutions) for the quality of our research environment, and 70% of our impact was judged to be outstanding. *Dr Mike Stannett, **Department of Computer Science, **The University of Sheffield.* -------------- next part -------------- An HTML attachment was scrubbed... URL: From dbz5017 at psu.edu Tue Oct 4 11:03:34 2022 From: dbz5017 at psu.edu (Zhang, Danfeng) Date: Tue, 4 Oct 2022 15:03:34 +0000 Subject: [TYPES/announce] SRC@POPL 2023: Call For Submissions (DEADLINE: 11/11 AoE) Message-ID: -------------------------------------------------------------------------- SRC at POPL 2023 Call for Submissions ACM Student Research Competition https://urldefense.com/v3/__https://popl23.sigplan.org/track/POPL-2023-student-research-competition__;!!IBzWLUs!TB9zCrZhaVJPnl1805ktzziMdWnNyHG1lyWcx2RKgxnYE5AA5JxGZb8HNbxIUsqfydnPnVrb43ktS8G3p9xPQKRwHgWjWfk$ Location: Boston, Massachusetts, USA SRC Posters: Jan 15, 2023 (tentative) SRC Presentation: Jan 17, 2023 (tentative) -------------------------------------------------------------------------- Important Dates Abstract Submission: Fri 11 Nov 2022 Notification of (Conditional) Acceptance: Fri 2 Dec 2022 Re-Submission for Conditionally Accepted Abstracts: Wed 7 Dec 2022 Notification of Final Acceptance: Fri 9 Dec 2022 -------------------------------------------------------------------------- Overview POPL 2023 will host an ACM Student Research Competition, where undergraduate and graduate students can present their original research before a panel of judges and conference attendees. This year?s competition will consist of three rounds: ? Round 1, Extended abstract: All students are encouraged to submit an extended abstract outlining their research. The submission should be up to three pages using ?\documentclass[acmsmall,nonacm]{acmart}?. ? Round 2, Poster at POPL: Based on the abstracts, a panel of judges will select the most promising entrants to participate in a poster session at POPL. In the poster session, students will be able to interact with POPL attendees and judges. After the poster session, three finalists in each category (graduate/undergraduate) will be selected to advance to the next round. ? Round 3, Oral presentation at POPL: The last round will consist of a short oral live presentation at POPL to compete for the final awards in each category. This round will also select an overall winner who will advance to the ACM SRC Grand Finals. -------------------------------------------------------------------------- Call for Submission POPL 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. Please submit your extended abstracts through HotCRP: https://urldefense.com/v3/__https://popl23src.hotcrp.com__;!!IBzWLUs!TB9zCrZhaVJPnl1805ktzziMdWnNyHG1lyWcx2RKgxnYE5AA5JxGZb8HNbxIUsqfydnPnVrb43ktS8G3p9xPQKRwVmejl5A$ Submissions must be original research that is not already published at POPL 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 should be up to three pages using ?\documentclass[acmsmall,nonacm]{acmart}?. Reference lists do not count towards the three-page limit. You may write appendices after the three-page limit, but please be noted that the committee is not required to read them. This year, we will have two review cycles. For each submission, one of the following decisions will be made: ? Accept: abstracts that proceed to the next round unconditionally. ? Conditional Accept: abstracts that receive revision suggestions from the PC members. Authors will have 5 days to revise the abstract accordingly and then resubmit. The revised abstracts will then be re-evaluated, and either accepted or rejected. ? Reject: abstracts that will not proceed to the next round. -------------------------------------------------------------------------- Program Committee Jeehoon Kang, KAIST Danfeng Zhang, Pennsylvania State University Youyou Cong, Tokyo Institute of Technology Zeyu Ding, Binghamton University, USA Andrew K. Hirsch, MPI-SWS Yoonseung Kim, Yale University Abhinav Verma, Pennsylvania State University Yuepeng Wang, Simon Fraser University From gc at irif.fr Tue Oct 4 11:31:13 2022 From: gc at irif.fr (Giuseppe Castagna) Date: Tue, 4 Oct 2022 17:31:13 +0200 Subject: [TYPES/announce] Post-doc in Programming Languages at IRIF (Paris) Message-ID: <73803f71-f555-10a5-dddc-5f5498de752e@irif.fr> The Research Institute on the Foundations of Computer Science (IRIF ) in Paris is collaborating with Dashbit and Jos? Valim, the author of the Elixir language , to define and implement a type system for the language. A 14-month post-doc position is available at IRIF to work on the type system. Full announcement: Elixir Post-doc Contact: Giuseppe.Castagna at irif.fr, Jose.Valim at dashbit.co Expected start: end 2022, early 2023 [see also: IRIF post-doc available positions page ] -------------- next part -------------- An HTML attachment was scrubbed... URL: From Crystal.Din at uib.no Wed Oct 5 04:35:21 2022 From: Crystal.Din at uib.no (Crystal Chang Din) Date: Wed, 5 Oct 2022 08:35:21 +0000 Subject: [TYPES/announce] [Deadline Extension] The 33rd Nordic Workshop on Programming Theory, NWPT '22 Message-ID: The 33rd Nordic Workshop on Programming Theory, NWPT '22 2-4 November 2022, Bergen, Norway https://urldefense.com/v3/__https://nwpt.w.uib.no/__;!!IBzWLUs!Q_sKy6_znmQAQkD_dF9EtE2k9MMyw5YPFHf7GPfQ1XBd5PohyKNUIdWIF5mRgrVo-Cwav9XopExDPBD9cc7IaQWRcKj1ekbAlS8$ ---------------------------------------------------------------------- Important dates (AoE) Submission of abstracts: 2 October 2022 23:59 AoE 9 October 2022 23:59 AoE Notification: 17 October 2022 Early bird registration: before 17 October 2022 Regular registration: before 24 October 2022 Final versions: 31 October 2022 Conference dates: 2-4 November 2022 ---------------------------------------------------------------------- NWPT is a series of annual regional-scope workshops on programming theory, targeted especially at younger researchers. In 2022, the workshop will take place in Bergen, Norway. We hope this will be a nice opportunity to present recent results and/or work-in-progress, and to meet colleagues from the Nordic and Baltic countries. We encourage PhD students and postdocs to contribute. Topics of interest include (but are not limited to) - semantics of programming languages, - programming language design and programming methodology, - programming logics, - formal specification of programs, - program verification, - program construction, - tools for program verification and construction, - program transformation and refinement, - real-time and hybrid systems, - models of concurrency and distributed computing, - model-based testing, - language-based security. Contributed talks Authors wishing to give a talk at the workshop are requested to submit abstracts of 2-3 pages (pdf, printable on A4 paper, typeset with LaTeX with easychair.cls) through EasyChair by 02 October: https://urldefense.com/v3/__https://easychair.org/conferences/?conf=nwpt22__;!!IBzWLUs!Q_sKy6_znmQAQkD_dF9EtE2k9MMyw5YPFHf7GPfQ1XBd5PohyKNUIdWIF5mRgrVo-Cwav9XopExDPBD9cc7IaQWRcKj1YKYOEcU$ Work in progress as well as abstracts of manuscripts submitted for formal publication elsewhere are permitted. The abstracts of the accepted contributions will be available electronically before the workshop. By submitting to EasyChair you agree that your abstract will be publicly available. Moreover, you as an author are responsible for the content. Organizers Mikhail Barash, Crystal Chang Din, H?kon Robbestad Gylterud, and Magne Haveraaen Contact the organisers at nwpt_22 at uib.no -------------- next part -------------- An HTML attachment was scrubbed... URL: From matteo.maffei at tuwien.ac.at Wed Oct 5 05:41:09 2022 From: matteo.maffei at tuwien.ac.at (Maffei, Matteo) Date: Wed, 5 Oct 2022 09:41:09 +0000 Subject: [TYPES/announce] 14 PhD positions in Austria within the SPyCoDe Special Research Program Message-ID: <4FB82B9D-4DA4-4E95-8CC4-4A21F3405144@tuwien.ac.at> 14 PhD positions are available in Austria within the SPyCoDe Special Research Program (https://urldefense.com/v3/__https://spycode.at__;!!IBzWLUs!RRd1HyXBNOqURsKUDGxNF6bqhucZWXxMDBCpR0XJpj0OT1z6vsrIWWXovf4ER8EtFAxAaCmxE9KU0tiK1EaUHkYPhAB1UKuNuu4tfhrxegU$ ). SPyCoDe (Semantic and Cryptographic Foundations of Security and Privacy by Compositional Design) is a special research program funded by FWF. The collaborating research institutions are * TU Wien * IST Austria * Universit?t Wien * TU Graz * Universit?t Klagenfurt The security and privacy (S&P) by design principle states that data protection should be considered since the early design of digital technologies, making S&P a cornerstone in digitalization. SPyCoDe aims at creating the technological foundations for designing complex, multi-layer systems with provable S&P guarantees. This goal is highly interdisciplinary, integrating computer-aided verification, system security, and cryptography, and touching on further fields, like networks, game theory, and blockchains. The cornerstone of our approach is the specification and enforcement of S&P at the level of the interfaces between layers in order to establish end-to-end S&P guarantees in a compositional way. SPyCoDe combines scientific excellence and interdisciplinarity. The team members are world-class researchers, whose prior work in the field led not only to groundbreaking theoretical contributions but also to immediate, large-scale industrial adoption. A unique feature of SPyCoDe is the combination of world-class basic research in a timely topic with immediate, large-scale industrial impact. Entry level salary as a predoctoral researcher is covered by level B1 of the Austrian Collective Agreement for university staff, and receives a minimum of currently EUR 2.196,75/month gross, 14 times/year for 30 hours/week and EUR 2.929,00/month for 40 hours/week (about EUR 28.675/year net). Relevant working experiences may increase the monthly income. The application for SPyCoDe is open until November 1st, 2022. The expected start is January 1st, 2023. For further details, please look at https://urldefense.com/v3/__https://spycode.at__;!!IBzWLUs!RRd1HyXBNOqURsKUDGxNF6bqhucZWXxMDBCpR0XJpj0OT1z6vsrIWWXovf4ER8EtFAxAaCmxE9KU0tiK1EaUHkYPhAB1UKuNuu4tfhrxegU$ . Applications are exclusivity to be conducted online at https://urldefense.com/v3/__https://tools.spycode.at/recruiting/call/1__;!!IBzWLUs!RRd1HyXBNOqURsKUDGxNF6bqhucZWXxMDBCpR0XJpj0OT1z6vsrIWWXovf4ER8EtFAxAaCmxE9KU0tiK1EaUHkYPhAB1UKuNuu4tPciOBRQ$ . In case of any questions, please contact Olha Denisova at recruiting-questions at spycode.at . -------------- next part -------------- An HTML attachment was scrubbed... URL: From bove at chalmers.se Wed Oct 5 08:34:45 2022 From: bove at chalmers.se (Ana Bove) Date: Wed, 5 Oct 2022 14:34:45 +0200 Subject: [TYPES/announce] Two postdocs in Type theory for mathematics and computer science Message-ID: Dear All The logic and types group at Chalmers and Gothenburg university is now recruiting two postdocs to work on type theory for mathematics and computers science together with Prof. Thierry Coquand and others in the group. The project is about the study of dependent type theory extended with univalence and higher inductive types. It can range from theoretical studies of models to actual formalisations of mathematics in a proof system (such as Agda), or working on design of proof assistants incorporating the advances brought by the connections with homotopy theory. Please consider applying for the position and help distributing this information to people you think could be interested. _Deadline for application: October 26th 2022._ For more information please visit https://urldefense.com/v3/__https://web103.reachmee.com/ext/I005/1035/job?site=7&lang=UK&validator=9b89bead79bb7258ad55c8d75228e5b7&job_id=27429__;!!IBzWLUs!Re9hqrNB4c-BkvGJSLkR1AHtxIomQzO792WzHdrfO4BWbuWs0HC01Nu0Ifcw5Gn65QwVGuNhNdrBTZP8X2bagTybL3AuwA$ Thanks! -- -- Ana Bove, Docent Phone: (46)(31) 772 1020 https://urldefense.com/v3/__http://www.cse.chalmers.se/*bove__;fg!!IBzWLUs!Re9hqrNB4c-BkvGJSLkR1AHtxIomQzO792WzHdrfO4BWbuWs0HC01Nu0Ifcw5Gn65QwVGuNhNdrBTZP8X2bagTysSF-ojg$ Department of Computer Science and Engineering Chalmers Univ. of Technology and Univ. of Gothenburg -------------- next part -------------- An HTML attachment was scrubbed... URL: From jan.kofron at d3s.mff.cuni.cz Thu Oct 6 10:23:53 2022 From: jan.kofron at d3s.mff.cuni.cz (jan.kofron at d3s.mff.cuni.cz) Date: Thu, 06 Oct 2022 16:23:53 +0200 Subject: [TYPES/announce] ETAPS 2023 Final joint call for papers Message-ID: <633ee4f9.gV0aXYck4OYEKctT%jan.kofron@d3s.mff.cuni.cz> ****************************************************************** JOINT CALL FOR PAPERS 26th European Joint Conferences on Theory and Practice of Software ETAPS 2023 Paris, France, 22-27 April 2023 https://urldefense.com/v3/__https://etaps.org/2023__;!!IBzWLUs!SzR8hP5h5-W3q97uL4FWPf_qO17QWh0rIgeNEYqZ6lwu5H9bgFJeUNC6SjoxqVUwHW0wwkLKpMIOZ-xPD5QQkAcK8qUOCn31F8TwRyaAmNU$ ****************************************************************** -- ABOUT ETAPS -- ETAPS is the primary European forum for academic and industrial researchers working on topics relating to software science. ETAPS, established in 1998, is a confederation of four annual conferences accompanied by satellite workshops. ETAPS 2023 is the twenty-sixth event in the series. -- Why choose ETAPS? -- * ETAPS is one of the world's leading fora for research on software science, with a history of more than 25 years. * The proceedings of ETAPS appear in gold open access, with no article processing charge for the authors specifically. * ETAPS has low participation fees for all and students in particular. -- What is new in 2023? -- * The SPIN symposium will be co-located with ETAPS. More info at: https://urldefense.com/v3/__https://spin-web.github.io/SPIN2023/__;!!IBzWLUs!SzR8hP5h5-W3q97uL4FWPf_qO17QWh0rIgeNEYqZ6lwu5H9bgFJeUNC6SjoxqVUwHW0wwkLKpMIOZ-xPD5QQkAcK8qUOCn31F8TwtkGurEU$ . * TACAS will use a double-blind reviewing process. * ESOP, FASE, and newly also FoSSaCS welcome voluntary submissions of artefacts for evaluation after paper acceptance; the outcome will not change the paper acceptance decision. * Presentations of the test-of-time-award and the doctoral- dissertation-award winners will take place. * A plenary session for TOOLympics will be organised. -- MAIN CONFERENCES (24-27 April 2023) -- * ESOP: European Symposium on Programming (PC chair: Thomas Wies, New York University) * FASE: Fundamental Approaches to Software Engineering (PC chairs: Leen Lambers, BTU Cottbus-Senftenberg, and Sebasti?n Uchitel, University of Buenos Aires) * FoSSaCS: Foundations of Software Science and Computation Structures (PC chairs: Pawel Sobocinski, Tallinn University of Technology, and Orna Kupferman, Hebrew University of Jerusalem) * TACAS: Tools and Algorithms for the Construction and Analysis of Systems (PC chairs: Sriram Sankaranarayanan, University of Colorado, Boulder, CO, and Natasha Sharygina, University of Lugano) ETAPS'23 will also host another edition of TOOLympics, organised by Dirk Beyer, Fabrice Kordon, and Arnd Hartmanns. -- INVITED SPEAKERS -- * Unifying speakers: Thomas A. Henzinger (IST, Austria) V?ronique Cortier (Loria, France) * ESOP: Mooly Shagiv (Tel Aviv University, Israel) * FASE: Sven Apel (Saarland University, Germany) * Tutorial speakers: TBA -- IMPORTANT DATES (UPDATED) -- * Paper submission: 13 October 2022, 23:59 AoE * TACAS artefact submission deadline: 10 November 2022 * Rebuttal (ESOP, FoSSaCS, partially TACAS): Tuesday 6 December - Thursday 8 December 2022 * Paper notification: 22 December, 2022 * ESOP, FASE, FoSSaCS artefact submission deadline: 5 January 2023 * TACAS mandatory-artefact notification for conditionally accepted papers: 19 January 2023 * Paper final version: 26 January 2023 * Artefact notification ESOP, FASE, FoSSaCS, TACAS: 9 February 2023 -- SUBMISSION INSTRUCTIONS -- The four main conferences of ETAPS 2023 solicit contributions of the following types. All page limits are given **excluding the bibliography**. * ESOP: regular research papers of max 25 pp * FASE: regular research papers and empirical evaluation papers of max 18 pp, new ideas and emerging results (NIER) papers of max 8 pp, tool demonstration papers of max 6 pp (+ mandatory appendix of max 6 pp), * FoSSaCS: regular research papers of max 18 pp * TACAS: regular research papers, case study papers and regular tool papers of max 16 pp, tool demonstration papers of max 6 pp (+ mandatory appendix of max 6 pp), Sumbission links for particular conferences follow: * ESOP: https://urldefense.com/v3/__https://easychair.org/conferences/?conf=esop2023__;!!IBzWLUs!SzR8hP5h5-W3q97uL4FWPf_qO17QWh0rIgeNEYqZ6lwu5H9bgFJeUNC6SjoxqVUwHW0wwkLKpMIOZ-xPD5QQkAcK8qUOCn31F8TwbnKjq5s$ * FASE: https://urldefense.com/v3/__https://easychair.org/conferences/?conf=fase23__;!!IBzWLUs!SzR8hP5h5-W3q97uL4FWPf_qO17QWh0rIgeNEYqZ6lwu5H9bgFJeUNC6SjoxqVUwHW0wwkLKpMIOZ-xPD5QQkAcK8qUOCn31F8Tws32caos$ * FoSSaCS: https://urldefense.com/v3/__https://easychair.org/conferences/?conf=fossacs2023__;!!IBzWLUs!SzR8hP5h5-W3q97uL4FWPf_qO17QWh0rIgeNEYqZ6lwu5H9bgFJeUNC6SjoxqVUwHW0wwkLKpMIOZ-xPD5QQkAcK8qUOCn31F8TweTSqti8$ * TACAS: https://urldefense.com/v3/__https://easychair.org/conferences/?conf=tacas2023__;!!IBzWLUs!SzR8hP5h5-W3q97uL4FWPf_qO17QWh0rIgeNEYqZ6lwu5H9bgFJeUNC6SjoxqVUwHW0wwkLKpMIOZ-xPD5QQkAcK8qUOCn31F8TwwzN4VQg$ For definitions of the different paper types and specific instructions, where they are present, see the webpages of the individual conferences. All accepted papers will appear in the proceedings and have presentations during the conference. A condition of submission is that, if the submission is accepted, one of the authors attends the conference to give the presentation. We plan ETAPS 2023 as an on-site conference; nonetheless, remote attendance and presentation will be made possible. Submitted papers must be in English, presenting original research. They must be unpublished and not submitted for publication elsewhere. In particular, simultaneous submission of the same contribution to multiple ETAPS conferences is forbidden. Submissions must follow the formatting guidelines of Springer's LNCS (use the llncs.cls class) and be submitted electronically in pdf through the Easychair author interface of the respective conference. Submissions not adhering to the specified format and length may be rejected immediately. ESOP, FASE, and TACAS will use **double-blind reviewing**. Authors are asked to omit their names and institutions; refer to prior work in the third person, just as prior work by others; not to include acknowledgements that might identify them. ESOP and FoSSaCS will use an **author rebuttal phase**. TACAS will use rebuttal for selected submissions (those in the grey zone). Artefact submission and evaluation Regular tool paper and tool demonstration paper submissions to TACAS must be accompanied by an artefact submitted shortly after the paper. The artefact will be evaluated, and the outcome will be considered in the paper's acceptance decision. Authors of research papers and case study papers may submit an artefact for evaluation after receiving the acceptance notifications. The outcome of the artefact evaluation will not change the paper acceptance decision. ESOP, FASE, and FoSSaCS will accept artefact submissions; however, participation in it is voluntary; the artefact submission deadline is after the paper notification deadline. The outcome will not alter the paper acceptance decision. For specific instructions regarding artefacts, see the web pages of the individual conferences. -- PUBLICATION The proceedings will be published in the Advanced Research in Computing and Software Science (ARCoSS) subline of Springer's LNCS series. The proceedings volumes will appear in gold open access, so the published versions of all papers will be available for everyone to download from the publisher's website freely, from the date of online publication, perpetually. The copyright of the papers will remain with the authors. -- AWARDS The strongest papers from the four conferences will be nominated for the ETAPS best paper awards of EAPLS, EASST and EATCS, and the SCP best tool paper award. The ETAPS test-of-time award will be granted, recognising outstanding papers published at ETAPS more than ten years in the past. The Doctoral Dissertation Award will be granted to promote and recognise an outstanding dissertation in the research areas covered by the four main ETAPS conferences. -- SATELLITE EVENTS (22-23 April 2023) -- A number of satellite workshops and other events will take place during the weekend before the main conferences. In particular, there will be a PhD student mentoring workshop organised by Caterina Urban and Wolfgang Ahrendt. -- CITY AND HOST INSTITUTION -- ETAPS 2023 will take place in Paris, France. The conferences and satellite events will be hosted at Sorbonne Universit? and IHP (Institut Henri Poincar?), respectively. They are located in the very centre of the city, in the famous historic district of Quartier Latin. The new museum of mathematical sciences of IHP and the historical mathematics library are also in the same buildings as the satellite events. Several museums, churches and historical buildings can be visited in this area. The convenient location allows for accessing most places in Paris by public transport. ETAPS is organised by the MeFoSyLoMa community, which gathers all researchers on formal methods for software and hardware systems in the ?le-de-France region. -- ORGANISERS -- General co-chairs: * Fabrice Kordon (Sorbonne Universit?) * Laure Petrucci (Universit? Sorbonne Paris Nord) Workshop co-chairs: * Benedikt Bollig (CNRS) * Stefan Haar (Inria) Tutorial chair: * ?tienne Andr? (Universit? Sorbonne Paris Nord) Web co-chairs: * Denis Poitrenaud (Universit? Paris Cit?) * Stefan Schwoon (ENS Paris-Saclay) Publicity co-chairs * Beno?t Barbot (Universit? Paris-Est Cr?teil) * Nathalie Sznajder (Sorbonne Universit?) Sponsor chair * C?line Ghibaudo (Sorbonne Universit?) Communication chair * Anna-Marie Reytier (Sorbonne Universit?) Local proceedings chair * ?tienne Andr? (Sorbonne Paris Nord) From bove at chalmers.se Thu Oct 6 10:24:37 2022 From: bove at chalmers.se (Ana Bove) Date: Thu, 6 Oct 2022 16:24:37 +0200 Subject: [TYPES/announce] Four (4) PhD student positions in dependent type theory for mathematics and computer science Message-ID: <4ddcd6d7-e8ad-6fe7-8048-ca8520d8dd9f@chalmers.se> Dear All The logic and types group at Chalmers and Gothenburg university is now recruiting *four PhD students* to work on dependent type theory for mathematics and computer science together with Prof. Thierry Coquand and others in the group. The project is about homotopy type theory and univalent foundations, where type theory is extended with univalence and higher inductive types. The selected PhD students would be working on topics ranging from theoretical studies of models and connections to higher category theory to actual formalisations of mathematics, but they could also work more oriented toward implementation of proof systems, in particular connected to Agda. It is worth noting that the selected students will get a full time employment with all the benefits of a usual employment in Sweden (health and pension benefits, paid holidays, etc). Please consider applying and help distributing this information to people you think could be interested. _Deadline for application: November 4th 2022._ For more information please visit https://urldefense.com/v3/__https://web103.reachmee.com/ext/I005/1035/job?site=7&lang=UK&validator=9b89bead79bb7258ad55c8d75228e5b7&job_id=27467__;!!IBzWLUs!XMonB5U1fU3OzCh5G3pYiTFE1WLa4X9lTvt2YAc5e9y8mrMsVaqeSD4m7TcxUKWHxs7-GKEKsmKBQLRlYb0UynKfSeaMwg$ Thanks -- -- Ana Bove, Docent Phone: (46)(31) 772 1020 https://urldefense.com/v3/__http://www.cse.chalmers.se/*bove__;fg!!IBzWLUs!XMonB5U1fU3OzCh5G3pYiTFE1WLa4X9lTvt2YAc5e9y8mrMsVaqeSD4m7TcxUKWHxs7-GKEKsmKBQLRlYb0UynIii9dPtA$ Department of Computer Science and Engineering Chalmers Univ. of Technology and Univ. of Gothenburg -------------- next part -------------- An HTML attachment was scrubbed... URL: From foones at gmail.com Thu Oct 6 18:32:53 2022 From: foones at gmail.com (Pablo Barenbaum) Date: Thu, 6 Oct 2022 19:32:53 -0300 Subject: [TYPES/announce] =?utf-8?q?ECI_2023_=E2=80=93_Call_for_course_pr?= =?utf-8?q?oposals_=E2=80=93_Buenos_Aires=2C_July_2023?= Message-ID: (Spanish version below) Call for course proposals 36th Informatics Sciences School - ECI 2023 July 24 to 28, 2023 Buenos Aires, Argentina IMPORTANT DATES 28 November 2022: Proposal submission deadline End of January 2023: Notification This is an invitation to submit proposals for courses in all areas of Computer Science to be included in the program of the "36? Escuela de Ciencias Inform?ticas" - ECI 2023, to be held at Departamento de Computaci?n , Facultad de Ciencias Exactas y Naturales , Universidad de Buenos Aires , from July 24th to 28th, 2023. The Escuela de Ciencias Inform?ticas (ECI) has been held annually at our department since 1987. The goal of ECI is to offer to Computer Science students and practitioners intensive, top-level courses on topics not covered by the regular curricula. These courses are taught by prestigious lecturers from universities and institutions from all around the world. Each year, between 400 and 800 students participate in ECI, taking one, two or three courses each. COURSE FORMAT ECI courses last 15 hours in total (3 hours per day from Monday to Friday) and are aimed to advanced undergraduate or graduate students. These courses should include a final evaluation, which can be a take-home to be sent by e-?mail to the lecturer. Submissions for courses to be taught in Spanish or English are acceptable. The school will cover travel, hotel, and local expenses of ECI 2023 lecturers. SUBMISSION INSTRUCTIONS Proposals should be submitted using the following form: https://urldefense.com/v3/__https://easychair.org/conferences/?conf=eci2023__;!!IBzWLUs!QPgvm7C-0O-iN9KP22smjHWrBkRR2QaWykieq3HUWraq37a72iHTkfKcjOu162iKi5Kpbv9emLzV7OeNQDYEg2_m85Xn$ The submission must be done in PDF format, containing only the following sections: * Title * Abstract (At most 1300 characters) * Objectives of the course (At most 1300 characters) * Topic (You must choose among the first level of ACM CCS ( https://urldefense.com/v3/__https://dl.acm.org/ccs/ccs.cfm__;!!IBzWLUs!QPgvm7C-0O-iN9KP22smjHWrBkRR2QaWykieq3HUWraq37a72iHTkfKcjOu162iKi5Kpbv9emLzV7OeNQDYEg8L0qNRA$ ), e.g. "Computer Systems Organization"). * Language: [English/Spanish] * Brief index (a list of topics that will be covered during the course) * Schedule (Approximate timeline of how these topics will be presented from Monday to Friday). * Suggested bibliography (At least three books or papers that are related to the topics of the course) * Student's preferred background (The academic background the students should have in order to be able to understand the course. A general description in the form of course names or topics will suffice.). * Will the course have a lab component? [Yes/No] (Optionally, your course can have a lab component for hands-on practice. In this case, the ECI organization will assign lab space with computers for the students). * Optional: Local contact. (A local contact in the Department of Computer Science, FCEyN, UBA is desirable, but not mandatory) * A CV must be attached to the end of the proposal. For information about previous editions, please refer to https://urldefense.com/v3/__https://eci.dc.uba.ar/institucional/*ecis-anteriores__;Iw!!IBzWLUs!QPgvm7C-0O-iN9KP22smjHWrBkRR2QaWykieq3HUWraq37a72iHTkfKcjOu162iKi5Kpbv9emLzV7OeNQDYEgxETT5Hj$ or send an e-?mail to eci2023-chair at dc.uba.ar Sergio Abriola (Chair) Pablo Barenbaum (Co-Chair) ******************************************************************************************** Llamado para presentar propuestas de cursos 36.? Escuela de Ciencias Inform?ticas - ECI 2023 Del 24 al 28 de julio de 2023 Buenos Aires, Argentina FECHAS IMPORTANTES 28 de noviembre de 2022: Fecha l?mite para env?o de propuestas Fin de enero de 2023: Notificaci?n de aceptaci?n Se invita a presentar propuestas de cursos para la 36.? Escuela de Ciencias Inform?ticas - ECI 2023, que se realizar? del lunes 24 al viernes 28 de julio de 2023 en el Departamento de Computaci?n de la Facultad de Ciencias Exactas y Naturales de la Universidad de Buenos Aires . La Escuela de Ciencias Inform?ticas (ECI) se lleva a cabo en nuestro departamento anualmente desde el a?o 1987. Tiene como objetivo ofrecer a alumnos de ciencias de la computaci?n y profesionales del medio, cursos intensivos de posgrado, especializaci?n y/?o actualizaci?n de alto nivel cient?fico, sobre temas habitualmente no cubiertos por el curr?culo de grado. Estos cursos son dictados por prestigiosos profesores de otras universidades u otras instituciones, extranjeras y nacionales. A las distintas ediciones de la ECI han concurrido entre 400 y 800 personas que tomaron hasta 3 cursos cada una. FORMATO DE LOS CURSOS Los cursos propuestos deber?n comprender 15 horas (de lunes a viernes con una carga diaria de 3 horas). Los mismos deber?n ser dirigidos a estudiantes de grado universitario avanzado/postgrado. Cada curso deber? tener una evaluaci?n final, la cual podr? ser un trabajo entregado por e-mail. Los cursos podr?n ser dictados en idioma Espa?ol o Ingl?s. La organizaci?n de la ECI cubre los gastos de pasajes, alojamiento, y vi?ticos de sus profesores. No se pagan honorarios. INSTRUCCIONES Las propuestas se deben enviar usando el siguiente formulario: https://urldefense.com/v3/__https://easychair.org/conferences/?conf=eci2023__;!!IBzWLUs!QPgvm7C-0O-iN9KP22smjHWrBkRR2QaWykieq3HUWraq37a72iHTkfKcjOu162iKi5Kpbv9emLzV7OeNQDYEg2_m85Xn$ El env?o debe estar en formato PDF, y debe contener exclusivamente las siguientes secciones: * T?tulo * Resumen (1300 caracteres como m?ximo) * Objetivos del curso (1300 caracteres como m?ximo) * ?rea (Debe elegir un ?rea del primer nivel de las ?reas de ACM CCS ( https://urldefense.com/v3/__https://dl.acm.org/ccs/ccs.cfm__;!!IBzWLUs!QPgvm7C-0O-iN9KP22smjHWrBkRR2QaWykieq3HUWraq37a72iHTkfKcjOu162iKi5Kpbv9emLzV7OeNQDYEg8L0qNRA$ ), por ejemplo "Computer Systems Organization") * Idioma: [espa?ol/ingl?s] * Listado de temas (una lista de temas que ser?n cubiertos durante el curso) * Programa (Un programa aproximado de c?mo se cubrir?n esos temas en cada clase del lunes a viernes). * Bibliograf?a sugerida (Al menos tres libros o papers relacionados con el tema del curso) * Prerrequisitos (Los conocimientos que los estudiantes deber?an tener para poder seguir el curso. Una descripci?n general en forma de nombre de cursos o temas es suficiente). * ?El curso utilizar? laboratorio con computadoras? [S?/No] (Opcionalmente, su curso puede utilizar laboratorio, o pr?ctica. En ese caso, la organizaci?n de la ECI le asignar? un espacio de laboratorio con computadoras para los estudiantes). * Opcional: Contacto local. (Un contacto local en el Departamento de Computaci?n, FCEyN, UBA es deseable, pero no obligatorio) * Al final de la propuesta debe adjuntar un CV actualizado del profesor. Para informaci?n sobre ediciones previas, dirigirse a https://urldefense.com/v3/__https://eci.dc.uba.ar/institucional/*ecis-anteriores__;Iw!!IBzWLUs!QPgvm7C-0O-iN9KP22smjHWrBkRR2QaWykieq3HUWraq37a72iHTkfKcjOu162iKi5Kpbv9emLzV7OeNQDYEgxETT5Hj$ o enviar email a eci2023-chair at dc.uba.ar . Sergio Abriola (Presidente) Pablo Barenbaum (Vice-Presidente) -------------- next part -------------- An HTML attachment was scrubbed... URL: From jan.kofron at d3s.mff.cuni.cz Fri Oct 7 09:30:36 2022 From: jan.kofron at d3s.mff.cuni.cz (jan.kofron at d3s.mff.cuni.cz) Date: Fri, 07 Oct 2022 15:30:36 +0200 Subject: [TYPES/announce] ETAPS Doctoral Dissertation Award 2023 Message-ID: <634029fc.I5hvTYG6X76sisSh%jan.kofron@d3s.mff.cuni.cz> 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, 2022 to December 31st, 2022. 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=etapsdda2023__;!!IBzWLUs!Vil3tMdW8xejKnx76sZWTtcBglZWbm4mDN0lFv0ZobXjg60YgsXaFCxQk3FL4rnMivopxA472t-FyXHjcUeiQyPvIZsbRioMjBrAdyhjfEM$ The deadline for nominations is January 16th, 2023. Award Committee --------------- Caterina Urban (chair) Nobuko Yoshida (representing ESOP) Reiko Heckel (representing FASE) Andrzej Murawski (representing FoSSaCS) Kim G. Larsen (representing TACAS) Marieke Huisman Sebastian Wolff Contact ------- All questions about submissions should be emailed to the chair of the award committee, Caterina Urban . From igarashi at kuis.kyoto-u.ac.jp Fri Oct 7 21:59:21 2022 From: igarashi at kuis.kyoto-u.ac.jp (Atsushi Igarashi) Date: Sat, 08 Oct 2022 10:59:21 +0900 Subject: [TYPES/announce] Call for Workshop Proposals for 2023 Message-ID: 2023 : The Art, Science, and Engineering of Programming March 13-17, 2023, Tokyo, Japan https://urldefense.com/v3/__http://2023.programming-conference.org__;!!IBzWLUs!XVgZeb0iol18DlMVJn8bXwHZEuDJmksLk2zEE-1yfJzE6nKNEx-UYamDF6AaocBAH_VMHQaVAUV0mcVJcnPVtFqdKvpJvV_J8bkm-z1KEw$ ******************************************************** CALL FOR WORKSHOP PROPOSALS ******************************************************** https://urldefense.com/v3/__https://2023.programming-conference.org/track/programming-2023-workshops__;!!IBzWLUs!XVgZeb0iol18DlMVJn8bXwHZEuDJmksLk2zEE-1yfJzE6nKNEx-UYamDF6AaocBAH_VMHQaVAUV0mcVJcnPVtFqdKvpJvV_J8bmUaqoSdA$ To build a community and to foster an environment where participants can exchange ideas and experiences related to practical software development, ?Programming? will host a number of workshops. A workshop can be intended as a collaborative forum to exchange recent and/or preliminary results, to conduct intensive discussions on a particular topic, or to coordinate efforts between representatives of a technical community. They can also be regarded as a forum for lively discussion of innovative ideas, progress, or practical experience on programming and applied software development in general for specific aspects, specific problems, or domain-specific needs. This year, we would like to encourage organizers to be creative and experiment with all kinds of events including hallways discussions, academic parties besides the more traditional workshops. Possible types of workshops include a meeting like a Dagstuhl Seminar or Shonan meeting, a gathering for an international research project, a tool demo/tutorial, hands-on workshops in which participants experience one or several aspects of practical software development, social gathering around a particular topic and so on. Open meetings are preferable but closed ones could be accepted. We are flexible and welcome innovative social gatherings; if you have any ideas or questions, please contact the workshops co-chairs. The duration of workshops is in general one day, but we encourage the submission of half-day workshop proposals on focused topics as well. ### Submission Deadlines Deadline: October 21st, 2022 Notifications will go out as soon as possible, within a week after the deadline. ### Workshop Selection Committee Youyou Cong (Tokyo Institute of Technology, Japan) Elisa Gonzalez Boix (Vrije Universiteit Brussel, Belgium) ### Submission and Workshop Process Please submit your workshop proposal electronically via the submission system: https://urldefense.com/v3/__https://2023.programming-conference.org/createProposal/e4566fc4-6cc7-4609-a068-bdc51b77cde5__;!!IBzWLUs!XVgZeb0iol18DlMVJn8bXwHZEuDJmksLk2zEE-1yfJzE6nKNEx-UYamDF6AaocBAH_VMHQaVAUV0mcVJcnPVtFqdKvpJvV_J8bkufsiTsg$ Please adhere to the workshop proposal guidelines given below and provide all requested information about the proposed workshop. Please keep it brief and use the provided form. The intention is not to spend time on proposal writing, but on preparing the organization of the workshop. To coordinate with the deadlines of the main conference, the following deadlines have to be respected by workshops: **Workshop webpage and CFP:** November 14th 2022 **Deadline for submissions to the workshops:** - possibly after January 15th 2023 (final notification of issue 3) - no later than January 20th 2023 **Notification of authors:** No later than February 6th **Deadline for Camera-Ready Papers (Companion Proceedings at ACM DL):** May 1st 2023 **Workshop dates:** March 13th and 14th 2023 (tentative) ### Workshop Proposal Guidelines Please include the following information either directly in the proposal, or CFP. The submission system has a form that includes an abstract (for the website), the CFP, and the remaining proposal. CFPs often cover the same information, duplication is not necessary for such cases. Organizers of a workshop previously co-located at are allowed to submit a minimal proposal including information for the questions marked with (*). 1. What is the motivation for the workshop? - Objectives - Intended audience - Relevance (with respect to the topics of the conference) 2(*). Who organizes the workshop? - Organizers and primary contact (name / affiliation / email) - Brief details on the organizers (previous workshop organizing experience, etc.) - Data on potential previous iterations of the workshop - How many participants do you expect (please make at least an educated guess) - What kind of software do you expect to use to run the workshop (e.g. slack, Zoom, Teams, etc.) - Advertisement: Planed advertisement strategy to ensure participation 3. Is there going to be a workshop program committee? - if so, please list the members (indicated as finalized or expected) 4. What is the planned workshop format? - Planned deadlines - Intended submission format (e.g. intended format for articles, posters, abstracts, or any other kind of submission requested to participate in the workshop) - Evaluation process for submissions - Intended workshop format (including duration, number of presentations/talks, planned invited talks/keynotes, etc.) 5(*). What is the intended publication of accepted submissions? - ACM DL post companion proceedings and/or website pre/post-proceedings From yatapanage at gmail.com Sat Oct 8 03:06:44 2022 From: yatapanage at gmail.com (Nisansala Yatapanage) Date: Sat, 8 Oct 2022 18:06:44 +1100 Subject: [TYPES/announce] Multiple PhD positions at The Australian National University Message-ID: Dear all, The Computing Foundations cluster at the School of Computing, The Australian National University, have multiple PhD scholarships available in areas relevant to the types community, including logic, programming languages, systems, formal methods, theory and software engineering. If you want to do cutting edge research in any of these fields, or a mix thereof, visit our page at: https://urldefense.com/v3/__https://comp.anu.edu.au/join/foundationsPhD/__;!!IBzWLUs!Q_9-PJDcOsWa1GKulle-UAPdDXYZD4Z3WfcIYQIPto6S5hmCvZBBY-Kfb-nfpl_qSr87k3Km9HNTd5eGEZHLU-6xVaGgDIbMPg$ and get in touch with any of the staff listed. Please also contact Michael Norrish (cluster lead) for further details. Cheers, Nisansala ---------------------------------------------------------------------------------------------------- Dr. Nisansala Yatapanage Lecturer, School of Computing, The Australian National University https://urldefense.com/v3/__https://cecs.anu.edu.au/people/nisansala-yatapanage__;!!IBzWLUs!Q_9-PJDcOsWa1GKulle-UAPdDXYZD4Z3WfcIYQIPto6S5hmCvZBBY-Kfb-nfpl_qSr87k3Km9HNTd5eGEZHLU-6xVaHOzboY8g$ ----------------------------------------------------------------------------------------------------- -------------- next part -------------- An HTML attachment was scrubbed... URL: From Robin.Kaarsgaard at ed.ac.uk Mon Oct 10 00:27:40 2022 From: Robin.Kaarsgaard at ed.ac.uk (Robin Kaarsgaard) Date: Mon, 10 Oct 2022 04:27:40 +0000 Subject: [TYPES/announce] =?utf-8?q?SYCO_10_=E2=80=93_Call_for_submission?= =?utf-8?q?s?= Message-ID: <2087BE42-FD31-4E20-8061-D9FBAF7EB36E@ed.ac.uk> ----------------------------------------- CALL FOR SUBMISSIONS TENTH SYMPOSIUM ON COMPOSITIONAL STRUCTURES (SYCO 10) Edinburgh, United Kingdom 19-20 December, 2022 Submission deadline: Monday 7 November 2022 https://urldefense.com/v3/__https://www.cl.cam.ac.uk/events/syco/10/__;!!IBzWLUs!S_t6vdsHjoreLy_5vjgII7PqpsOUzaOEts4jM56In2CcjDZktBJAsbp5UuaHYtK5pPCYATnESz9GF3Xhw455obTFJ9xcdd1Bep3Gp35TIR4$ ----------------------------------------- The Symposium on Compositional Structures (SYCO) is an interdisciplinary series of meetings aiming to support the growing community of researchers interested in the phenomenon of compositionality, from both applied and abstract perspectives, and in particular where category theory serves as a unifying common language. Previous SYCO events have been held in Birmingham, Strathclyde, Oxford, Chapman, Leicester, Tallinn, and Como. We welcome submissions from researchers across computer science, mathematics, physics, philosophy, and beyond, with the aim of fostering friendly discussion, disseminating new ideas, and spreading knowledge between fields. Submission is encouraged for both mature research and work in progress, and by both established academics and junior researchers, including students. Submissions is easy, with no formatting or page restrictions. The meeting does not have proceedings, so work can be submitted even if it has been submitted or published elsewhere. You could submit work-in-progress, or a recently completed paper, or even a PhD or Masters thesis. While no list of topics could be exhaustive, SYCO welcomes submissions with a compositional focus related to any of the following areas, in particular from the perspective of category theory: - logical methods in computer science, including classical and quantum programming, type theory, concurrency, natural language processing and machine learning; - graphical calculi, including string diagrams, Petri nets and reaction networks; - languages and frameworks, including process algebras, proof nets, type theory and game semantics; - abstract algebra and pure category theory, including monoidal category theory, higher category theory, operads, polygraphs, and relationships to homotopy theory; - quantum algebra, including quantum computation and representation theory; - tools and techniques, including rewriting, formal proofs and proof assistants, and game theory; - industrial applications, including case studies and real-world problem descriptions. ** IMPORTANT DATES ** All deadlines are 23:59 Anywhere on Earth. Submission deadline: Monday 7 November, 2022 Author notification: Sunday 20 November, 2022 Symposium dates: Monday 19 and Tuesday 20 December 2022 ** SUBMISSION INSTRUCTIONS ** Submissions are by OpenReview, via the SYCO 10 submission page: https://urldefense.com/v3/__https://openreview.net/group?id=cl.cam.ac.uk*SYCO*2022*Symposium__;Ly8v!!IBzWLUs!S_t6vdsHjoreLy_5vjgII7PqpsOUzaOEts4jM56In2CcjDZktBJAsbp5UuaHYtK5pPCYATnESz9GF3Xhw455obTFJ9xcdd1Bep3Gcq3JRVU$ Submission is easy, with no format requirements or page restrictions. The meeting does not have proceedings, so work can be submitted even if it has been submitted or published elsewhere. Think creatively: you could submit a recent paper, or notes on work in progress, or even a recent Masters or PhD thesis. In the event that more good-quality submissions are received than can be accommodated in the timetable, the programme committee may choose to *defer* some submissions to a future meeting, rather than reject them. Deferred submissions can be re-submitted to any future SYCO meeting, where they will not need peer review, and where they will be prioritised for inclusion in the programme. Meetings will be held sufficiently frequently to avoid a backlog of deferred papers. If you have a submission which was deferred from a previous SYCO meeting, it will not automatically be considered for SYCO 10; you still need to submit it again through OpenReview. When submitting, append the words "DEFERRED FROM SYCO X" to the title of your paper, replacing "X" with the appropriate meeting number. There is no need to attach any documents. ** PROGRAMME COMMITTEE ** The PC chair is Robin Kaarsgaard, University of Edinburgh. The Programme Committee will be announced soon. ** STEERING COMMITTEE ** Ross Duncan, University of Strathclyde Chris Heunen, University of Edinburgh Dominic Horsman, University of Oxford Aleks Kissinger, University of Oxford Samuel Mimram, ?cole Polytechnique Simona Paoli, University of Aberdeen Mehrnoosh Sadrzadeh, University College London Pawel Sobocinski, Tallinn University of Technology Jamie Vicary, University of Cambridge The University of Edinburgh is a charitable body, registered in Scotland, with registration number SC005336. Is e buidheann carthannais a th? ann an Oilthigh Dh?n ?ideann, cl?raichte an Alba, ?ireamh cl?raidh SC005336. From Danko.Ilik at cnes.fr Mon Oct 10 04:48:08 2022 From: Danko.Ilik at cnes.fr (Ilik Danko) Date: Mon, 10 Oct 2022 08:48:08 +0000 Subject: [TYPES/announce] Internship for master students at CNES Paris-Daumesnil Message-ID: <5D3BBE596779B4489CC4DA67BAC302E9DB00C6@TW-MBX-P02.cnesnet.ad.cnes.fr> Dear list, In case some of your students might be interested, we have a couple of internship offerings at CNES, the French space agency, in particular one that has to do with software, formal methods, and dependability, here: https://urldefense.com/v3/__https://recrutement.cnes.fr/fr/annonce/1924175-ingenieure-informatique-projet-etudiant-surete-de-fonctionnement-logiciel-75012-paris?s_o=Cooptation&s_b=DigitalRecruiters__;!!IBzWLUs!VkjwaZxPHdN5vNBvSfZTkzfw3_2myi_AB7p4T6GIfgSrS_F0MkUqpvBMBt7e8k30CznEFkM9iWWGluAbRcUh-jJvxPj7JVN_XYY$ The internship is meant for students studying in France mostly, for administrative reasons. The location is downtown Paris and there is a (modest) remuneration involved. Thank you, Best regards, -- Danko ILIK, Centre national d'?tudes spatiales From andreeac at comp.nus.edu.sg Mon Oct 10 05:16:35 2022 From: andreeac at comp.nus.edu.sg (Andreea Costea) Date: Mon, 10 Oct 2022 17:16:35 +0800 Subject: [TYPES/announce] SPLASH 2022 - Call For Participation: OOPSLA/APLAS/DLS/GPCE/SAS/SLE and more Message-ID: ====================================================================== Call For Participation 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__;!!IBzWLUs!RhJOr3l4BG6kp1vfelN-vwyTimMax6c4PUF5srkiYLZKltP9vAzM92ktbx26a83fmQbrPnWBQpfdbUz2j8uO32rZNRDuNz366Rnybo0$ ====================================================================== SPLASH - The ACM SIGPLAN conference on Systems, Programming, Languages, and Applications: Software for Humanity embraces all aspects of software construction and delivery, to make it the premier conference on the applications of programming languages - at the intersection of programming languages and software engineering. SPLASH 2022 aims to signify the reopening of the world and being able to meet your international colleagues in person. Follow the registration space on the SPLASH website to attend this fantastic line-up of events: https://urldefense.com/v3/__https://2022.splashcon.org/attending/Registration__;!!IBzWLUs!RhJOr3l4BG6kp1vfelN-vwyTimMax6c4PUF5srkiYLZKltP9vAzM92ktbx26a83fmQbrPnWBQpfdbUz2j8uO32rZNRDuNz363AN12wQ$ Early registration closes on 15th of November 2022. ====================================================================== LIST OF SPLASH EVENTS: - OOPSLA - Onward! Essays - Onward! Papers - PLMW - SPLASH-E - Poster Sessions - Doctoral Symposioum - Student Research Competition (SRC) - Workshops: - FTSCS - HATRA - LIVE - PAINT - REBLS - Unsound - VMIL - Co-hosted events: - APLAS - DLS - GPCE - SAS - SLE - In-person presentations of papers affected by COVID from POPL, PLDI, ICFP, OOPSLA, APLAS, DLS, GPCE, SAS, SLE ======================================================================== ======================================================================== # List of Events ======================================================================== ** OOPSLA Research Papers ** Papers that address various aspects of software development will be presented, including requirements, modelling, prototyping, design, implementation, generation, analysis, verification, testing, evaluation, maintenance, reuse, replacement, and retirement of software systems. These topics may be covered in a variety of ways, including new tools (such as languages, program analyses, and runtime systems), new techniques (such as methodologies, design processes, code organization approaches, and management techniques), and new evaluations (such as formalisms and proofs, corpora analyses, user studies, and surveys). ** Onward! Essays ** Onward! Essays targets topics important to the software community construed broadly. An essay can be an exploration of a topic, its impact, or the circumstances of its creation; it can present a personal view of what is, explore a terrain, or lead the reader in an act of discovery; it can be a philosophical digression or a deep analysis. It can describe a personal journey, perhaps that by which the author reached an understanding of such a topic. The subject area is interpreted broadly and can include the relationship of software to human endeavours, or its philosophical, sociological, psychological, historical, or anthropological underpinnings. ** Onward! Papers ** Onward! is a premier multidisciplinary conference focused on everything to do with programming and software: including processes, methods, languages, communities, and applications. Onward! is more radical, more visionary, and more open than other conferences to ideas that are well-argued but not yet proven. It welcomes different ways of thinking about, approaching, and reporting on programming language and software engineering research. ** PLMW ** The Programming Languages Mentoring Workshop encourages graduate students (PhD and MSc) and senior undergraduate students to pursue research in programming languages. This workshop will provide mentoring sessions on how to prepare for and thrive in graduate school and in a research career, focusing both on cutting-edge research topics and practical advice. The workshop brings together leading researchers and junior students in an inclusive environment in order to help welcome newcomers to our field of programming languages research. The workshop will show students the many paths that they might take to enter and contribute to our research community. ** SPLASH-E ** SPLASH-E is a symposium for software and languages (SE/PL) researchers with activities and interests around computing education. Some build pedagogically-oriented languages or tools; some think about pedagogic challenges around SE/PL courses; some bring computing to non-CS communities; some pursue human studies and educational research. At SPLASH-E, we share our educational ideas and challenges centered in software/languages, as well as our best ideas for advancing such work. ** Posters ** The SPLASH Posters track provides an excellent forum for authors to present their recent or ongoing projects in an interactive setting, and receive feedback from the community. It covers various aspects of programming, systems, languages and applications. The goal of the poster session is to encourage and facilitate small groups of individuals interested in a technical area to gather and interact. ** Doctoral Symposium ** The Doctoral Symposium provides students with useful guidance for completing their dissertation research and beginning their research careers. The symposium provides an interactive forum for doctoral students who have progressed far enough in their research to have a structured proposal, but will not be defending their dissertation in the next 12 months. ** Student Research Competition ** The ACM Student Research Competition (SRC) offers a unique opportunity for undergraduate and graduate students to present their research to a panel of judges and conference attendees at SPLASH. The SRC provides visibility and exposes up-and-coming researchers to computer science research and the research community. This competition also gives students an opportunity to discuss their research with experts in their field, get feedback, and sharpen their communication and networking skills. ======================================================================== # Workshops ======================================================================== ** FTSCS: Formal Techniques for Safety-Critical Systems ** The aim of this workshop is to bring together researchers and engineers who are interested in the application of formal and semi-formal methods to improve the quality of safety-critical computer systems. FTSCS strives to promote research and development of formal methods and tools for industrial applications, and is particularly interested in industrial applications of formal methods. The workshop will provide a platform for discussions and the exchange of innovative ideas, so submissions on work in progress are encouraged. ** HATRA: Human Aspects of Types and Reasoning Assistants ** This workshop brings together programming languages, software engineering, security, and human-computer interaction researchers to investigate methods for making languages that provide stronger safety properties more effective for programmers and software engineers. HATRA promotes both existing works relevant to the workshop?s topic, as well as new ideas, approaches, or hypotheses presented as an opportunity for the authors to receive community feedback and for the community to seek inspiration from others. ** LIVE: Live Programming ** Programming is cognitively demanding, and too difficult. LIVE is a workshop exploring new user interfaces that improve the immediacy, usability, and learnability of programming. Whereas PL research traditionally focuses on programs, LIVE focuses more on the activity of programming. The goal is to provide a supportive venue where early-stage work receives constructive criticism. Whether graduate students or tenured faculty, researchers need a forum to discuss new ideas and get helpful feedback from their peers. Towards that end, we will allot about ten minutes for discussion after every presentation. ** PAINT: Programming Abstractions and Interactive Tools, Notations, and Environments ** In this workshop, we want to discuss programming environments that support users in working with and creating domain-specific abstractions and notations. Topics of interest include the composition and integration of domain-specific abstractions and tools inside general-purpose programming languages and environments, the implementation and evaluation of editing ergonomics and UX concerns, or tool support for creating domain-specific abstractions and tools. Environments that typically exhibit such properties include meta tools or tool creation frameworks, language workbenches, block-based editors and other visual programming approaches or projectional editors. ** REBLS: Reactive and Event-Based Languages and Systems ** This workshop will gather researchers in reactive and event-based languages and systems. The goal of the workshop is to exchange new technical research results and to better define the field by coming up with taxonomies and overviews of the existing work. ** Unsound: Sources of Unsoundness in Verification ** Participants to Unsound will be able to share their experience and exploits on how different verification tools can either be broken or expose confusing behavior, likely to be unexpected by users. We are particularly interested in sources of unsoundness that are accidentally shared by many different unrelated research lines, and to develop an understanding on why this is the case. The workshop is meant to be welcoming for both people with strong theoretical skills, as well as people who just like hacking things. We do not expect fully polished submissions and we will not have formal proceedings. ** VMIL: Virtual Machines and Language Implementations ** The concept of Virtual Machines is pervasive in the design and implementation of programming systems. Virtual Machines and the languages they implement are crucial in the specification, implementation and/or user-facing deployment of most programming technologies. The VMIL workshop is a forum for researchers and cutting-edge practitioners working on language virtual machines to discuss the various related engineering and research issues. ======================================================================== # Co-hosted events ======================================================================== ** APLAS: Asian Symposium on Programming Languages and Systems ** APLAS aims to stimulate programming language research by providing a forum for the presentation of the latest results and the exchange of ideas in programming languages and systems. APLAS is based in Asia but is an international forum that serves the worldwide programming languages community. ** DSL: Dynamic Languages Symposium ** DLS is the premier forum for researchers and practitioners to share knowledge and research on dynamic languages, their implementation, and applications. The influence of dynamic languages ? from Lisp to Smalltalk to Python to JavaScript ? on real-world practice and research, continues to grow. We invite high-quality papers reporting original research, innovative contributions, or experience related to dynamic languages, their implementation, and applications. ** GPCE: International Conference on Generative Programming: Concepts & Experiences ** GPCE is a venue for researchers and practitioners interested in techniques that use program generation, domain-specific languages, and component deployment to increase programmer productivity, improve software quality, and shorten the time-to-market of software products. In addition to exploring cutting-edge techniques of generative software, our goal is to foster further cross-fertilization between software engineering and the programming languages research communities. ** SAS: Static Analysis Symposium ** 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. ** SLE: International ACM SIGPLAN Conference on Software Language Engineering ** SLE is the discipline of engineering languages and the tools required for the creation of software. It abstracts from the differences between programming languages, modelling languages, and other software languages, and emphasizes the engineering facet of the creation of such languages, that is, the establishment of the scientific methods and practices that enable the best results. SLE overlaps with traditional conferences on the design and implementation of programming languages, model-driven engineering, and compiler construction, and emphasizes the fusion of their communities. ====================================================================== Join us in these exciting events! ======================================================================== # Organizing Committee ======================================================================== General Chair: Alex Potanin (Australian National University) OOPSLA Review Committee Chair: Amal Ahmed (Northeastern University) OOPSLA Review Committee Co-Chair: Jan Vitek (Northeastern University; Czech Technical University) OOPSLA Artifact Evaluation Co-Chair: Benjamin Greenman (Brown University) OOPSLA Artifact Evaluation Co-Chair: Ana Milanova (Rensselaer Polytechnic Institute) APLAS Chair: Ilya Sergey (National University of Singapore) DLS PC Co-Chair: Wolfgang De Meuter (Vrije Universiteit Brussel) DLS PC Co-Chair: Arjun Guha (Northeastern University) GPCE General Chair: Bernhard Scholz (University of Sydney) GPCE PC Chair: Yukiyoshi Kameyama (University of Tsukuba) SAS Co-Chair: Caterina Urban (INRIA & ?cole Normale Sup?rieure | Universit? PSL) SAS Co-Chair: Gagandeep Singh (University of Illinois at Urbana-Champaign; VMware) SLE Chair: Bernd Fischer (Stellenbosch University) SLE PC Co-Chair: Lola Burgue?o (Open University of Catalonia) SLE PC Co-Chair: Walter Cazzola (Universit? degli Studi di Milano) Onward! Papers Chair: Christophe Scholliers (Universiteit Gent, Belgium) Onward! Essays Chair: Jeremy Singer (University of Glasgow) SPLASH-E Co-Chair: Martin Henz (National University Of Singapore) SPLASH-E Co-Chair: Benjamin Lerner (Northeastern University) Workshops Co-Chair: Mehdi Bagherzadeh (Oakland University) Workshops Co-Chair: Raffi Khatchadourian (City University of New York (CUNY) Hunter College) Comfy Chair: Tony Hosking (Australian National University) Hybridisation Co-Chair: Jonathan Aldrich (Carnegie Mellon University) Hybridisation Co-Chair: Youyou Cong (Tokyo Institute of Technology) Diversity and Inclusion Chair, Local Organizing Chair: Kelly Blincoe (University of Auckland) Video Co-Chair: Zixian Cai (Australian National University) Video Co-Chair: Benjamin Chung (Northeastern University) Sponsorship Co-Chair: Bor-Yuh Evan Chang (University of Colorado Boulder & Amazon) Publicity Chair, Web Co-Chair: Andreea Costea (National University Of Singapore) PLMW Co-Chair: Molly Feldman (Oberlin College) Budget and Finance Chair: Michael Homer (Victoria University of Wellington) Student Volunteer Co-Chair: Yao Li (University of Pennsylvania) Student Volunteer Co-Chair: Julian Mackay (Victoria University of Wellington) Student Research Competition Co-Chair: Xujie Si (McGill University, Canada) Student Research Competition Co-Chair: Caterina Urban (INRIA & ?cole Normale Sup?rieure | Universit? PSL) Symposium Chair: Fabian Muehlboeck (IST Austria) PLMW Co-Chair: Lukasz Ziarek (University at Buffalo) From benoit at monoidal.net Mon Oct 10 05:29:08 2022 From: benoit at monoidal.net (=?UTF-8?Q?Beno=C3=AEt_Valiron?=) Date: Mon, 10 Oct 2022 11:29:08 +0200 Subject: [TYPES/announce] PhD and postdoc positions in theory of quantum computing in Paris Message-ID: <247500ee-11d2-4d1e-8e3d-be4b26ff6095@app.fastmail.com> # PhD and postdoc positions in theory of quantum computing in Paris The Algorithms & Complexity group at IRIF (CNRS, Universit? Paris-Cit?) in Paris (France) invites applications for multiple fully funded PhD positions and postdoc positions (1-3yrs) to work on the theory of quantum computing. The group has expertise in quantum algorithms and quantum complexity theory, and includes permanent members Simon Apers, Iordanis Kerenidis, Sophie Laplante and Fr?d?ric Magniez. In case of interest, there are opportunities to collaborate with industrial partners. One of the postdoc positions is on the European HPCQS ("High Performance Computer ? Quantum Simulator") platform, and is shared with Beno?t Valiron (Universit? Paris-Saclay) who is an expert in quantum programming languages (see https://urldefense.com/v3/__https://lmf.cnrs.fr/Research/Quant__;!!IBzWLUs!VK_L1yBxo0ZmCazyhfO0yPanaFXVcL0n33OlTBS0guNxC6rxre8fazsf7w84NhagMzrXJJ6zGNxThL1kZ4kxqlXRSEvQ6Lc$ ) Soft deadline: November 1st, 2022. For more information, see send an email to or see the group webpage (irif.fr/en/equipes/algocomp/). From melkon.or at gmail.com Mon Oct 10 07:02:40 2022 From: melkon.or at gmail.com (Orestis Melkonian) Date: Mon, 10 Oct 2022 12:02:40 +0100 Subject: [TYPES/announce] LAST CALL: Agda Implementors' Meeting XXXI - Edinburgh, 10-16 November 2022 Message-ID: <2d8dc738-6490-be7d-b936-8c72de25fad8@gmail.com> --------------------------------------------------------------- ???????????? Agda Implementors' Meeting XXXI *Last call* for participation https://urldefense.com/v3/__http://wiki.portal.chalmers.se/agda/pmwiki.php?n=Main.AIMXXXI__;!!IBzWLUs!XLKaP3B4boSk9UqxFHOGLgG8o3LkH8uqzP5ykxyol1WfL9xF22lXRm3-SiqUv7luDY7cYfMml2WRimmBe05RdvU5oZor-yGs$ --------------------------------------------------------------- The 31st Agda Implementors' Meeting will take place in Edinburgh, Scotland from Thursday 10 November 2022 to Wednesday 16 November 2022. Note that AIMXXXI was initially planned for 2019 but got postponed due to COVID-19, whilst we had several online meetings XXXII-XXXV. The meeting will consist of: ? * Presentations concerning theory, implementation, and use cases of Agda and other Agda-like languages. ? * Discussions around issues related to the Agda language. ? * Plenty of time to work in, on, under or around Agda, in collaboration with other participants. Unfortunately, the EuroProofNet day we initially planned has been cancelled. *Registration deadline (extended): October 21st* To register for AIM XXXI, please fill out the form below and send it to Orestis Melkonian by email , or simply edit the AIMXXI wiki page yourself. > --------------------------------------------------------------- > Registration form for Agda Implementors' Meeting XXXI > > Name: > > Title and optionally abstract (if you want to give a talk or lead a discussion): > > Suggestions for code sprints (optional): > > Dietary restrictions: > > Additional comments: > > --------------------------------------------------------------- More information is available at https://urldefense.com/v3/__http://wiki.portal.chalmers.se/agda/pmwiki.php?n=Main.AIMXXXI__;!!IBzWLUs!XLKaP3B4boSk9UqxFHOGLgG8o3LkH8uqzP5ykxyol1WfL9xF22lXRm3-SiqUv7luDY7cYfMml2WRimmBe05RdvU5oZor-yGs$ Please spread the word about this meeting. Best regards, Orestis -------------- next part -------------- An HTML attachment was scrubbed... URL: From fredrik.nordvall-forsberg at strath.ac.uk Mon Oct 10 09:00:27 2022 From: fredrik.nordvall-forsberg at strath.ac.uk (Fredrik Nordvall Forsberg) Date: Mon, 10 Oct 2022 14:00:27 +0100 Subject: [TYPES/announce] Permanent Chancellor's Fellow positions at the University of Strathclyde (application deadline 23 Oct) Message-ID: <3117088e-3cbd-b7d3-f044-18dba76456c6@strath.ac.uk> Dear friends, The Department of Computer and Information Sciences at the University of Strathclyde, Glasgow, is currently advertising permanent positions at the Lecturer or Senior Lecturer level (Assistant and Associate Professor respectively in American English) with an initial five-year reduced teaching load: https://urldefense.com/v3/__https://www.jobs.ac.uk/job/CTO120/strathclyde-chancellors-fellow-in-computer-and-information-sciences-434447__;!!IBzWLUs!VDGQe1bypPIv4Y9gWu-egEdvM1aMUKWMD7vVyTLtm1RRXlaTWM6BicCKpJIp0OQ7oYP-OC4Dbv1AGi02HR_kg8QfWIUw00tjUANT5ibWlYd4dA$ The application deadline is *Sunday 23 October 2022*. You will see that the ad asks for expertise connected with Trusted AI and Data Analytics, but this should be understood broadly. In particular, we believe that type theory, category theory and logic are excellent technologies for establishing trust, and the Mathematically Structured Programming group welcomes applications from type theorists, dependently typed programmers, category theorists, and logicians; we would be happy to help you develop an application. Please contact Head of Department and fellow category theorist Neil Ghani if you are interested, or of course me or anyone else from the group if you have questions. (I'm employed as a Chancellor's Fellow, so would be happy to share my experience of this particular position.) You can find our group website at https://urldefense.com/v3/__http://msp.cis.strath.ac.uk/__;!!IBzWLUs!VDGQe1bypPIv4Y9gWu-egEdvM1aMUKWMD7vVyTLtm1RRXlaTWM6BicCKpJIp0OQ7oYP-OC4Dbv1AGi02HR_kg8QfWIUw00tjUANT5iZ2PMaNqg$ . For opportunities to join us at more senior levels (Reader and Professor), please contact Neil Ghani directly. We also have an opening for our next Head of Department! https://urldefense.com/v3/__https://www.jobs.ac.uk/job/CTN847/head-of-department-and-professor-in-computer-and-information-services-479106__;!!IBzWLUs!VDGQe1bypPIv4Y9gWu-egEdvM1aMUKWMD7vVyTLtm1RRXlaTWM6BicCKpJIp0OQ7oYP-OC4Dbv1AGi02HR_kg8QfWIUw00tjUANT5iZaRoK8aQ$ Best wishes, Fredrik From awodey at cmu.edu Tue Oct 11 09:02:42 2022 From: awodey at cmu.edu (Steve Awodey) Date: Tue, 11 Oct 2022 09:02:42 -0400 Subject: [TYPES/announce] Selected Papers of Dana S. Scott Message-ID: <970614B8-4D3F-4834-9AC6-8428D9C7CDEE@cmu.edu> In honor of Dana Scott?s 90th birthday, a Git repository containing pdf scans of a selection of his papers has been established. These are available for public download here: https://urldefense.com/v3/__https://github.com/CMU-HoTT/scott__;!!IBzWLUs!XaWRj-dEH0Teobl5ofqm2rgg5Vo3P3yRJ0WKp9JxlizscgFpggPp4DqRyKKg7cMnep6lTdd52JBl0Z1ZKeqqaUk8788dJg$ Additions and corrections by pull request are welcome. Happy Birthday Dana! Steve Awodey -------------- next part -------------- An HTML attachment was scrubbed... URL: From wjb at williamjbowman.com Tue Oct 11 15:42:24 2022 From: wjb at williamjbowman.com (William J. Bowman) Date: Tue, 11 Oct 2022 12:42:24 -0700 Subject: [TYPES/announce] PLDI 2023, Call for Workshops and Tutorials Message-ID: Please distribute widely: # Call for Workshops and Tutorials PLDI 2023 is a world-class forum for researchers and practitioners in programming language design and implementation. As in previous years, PLDI is soliciting proposals for co-located workshops and tutorials that will take place on **Saturday June 17th**, and **Sunday June 19th**. Please propose your workshop or tutorial via the submission system. The following details will be asked on submission: * Name of the workshop/tutorial. * Duration of the workshop/tutorial. * Organizers: names, affiliation, contact information, brief (100 words) biography. * A short description (150-200 words) of the topic. * Event format: workshop/tutorial; type of submissions, if any; review process; results dissemination. * Expected attendance and target audience within the PLDI community. * How you plan to foster an inclusive environment and promote a diverse attendance. * Information on any previous iterations of the workshop or tutorial. *Note:* Workshops must make their own acceptance decisions by **April 21, 2023** if there will be proceedings (final versions due **May 5, 2023**), or **May 5, 2023** if they do not have proceedings. ## Submission Submission site: https://urldefense.com/v3/__https://pldi23.sigplan.org/createProposal/56d4b837-caa0-487c-85b8-61f855c8aa4f__;!!IBzWLUs!WPjzXo8DZet5kKpvK7qyKpmmPYy4NSb3INt85rpf9OCTP4lEPo8dFEqBDHLqrjuIwApi4VGrv6a_ZeH7IDaaQ9COCa1iOdIT$ Workshops that would like their proceedings included in the ACM Digital Library must submit a proposal by **November 18, 2022**. Workshops and tutorials that will have no formal proceedings should submit a proposal by **November 30, 2022**. ## Review Proposals are reviewed by the Workshop and Tutorials Chairs, and if necessary, by the PLDI general chair. * Proposals will be evaluated according to the relevance of the topic, the expertise and experience of the workshop organizers, and their potential to attract participants. * Proposals submitted between November 18th and 30th will be evaluated on a first-come-first-served basis. ## Notification We will notify workshop/tutorial acceptance by **December 9th*. ## Timeline Submission deadline (with proceedings): **November 18** Submission deadline (no proceedings): **November 30** Notification: **December 9** ## Dissemination A proposal should clearly state how the results of the workshop ? i.e., published papers and other outcomes ? will be made available to participants and others before and after the workshop event. The Workshops and Tutorials Chair will provide guidance to the organizers of accepted workshops that wish to publish proceedings in the ACM Digital Library. For those that choose to publish their papers in ACM Digital Library, please add the following text in the workshop call for papers and on the website: *AUTHORS TAKE NOTE:* The official publication date is the date the proceedings are made available in the ACM Digital Library. This date may be up to two weeks prior to the first day of your conference. The official publication date affects the deadline for any patent filings related to published work. (For those rare conferences whose proceedings are published in the ACM Digital Library after the conference is over, the official publication date remains the first day of the conference.) Workshops that elect to publish proceedings can do so in the ACM Digital Library with sponsoring by SIGPLAN. The application for SIGPLAN sponsorship includes reviewing the proposed program committee with the SIGPLAN Executive Committee, a process which the chairs will help facilitate. ## Workshop Co-Chairs - Nadia Polikarpova, U. of California at San Diego - Zachary Tatlock, U. of Washington From liyao at pdx.edu Tue Oct 11 19:54:45 2022 From: liyao at pdx.edu (Yao Li) Date: Tue, 11 Oct 2022 16:54:45 -0700 Subject: [TYPES/announce] Ph.D. positions at Portland State University Message-ID: Dear All, I am looking for Ph.D students (starting Fall 2023) who are interested in programming languages, formal verification, and/or interactive theorem proving to join my new group at Portland State University. I am a new assistant professor at Portland State University. My research aims to (1) advance the state of the art of verification on real-world software and (2) make verification easier to use from a programming languages perspective. You can find more information about me on my webpage: https://urldefense.com/v3/__https://lastland.github.io/__;!!IBzWLUs!RmnpM28YuPb0EgFh19QfmEDvZT8OdLfFYtbAuRWuH85-JNu8y_lthl_RYm-s2Ui-FaP5Bn3K9obo3Dmaf4b6aJ2l4PWx$ Please feel free to drop me an email if you are interested or if you have any questions about my research, my group, or Portland State University. I'd appreciate it if you can help spread the word to whoever might be interested. Cheers, Yao Li, Ph.D., (He/Him) Assistant Professor, Computer Science Department, Portland State University -------------- next part -------------- An HTML attachment was scrubbed... URL: From jamie.vicary at cl.cam.ac.uk Wed Oct 12 04:32:47 2022 From: jamie.vicary at cl.cam.ac.uk (Jamie Vicary) Date: Wed, 12 Oct 2022 09:32:47 +0100 Subject: [TYPES/announce] Faculty position in Cambridge, closing date December 5 Message-ID: See message below from Neel Krishnaswami. ==================== Dear friends, We are hiring for several faculty position at the University of Cambridge. One of our target areas is logical foundations and formal methods. This is intended to be construed very broadly, to cover almost everyone working in programming languages, logic, semantics, proof assistants, and verification -- if you think your research area might be in scope, it almost certainly is! The deadline for applications is December 5, and the link to our advertisement is: https://urldefense.com/v3/__https://www.jobs.cam.ac.uk/job/37369/__;!!IBzWLUs!STfxwkhQtsjd6fldCw9DQd4J9mbU1karHwHm3rM72f2JCera8LHgRFUBLaeuukXwNmi2PN_LtBsAj0zval6x1l9vvZKyCxPhxZzitthVLg$ If you have any questions, please do feel free to contact me or the committee chair, Prof. Marcelo Fiore . Best, Neel -=-=-=-=-=- The Department of Computer Science and Technology is seeking to recruit a new faculty member at the Assistant or Associate Professor level who can contribute to research and teaching in the area of Logical Foundations and Formal Methods. The Computer Science department in Cambridge has a long history of research in logical foundations and formal methods, from groundbreaking work on higher-order logic and the proof assistant Isabelle, through to a wide range of important semantic frameworks, such as bigraphs, event structures, and nominal sets. Today logical foundations and formal methods is a thriving area of activity, which is explored with a wide variety of mathematical and logical tools, including category theory, domain theory, finite model theory, linear logic, operational semantics, proof assistants, and type theory. We seek to appoint a new member of faculty to complement and enhance our research in this area. The position is open to researchers working in the area of formal methods and logical foundations of computer science, broadly conceived. While no list of topics could be exhaustive, potential candidates might work in the areas of automata theory, automated deduction, categorical syntax and semantics, descriptive complexity, homotopy type theory, modal or temporal logic, rewriting, or type theory, as could researchers applying formal or logical tools in concurrency theory, databases, networks, programming languages, quantum computing and other emerging models of computation, or verification. The ideal candidate for this position will have a strong international track record of publication and impact commensurate with their research area and experience. They will have the ability, or potential, to secure research funding to support their research vision and build a world-class team of researchers. We welcome applications from researchers with interdisciplinary interests who will collaborate with people across different subdisciplines in Computer Science and Technology and with other academic disciplines. Collaborations outside academia are also highly-valued, including with industry and third-sector organizations. The University actively supports equality, diversity and inclusion and encourages applications from all sections of society. From ariola at cs.uoregon.edu Wed Oct 12 23:37:30 2022 From: ariola at cs.uoregon.edu (Zena Matilde Ariola) Date: Wed, 12 Oct 2022 20:37:30 -0700 Subject: [TYPES/announce] Faculty position in PL at the CS Dept of the University of Oregon Message-ID: The Computer Science Department at the University of Oregon invites applications for a tenure-track position as an Assistant Professor in Programming Languages to begin in fall 2023: https://urldefense.com/v3/__https://careers.uoregon.edu/en-us/job/529431/assistant-professor-of-computer-and-information-science__;!!IBzWLUs!WwDrEpDINM4z_FV-I82II0qwuDODd_OWUCdoaxFsdVi417_UTAkfm66OPgs7AhnlJlZ7kSSj3d3_CiuU95TrmEsD5Gx86yHh4Fk$ If you have any questions, please feel free to contact me at All the best, Zena From alley.stoughton at icloud.com Thu Oct 13 18:56:50 2022 From: alley.stoughton at icloud.com (Alley Stoughton) Date: Thu, 13 Oct 2022 18:56:50 -0400 Subject: [TYPES/announce] open faculty search (including PL) in computer science at Boston University Message-ID: The computer science department at Boston University has an open search this year for two assistant professor positions. We in the programming languages and verification group at BU would especially like to encourage applications from PL and verification researchers. For more information about the open positions and the CS department, please see the official advertisement: https://urldefense.com/v3/__https://bu.edu/cs/2022/10/04/bu-cs-invites-applications-for-new-faculty-members-2022/__;!!IBzWLUs!XNF5ZQ5CXEEp1jyvqqQn0E2T4kGlY6rzmWkHKVI4FZzZ659irX9C6GhC_9rCnSERNhV91sOt2Z5XymikL6iw7sKFMxPSYP9lg_SlTUPU$ ** Applications will begin to be reviewed on December 2, and will continue to be reviewed into the spring on a rolling basis. But for full consideration, applicants' letters of recommendation must be received by December 2. ** Information about the programming languages and verification group can be found at: https://urldefense.com/v3/__https://www.bu.edu/cs/research/popv/__;!!IBzWLUs!XNF5ZQ5CXEEp1jyvqqQn0E2T4kGlY6rzmWkHKVI4FZzZ659irX9C6GhC_9rCnSERNhV91sOt2Z5XymikL6iw7sKFMxPSYP9lg-Zggxiv$ Feel free to contact any of the faculty below with questions. Regards, Marco Gaboardi (gaboardi at bu.edu) Assaf Kfoury (kfoury at bu.edu) Alley Stoughton (stough at bu.edu) Hongwei Xi (hwxi at bu.edu) From kallas at seas.upenn.edu Fri Oct 14 12:07:24 2022 From: kallas at seas.upenn.edu (Konstantinos Kallas) Date: Fri, 14 Oct 2022 12:07:24 -0400 Subject: [TYPES/announce] POPL 23 -- Call for student volunteers Message-ID: POPL (https://urldefense.com/v3/__https://popl23.sigplan.org/__;!!IBzWLUs!U9VWyd1l4Kl0SMeRikndi9AkTfeMMNSRiWVohvrjFuUqrA2h0trV61IqYvpxBRIXb6NaXW-yvhj9pFgtB977iX96MuwiSZj_G6g$ ) is a leading forum for the discussion of all aspects of programming languages and programming systems, from theoretical to experimental aspects. In order to smoothly run the conference and associated workshops and tutorials, we need student volunteers to help out on the practical aspect of the organization. All the events associated with POPL ?23 will take place from Sun 15 to Sat 21 January 2023 in Boston, Massachusetts, USA. The student volunteer program is a chance for students from around the world to participate in the conferences whilst assisting us in preparing and running the events. In return, volunteers are granted free registration to the conferences, tutorials, workshops, and all associated events. As a POPL 2023 Student Volunteer, you will interact closely with researchers, academics and practitioners from various disciplines and meet other students from around the world. Job assignments for student volunteers include: assisting with technical sessions, workshops, tutorials and panels, checking badges at doors, operating the information desk, providing information about the conference to attendees, helping with traffic flow, and general assistance to keep the conference running smoothly. To be considered as a Student Volunteer for POPL, please fill in the application form: https://urldefense.com/v3/__https://forms.gle/nHJYCVbBuMCTz17s7__;!!IBzWLUs!U9VWyd1l4Kl0SMeRikndi9AkTfeMMNSRiWVohvrjFuUqrA2h0trV61IqYvpxBRIXb6NaXW-yvhj9pFgtB977iX96Muwiu6S2lqU$ There will be two rounds of calls: - deadline for first round: Nov 5th, 2022 AoE (notification: Nov 15) - deadline for second round: Dec 1st, 2022 AoE (notification: Dec 5th) Positive notifications given in the first round are firm, and the second round is only for spots not filled by the first round. If you have any questions, feel free to contact Shraddha Barke ( sbarke at eng.ucsd.edu) or Konstantinos Kallas (kallas at seas.upenn.edu). Best, Konstantinos -------------- next part -------------- An HTML attachment was scrubbed... URL: From ecb10 at st-andrews.ac.uk Fri Oct 14 07:14:44 2022 From: ecb10 at st-andrews.ac.uk (Edwin Brady) Date: Fri, 14 Oct 2022 11:14:44 +0000 Subject: [TYPES/announce] CFP for PEPM 2023 (Deadline extended) Message-ID: <5377D936-43EA-4DF4-B670-B38AE7A648F3@st-andrews.ac.uk> Dear all, (With apologies for any duplicate copies, and for the previous message which included the wrong date!). Please see the CFP for PEPM 2023 below. We have received some requests for extensions, and extended the deadline to next Tuesday. Note that short papers, including tool demos, works in progress and extended abstracts, are welcome too! Edwin and Jens -- CALL FOR PAPERS -- ACM SIGPLAN Workshop on PARTIAL EVALUATION AND PROGRAM MANIPULATION (PEPM) 2023 =============================================================================== * Website : https://urldefense.com/v3/__https://popl23.sigplan.org/home/pepm-2023__;!!IBzWLUs!S9Rgv6SnosI_QAj4r3tk4jslCTVp22fztdDPFQHMG-5rmIc33f-4Do_ArIkx3CUBOn_ze3hZVZQUP_8KdRyTdgblNLrj3cHwgQ4$ * Time : 16th--17th January 2023 * Place : Boston, Massachusetts, United States (co-located with POPL 2023) The ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation (PEPM) has a history going back to 1991 and has been co-located with POPL every year since 2006. It originated with the discoveries of useful automated techniques for evaluating programs with only partial input. Over the years, the scope of PEPM has expanded to include a variety of research areas centred around the theme of semantics-based program manipulation ? the systematic exploitation of treating programs not only as subjects to black-box execution but also as data structures that can be generated, analysed, and transformed while establishing or maintaining important semantic properties. Scope ----- In addition to the traditional PEPM topics (see below), PEPM 2023 welcomes submissions in new domains, in particular: * Semantics based and machine-learning based program synthesis and program optimisation. * Modelling, analysis, and transformation techniques for distributed and concurrent protocols and programs, such as session types, linear types, and contract specifications. More generally, topics of interest for PEPM 2023 include, but are not limited to: * Program and model manipulation techniques such as: supercompilation, partial evaluation, fusion, on-the-fly program adaptation, active libraries, program inversion, slicing, symbolic execution, refactoring, decompilation, and obfuscation. * Techniques that treat programs/models as data objects including metaprogramming, generative programming, embedded domain-specific languages, program synthesis by sketching and inductive programming, staged computation, and model-driven program generation and transformation. * Program analysis techniques that are used to drive program/model manipulation such as: abstract interpretation, termination checking, binding-time analysis, constraint solving, type systems, automated testing and test case generation. * Application of the above techniques including case studies of program manipulation in real-world (industrial, open-source) projects and software development processes, descriptions of robust tools capable of effectively handling realistic applications, benchmarking. Examples of application domains include legacy program understanding and transformation, DSL implementations, visual languages and end-user programming, scientific computing, middleware frameworks and infrastructure needed for distributed and web-based applications, embedded and resource-limited computation, and security. This list of categories is not exhaustive, and we encourage submissions describing new theories and applications related to semantics-based program manipulation in general. If you have a question as to whether a potential submission is within the scope of the workshop, please contact the programme co-chairs, Edwin Brady (ecb10 at st-andrews.ac.uk) and Jens Palsberg (palsberg at ucla.edu). Submission categories and guidelines ------------------------------------ Two kinds of submissions will be accepted: * Regular Research Papers should describe new results, and will be judged on originality, correctness, significance, and clarity. Regular research papers must not exceed 12 pages. * Short Papers may include tool demonstrations and presentations of exciting if not fully polished research, and of interesting academic, industrial, and open-source applications that are new or unfamiliar. Short papers must not exceed 6 pages. References and appendices are not included in page limits. Appendices may not be read by reviewers. Both kinds of submissions should be typeset using the two-column ?sigplan? sub-format of the new ?acmart? format available at: https://urldefense.com/v3/__http://sigplan.org/Resources/Author/__;!!IBzWLUs!S9Rgv6SnosI_QAj4r3tk4jslCTVp22fztdDPFQHMG-5rmIc33f-4Do_ArIkx3CUBOn_ze3hZVZQUP_8KdRyTdgblNLrjIp0dUNI$ and submitted electronically via HotCRP: https://urldefense.com/v3/__https://pepm23.hotcrp.com/__;!!IBzWLUs!S9Rgv6SnosI_QAj4r3tk4jslCTVp22fztdDPFQHMG-5rmIc33f-4Do_ArIkx3CUBOn_ze3hZVZQUP_8KdRyTdgblNLrjAeBbSIA$ Reviewing will be single-blind. Submissions are welcome from PC members (except the two co-chairs). Accepted regular research papers will appear in formal proceedings published by ACM, and be included in the ACM Digital Library. Accepted short papers do not constitute formal publications and will not appear in the proceedings. At least one author of each accepted contribution must attend the workshop (physically or virtually) and present the work. In the case of tool demonstration papers, a live demonstration of the described tool is expected. Important dates --------------- * Paper submission deadline (EXTENDED): **Tuesday 18th October 2022 (AoE)** * Author notification (EXTENDED) : **Tuesday 15th November 2022 (AoE)** * Workshop : **Monday 16th January 2023 to Tuesday 17th January 2023** Best paper award ---------------- PEPM 2023 continues the tradition of a Best Paper award. The winner will be announced at the workshop. Programme committee ------------------- * Chairs: Edwin Brady (University of St Andrews, UK) Jens Palsberg (University of California Los Angeles, USA) * Nada Amin Harvard (USA) * Adam Barwell (Imperial College London, UK) * Nicolas Biri (Input Output Global) * David Castro-Perez (University of Kent at Canterbury, UK) * Cristina David (University of Bristol, UK) * Atsushi Igarashi (Kyoto University, Japan) * Yukiyoshi Kameyama (University of Tsukuba, Japan) * Geoffrey Mainland (Drexel University, USA) * Hila Peleg (Technion Israel Institute of Technology, Israel) * Casper Bach Poulsen (Delft University of Technology, Netherlands) * Sukyoung Ryu (KAIST, Korea) * Sven-Bodo Scholz (Radboud University Nijmegen, Netherlands) * Ilya Sergey (National University of Singapore, Singapore) * Satnam Singh (Groq Inc, USA) * Elena Zucca (University of Genova, Italy) -------------- next part -------------- An HTML attachment was scrubbed... URL: From christine.tasson at lip6.fr Mon Oct 17 04:37:27 2022 From: christine.tasson at lip6.fr (Christine Tasson) Date: Mon, 17 Oct 2022 10:37:27 +0200 Subject: [TYPES/announce] LAFI 2023 - Final Call for Extended Abstracts (deadline Oct. 27) - POPL 2023 workshop on Languages for Inference Message-ID: ===================================================================== ?????????????????? Call for Extended Abstracts ??????????????????????????? LAFI 2023 ?????????? POPL 2023 workshop on Languages for Inference ????????????????????????? January 15, 2023 https://urldefense.com/v3/__https://popl23.sigplan.org/home/lafi-2023__;!!IBzWLUs!S5D0Jx1VLUXnVJ4CFCvt2g-tmyYT5f67T8C7s1cUAKE9pf_j33e7p6bANkHIDRjoPXfZlQrRWTOObXrAOkizCwq1uYN4I3FZeKNBPheoB-0$ ???????????? Submission deadline on October 27, 2022 -- EXTENDED! ==================================================================== ** Invited Speaker Hongseok Yang, professor at the School of Computing, KAIST, Korea ** Submission Summary Deadline: October 27, 2022 (AoE) -- EXTENDED Link: https://urldefense.com/v3/__https://lafi23.hotcrp.com/__;!!IBzWLUs!S5D0Jx1VLUXnVJ4CFCvt2g-tmyYT5f67T8C7s1cUAKE9pf_j33e7p6bANkHIDRjoPXfZlQrRWTOObXrAOkizCwq1uYN4I3FZeKNBp349rVE$ Format: extended abstract (2 pages + references) ** Call for Extended Abstracts Inference concerns re-calibrating program parameters based on observed data, and has gained wide traction in machine learning and data science. Inference can be driven by probabilistic analysis and simulation, and through back-propagation and differentiation. Languages for inference offer built-in support for expressing probabilistic models and inference methods as programs, to ease reasoning, use, and reuse. The recent rise of practical implementations as well as research activity in inference-based programming has renewed the need for semantics to help us share insights and innovations. This workshop aims to bring programming-language and machine-learning researchers together to advance all aspects of languages for inference. Topics include but are not limited to: - design of programming languages for inference and/or differentiable programming; - inference algorithms for probabilistic programming languages, including ones that incorporate automatic differentiation; - automatic differentiation algorithms for differentiable programming languages; - probabilistic generative modeling and inference; - variational and differential modeling and inference; - semantics (axiomatic, operational, denotational, games, etc) and types for inference and/or differentiable programming; - efficient and correct implementation; - and last but not least, applications of inference and/or differentiable programming. We expect this workshop to be informal, and our goal is to foster collaboration and establish common ground. Thus, the proceedings will not be a formal or archival publication, and we expect to spend only a portion of the workshop day on traditional research talks. Nevertheless, as a concrete basis for fruitful discussions, we call for extended abstracts describing specific and ideally ongoing work on probabilistic and differential programming languages, semantics, and systems. ** Submission guidelines - Submission deadline on October 27, 2022 (AoE) -- EXTENDED - Submission link: https://urldefense.com/v3/__https://lafi23.hotcrp.com/__;!!IBzWLUs!S5D0Jx1VLUXnVJ4CFCvt2g-tmyYT5f67T8C7s1cUAKE9pf_j33e7p6bANkHIDRjoPXfZlQrRWTOObXrAOkizCwq1uYN4I3FZeKNBp349rVE$ Anonymous extended abstracts are up to 2 pages in PDF format, excluding references. In line with the SIGPLAN Republication Policy, inclusion of extended abstracts in the program is not intended to preclude later formal publication. ** Remote participation policy Notice that we plan to coordinate with the POPL conference on remote participation. We would like to have remote participation even if the workshop happens in person. Our plan is to create an inclusive environment that does not demand traveling if not possible for any reason. From bahareh1812 at gmail.com Mon Oct 17 10:01:01 2022 From: bahareh1812 at gmail.com (Bahareh Afshari) Date: Mon, 17 Oct 2022 16:01:01 +0200 Subject: [TYPES/announce] Call for participation: The Proof Society Autumn School and Workshop, Utrecht 7-12 November 2022 Message-ID: <06CE47FF-B273-4F76-A58B-77AE940670C9@gmail.com> *Apologies for cross posting* The Proof Society Autumn School and Workshop, Utrecht 7-12 November 2022 https://urldefense.com/v3/__https://uswpt.sites.uu.nl__;!!IBzWLUs!Tu3zlkKywk9eODpLw3yPdN0nLRTsF5GMjOD2uo5BQIa7egIoghADQfDHTiNC6iOkC0kDX4RR2keUOPF6da8q5LG_ftRfuxYjsaU$ Important updates ========================== * Early registration extended to 19 October * accepted contributed talks available at https://urldefense.com/v3/__https://uswpt.sites.uu.nl/accepted-contributed-papers/__;!!IBzWLUs!Tu3zlkKywk9eODpLw3yPdN0nLRTsF5GMjOD2uo5BQIa7egIoghADQfDHTiNC6iOkC0kDX4RR2keUOPF6da8q5LG_ftRf1TDX9l4$ * Abstracts of tutorials and talks available at https://urldefense.com/v3/__https://uswpt.sites.uu.nl/programme/__;!!IBzWLUs!Tu3zlkKywk9eODpLw3yPdN0nLRTsF5GMjOD2uo5BQIa7egIoghADQfDHTiNC6iOkC0kDX4RR2keUOPF6da8q5LG_ftRflIzdxM4$ * student fee waivers deadline 28 October (see registration below) Scientific Programme ========================== The Autumn school will provide five three-hour long lectures. - Computational Content of Proofs by Ulrich Berger (Swansea University) - Proof-theoretic Semantics by Bogdan Dicher (University of Lisbon) - Labelled Sequent Calculi by Marianna Girlando (University of Amsterdam) - Proof Complexity by Raheleh Jalali (Utrecht University) - Proof Theory of Set Theory by Michael Rathjen (University of Leeds) Invited Workshop Lectures ========================== - Converse extensionality and apartness, Benno van den Berg (University of Amsterdam) - Herbrand meets cyclic proofs, Sebastian Enqvist (Stockholm University) - Proof-theoretic analysis of automated inductive theorem proving, Stefan Hetzl (TU Wien) - Reductio ad absurdum, Hajime Ishihara (Japan Advanced Institute of Science and Technology) - Explicit Mathematics Reloaded , Gerhard J?ger (University of Bern) - Modal logic and the polynomial hierarchy, Sonia Marin (University of Birmingham) Registration ========================== Late registration: 400 Standard: 300 (includes conference dinner) PhD students: 200 (includes conference dinner) Other students: 80 Please register via https://urldefense.com/v3/__https://uswpt.sites.uu.nl/registration/__;!!IBzWLUs!Tu3zlkKywk9eODpLw3yPdN0nLRTsF5GMjOD2uo5BQIa7egIoghADQfDHTiNC6iOkC0kDX4RR2keUOPF6da8q5LG_ftRfP5DjXIU$ We have limited funding for waiver/reduction of master and PhD student fees. Those interested should write a letter of motivation to b.afshari at uva.nl (Deadline 28 October) Programme Committee ========================== Bahareh Afshari, University of Amsterdam & University of Gothenburg (chair) Matthias Baaz, TU Wien Arnold Beckmann, Swansea University Lev Beklemishev, Steklov Mathematical Institute Balthasar Grabmayr, University of Haifa Rosalie Iemhoff, Utrecht University Joost Joosten, University of Barcelona Antonina Kolokolova, Memorial University of Newfoundland Norbert Preining, Mercari Inc. Andreas Weiermann, University of Ghent Local organising committee ========================== Bahareh Afshari, University of Amsterdam (co-chair) Saul Gebhardt, Utrecht University Sophie Glade, Utrecht University Menno Hellinga, Utrecht University Rosalie Iemhoff, Utrecht University (co-chair) Raheleh Jalali, Utrecht University Robin Martinot, Utrecht University Thierry Orth, Utrecht University Robert Passmann, University of Amsterdam Sponsors ========================== Association for Symbolic Logic Beth Foundation Department of Philosophy, Utrecht University Institute for Logic, Language and Computation, University of Amsterdam Kurt G?del Society From alcsc at dtu.dk Mon Oct 17 10:14:33 2022 From: alcsc at dtu.dk (Alceste Scalas) Date: Mon, 17 Oct 2022 16:14:33 +0200 Subject: [TYPES/announce] 2 PhD scholarships in Verification of Concurrent and Distributed Applications Message-ID: <24978014-0fef-dbd9-6943-6f8f69609e4c@dtu.dk> DTU - Technical University of Denmark DTU Compute - Section for Software Systems Engineering We are looking for two bright and motivated PhD student for two 3-year PhD positions. The main research topics of the two PhD positions are, respectively: (1) verifying that distributed applications respect correctness, safety and reliability specifications; and (2) verifying the privacy and security goals of distributed programs and their interaction. * Application deadline: 27 November 2022 * Expected starting date: 1 March 2023 (negotiable) * For inquiries, please contact: Alceste Scalas - https://urldefense.com/v3/__https://people.compute.dtu.dk/alcsc__;!!IBzWLUs!VhZ66-hlZK7jbEaLxGBwH01RLNQNqlsCqf-whFrcuI8BYboj58-FaFSwVbTwmoE6JuexhyVp6hXogsd2E142j6qECUTI$ Sebastian M?dersheim - https://urldefense.com/v3/__https://people.compute.dtu.dk/samo__;!!IBzWLUs!VhZ66-hlZK7jbEaLxGBwH01RLNQNqlsCqf-whFrcuI8BYboj58-FaFSwVbTwmoE6JuexhyVp6hXogsd2E142j-AxRgaq$ * Application link with complete details: https://urldefense.com/v3/__https://www.dtu.dk/english/about/job-and-career/vacant-positions/job?id=dd8bd8bc-8712-4883-981c-d91a1247f444__;!!IBzWLUs!VhZ66-hlZK7jbEaLxGBwH01RLNQNqlsCqf-whFrcuI8BYboj58-FaFSwVbTwmoE6JuexhyVp6hXogsd2E142j0gR8FJq$ By joining the project team, you will become part of an international research collaboration to advance the development of secure and reliable distributed applications. *PROJECT DESCRIPTION* The two positions are part of the upcoming Horizon Europe project TaRDIS (Trustworthy and Resilient Decentralised Intelligence for edge Systems). The project goal is to design and develop a novel, event-driven programming model and toolkit (with solid foundations based on formal methods) to help programmers in creating safe and reliable distributed applications. The focus lies on distributed applications with smart and autonomous components deployed across the cloud-edge continuum. Project TaRDIS is a collaboration between DTU, NOVA University Lisbon (Portugal, project coordinator), the University of Oxford (UK), the University of Novi Sad (Serbia), the National and Kapodistrian University of Athens (Greece), and 6 industry partners. *RESPONSIBILITIES AND QUALIFICATIONS* If you join this project, you will become a member of the DTU Compute research section on Software Systems Engineering, which involves researchers in various areas of software specification, verification, engineering, and security --- with a strong emphasis on formal methods. 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 academic collaborators' universities. Links: * https://urldefense.com/v3/__https://www.compute.dtu.dk/english/research/research-sections/software-systems-engineering__;!!IBzWLUs!VhZ66-hlZK7jbEaLxGBwH01RLNQNqlsCqf-whFrcuI8BYboj58-FaFSwVbTwmoE6JuexhyVp6hXogsd2E142j4nghyZo$ * https://urldefense.com/v3/__https://www.compute.dtu.dk/english/phd__;!!IBzWLUs!VhZ66-hlZK7jbEaLxGBwH01RLNQNqlsCqf-whFrcuI8BYboj58-FaFSwVbTwmoE6JuexhyVp6hXogsd2E142jws0Dh4X$ Your main tasks within this project will be: * become familiar with relevant state-of-the-art research in formal methods for modelling and verifying distributed applications --- with a focus on either (1) verification of correctness, safety and reliability, or (2) modelling and verification of privacy and security properties; * study the project?s industrial use cases; * explore new methods to ensure the correctness of distributed applications. You will help in developing the necessary theory and implementing new software tools based on such theory. You will also have the opportunity to co-supervise MSc or BSc student projects related to your research. To be considered for the position, you need some experience with formal methods for programming languages, or distributed systems, or security. 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 good programming skills ? preferably including functional programming, and some experience in developing distributed applications. To begin the PhD position, 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 can apply prior to obtaining the degree, providing the expected graduation date. *ASSESSMENT AND FURTHER DETAILS* The assessment of the applicants will take place in early December 2022. For the application details, see: https://urldefense.com/v3/__https://www.dtu.dk/english/about/job-and-career/vacant-positions/job?id=dd8bd8bc-8712-4883-981c-d91a1247f444__;!!IBzWLUs!VhZ66-hlZK7jbEaLxGBwH01RLNQNqlsCqf-whFrcuI8BYboj58-FaFSwVbTwmoE6JuexhyVp6hXogsd2E142j0gR8FJq$ For further information and inquiries, please contact: * Alceste Scalas * Sebastian M?dersheim You can read more about DTU Compute at: https://urldefense.com/v3/__https://www.compute.dtu.dk/english__;!!IBzWLUs!VhZ66-hlZK7jbEaLxGBwH01RLNQNqlsCqf-whFrcuI8BYboj58-FaFSwVbTwmoE6JuexhyVp6hXogsd2E142j0KtBjqI$ 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!VhZ66-hlZK7jbEaLxGBwH01RLNQNqlsCqf-whFrcuI8BYboj58-FaFSwVbTwmoE6JuexhyVp6hXogsd2E142j4nghyZo$ 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!VhZ66-hlZK7jbEaLxGBwH01RLNQNqlsCqf-whFrcuI8BYboj58-FaFSwVbTwmoE6JuexhyVp6hXogsd2E142j23dWm1T$ -- Alceste Scalas - https://urldefense.com/v3/__https://people.compute.dtu.dk/alcsc__;!!IBzWLUs!VhZ66-hlZK7jbEaLxGBwH01RLNQNqlsCqf-whFrcuI8BYboj58-FaFSwVbTwmoE6JuexhyVp6hXogsd2E142j6qECUTI$ Associate Professor @ DTU Compute - Section for Software Systems Engineering Technical University of Denmark Building 321, Room 010 2800 Kgs. Lyngby From kirstin.peters at uni-a.de Tue Oct 18 03:50:12 2022 From: kirstin.peters at uni-a.de (Kirstin Peters) Date: Tue, 18 Oct 2022 09:50:12 +0200 Subject: [TYPES/announce] PhD position in modelling languages for concurrent systems In-Reply-To: <80aa7b06-13ca-49ef-f059-82b85e438c9d@uni-a.de> References: <80aa7b06-13ca-49ef-f059-82b85e438c9d@uni-a.de> Message-ID: <412d57e4-c1c0-9800-324f-0b7b91337c5a@uni-a.de> Hi, we are looking for a PhD student to work on modelling languages for concurrent systems at the University of Augsburg in Germany. The position includes teaching duties but German language skills are not mandatory. Though a willingness to learn German is expected. Deadline for applications is October 31. For more information please have a look at https://urldefense.com/v3/__https://www.uni-augsburg.de/en/fakultaet/fai/informatik/prof/swtti/forschung/offene-forschungsstellen/__;!!IBzWLUs!QF2bL7qnMREgrqNeBqGdKBSKK0rU6BGCviPdE9XmhgC4VYgOFqiNctzy5H1tH5iAbIeIOujJrzu0sqPpUJ-CQ_sSj2SETX7Zj2gN3R2w$ or send an e-mail to kirstin.peters at uni-a.de. Best wishes, Kirstin Peters From botocudo at gmail.com Tue Oct 18 08:37:59 2022 From: botocudo at gmail.com (Joao Marcos) Date: Tue, 18 Oct 2022 09:37:59 -0300 Subject: [TYPES/announce] Final CFP: Proceedings for ThEdu'22 Message-ID: 2nd Open Call for Papers ************************************************************************** Proceedings for ThEdu'22 Theorem Proving Components for Educational Software https://urldefense.com/v3/__http://www.uc.pt/en/congressos/thedu/thedu22__;!!IBzWLUs!Ta6DcalxpYdHO--no9bMeeDDe_c03Fc0T21Bi2FsbyXc75w2X9R2q4gqJrqkQOpNGOd8lLMDc72kwiBLrxqxBpllaDonYrQ$ ************************************************************************** to be published by EPTCS, Electronic Proceedings in Theoretical Computer Science https://urldefense.com/v3/__http://published.eptcs.org__;!!IBzWLUs!Ta6DcalxpYdHO--no9bMeeDDe_c03Fc0T21Bi2FsbyXc75w2X9R2q4gqJrqkQOpNGOd8lLMDc72kwiBLrxqxBpll6ds7a0A$ ************************************************************************** Synopsis The workshop ThEdu'22 happened on Aug 11, 2022, as a satellite event of FLoC 2022, as a very lively meeting. The programme was comprised of two invited talks, by Yoni Zohar, from Bar Ilan University, and by Thierry Dana-Picard, from the Jerusalem College of Technology, as well as four regular contributions (with one remote presentation), whose abstracts, presentations and videos may be found in the workshop's webpage. Now the proceedings are being planned, intending to collect full versions of the contributed papers, as well as new contributions. The contributions' range of topics is diverse, according to ThEdu's scope, and this is a call for papers, open to everyone, also those who did not participate in the workshop. All papers will undergo reviewing according to the EPTCS standards. 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. This volume of EPTCS intends to bring together experts in automated deduction with experts in education in order to further clarify the shape of the new software generation and to discuss existing systems. Topics of interest include: * methods of automated deduction applied to checking students' input; * methods of automated deduction applied to prove post-conditions for particular problem solutions; * combinations of deduction and computation enabling systems to propose next steps; * automated provers specific for dynamic geometry systems; * proof and proving in mathematics education. Important Dates * Submission (Full Papers): 7 November 2022 * Notification of acceptance: 12 December 2022 * Revised papers due: 9 January 2023 Submission We welcome submission of full papers (12--20 pages) presenting original unpublished work which is not being submitted for publication elsewhere. All contributions will be reviewed (at least three blind reviews) to meet the high standards of EPTCS. The authors should comply with the "instructions for authors", LaTeX style files and accept the "Non-exclusive license to distribute" of EPTCS: Instructions for authors (https://urldefense.com/v3/__http://info.eptcs.org/__;!!IBzWLUs!Ta6DcalxpYdHO--no9bMeeDDe_c03Fc0T21Bi2FsbyXc75w2X9R2q4gqJrqkQOpNGOd8lLMDc72kwiBLrxqxBpllr6tkaKw$ ), LaTeX style file and formatting instructions (https://urldefense.com/v3/__http://style.eptcs.org/__;!!IBzWLUs!Ta6DcalxpYdHO--no9bMeeDDe_c03Fc0T21Bi2FsbyXc75w2X9R2q4gqJrqkQOpNGOd8lLMDc72kwiBLrxqxBpllUW2MTP0$ ) as well as (https://urldefense.com/v3/__http://copyright.eptcs.org/__;!!IBzWLUs!Ta6DcalxpYdHO--no9bMeeDDe_c03Fc0T21Bi2FsbyXc75w2X9R2q4gqJrqkQOpNGOd8lLMDc72kwiBLrxqxBpll3tuW7b0$ ) Papers should be submitted via EasyChair, https://urldefense.com/v3/__https://easychair.org/conferences/?conf=thedu22__;!!IBzWLUs!Ta6DcalxpYdHO--no9bMeeDDe_c03Fc0T21Bi2FsbyXc75w2X9R2q4gqJrqkQOpNGOd8lLMDc72kwiBLrxqxBpllmecyE1I$ . Program Committee Francisco Botana, University of Vigo at Pontevedra, Spain David Cerna, Johannes Kepler University, Austria Jo?o Marcos, Universidade Federal do Rio Grande do Norte, Brazil (editor) Filip Maric, University of Belgrade, Serbia Adolfo Neto, Universidade Tecnol?gica Federal do Paran?, Brazil Walther Neuper, Johannes Kepler University Linz, Austria (editor) Pedro Quaresma, University of Coimbra, Portugal (editor) Giselle Reis, Carnegie Mellon University Qatar, Qatar 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 From zhoulai.fu at gmail.com Tue Oct 18 21:34:17 2022 From: zhoulai.fu at gmail.com (Zhoulai Fu) Date: Wed, 19 Oct 2022 10:34:17 +0900 Subject: [TYPES/announce] Assistant/Associate/Full Professor and Teaching Professor Positions @ State University of New York (SUNY), Korea Message-ID: State University of New York, Korea Assistant/Associate/Full Professor and Teaching Professor Positions The Computer Science Department of State University of New York (SUNY), Korea (https://urldefense.com/v3/__https://cs.sunykorea.ac.kr/cs/__;!!IBzWLUs!TlotxJLlELYND9fWIJPlU__KA0f5zTNiv3esumefTYcolBTVjCBGH7Lh-DkfOnyAkZkBwkM7ouxjW2jhNnqVUmQ8EvNkcKbIvQ$ ) invites applications for tenure-track and teaching-track positions to start in Fall 2023 or Spring 2023. *(A) Tenure-Track Faculty Position:* We seek an excellent faculty member at all levels in computer science. The position is tenured or tenure-track at SUNY Korea. It also carries an affiliated faculty position with the Computer Science Department at Stony Brook University ? State University of New York (SUNY), Stony Brook, NY (https://urldefense.com/v3/__https://www.cs.stonybrook.edu/__;!!IBzWLUs!TlotxJLlELYND9fWIJPlU__KA0f5zTNiv3esumefTYcolBTVjCBGH7Lh-DkfOnyAkZkBwkM7ouxjW2jhNnqVUmQ8EvOb6k9s-A$ ). Applicants should hold a PhD in Computer Science or a closely related field and exhibit a strong commitment to research and teaching. *(B) Teaching-Track Faculty Position:* We also seek an excellent full-time teaching faculty. The candidate will teach introductory and advanced CS undergraduate and possibly graduate courses. An excellent candidate can be converted into tenure-track at SUNY Korea later. Engaging in research is encouraged but not mandatory. Applicants should hold a PhD or MS in Computer Science or a closely related field and strongly commit to teaching. The SUNY Korea CS department offers BS (ABET accredited), MS, and PhD degree programs that are tightly integrated with the highly ranked CS department at Stony Brook University, New York. The academic degrees awarded at SUNY Korea are identical to those of Stony Brook University. The language at SUNY Korea is English. SUNY Korea (https://urldefense.com/v3/__https://www.sunykorea.ac.kr/en/__;!!IBzWLUs!TlotxJLlELYND9fWIJPlU__KA0f5zTNiv3esumefTYcolBTVjCBGH7Lh-DkfOnyAkZkBwkM7ouxjW2jhNnqVUmQ8EvOCeifmmA$ ) is located in the new master-planned city of Songdo, Korea, hosting both global organizations and multinational corporations. Incheon international airport is just 25 minutes away, and Seoul, with its fascinating blend of Asian cultures, is less than 1 hour away. More information about the positions and application instructions can be found at https://urldefense.com/v3/__https://cs.sunykorea.ac.kr/cs/html/sub01/0106.html__;!!IBzWLUs!TlotxJLlELYND9fWIJPlU__KA0f5zTNiv3esumefTYcolBTVjCBGH7Lh-DkfOnyAkZkBwkM7ouxjW2jhNnqVUmQ8EvOEQV-XYw$ . Review of applications will start immediately and continue until the positions are filled. We value diversity and seek candidates who can contribute to a welcoming climate for all students. We strongly encourage applications from women and underrepresented groups. Regards, - Zhoulai -------------------------------------------------------- Zhoulai Fu, PhD Assistant Professor of Computer Science State University of New York (SUNY), Korea https://urldefense.com/v3/__http://www.zhoulaifu.com__;!!IBzWLUs!TlotxJLlELYND9fWIJPlU__KA0f5zTNiv3esumefTYcolBTVjCBGH7Lh-DkfOnyAkZkBwkM7ouxjW2jhNnqVUmQ8EvP2I8lrYQ$ -------------------------------------------------------- -------------- next part -------------- An HTML attachment was scrubbed... URL: From catalin.hritcu at gmail.com Wed Oct 19 10:52:42 2022 From: catalin.hritcu at gmail.com (Catalin Hritcu) Date: Wed, 19 Oct 2022 16:52:42 +0200 Subject: [TYPES/announce] Research opportunities (internships, PhD positions, summer school) at Max Planck Institutes in Computer Science Message-ID: Hello everyone, The Max Planck Institutes (MPIs) in Computer Science have several research opportunities for strong students. Please help spread the word about them: - Summer internships. *Deadline: 1st November 2022.* https://urldefense.com/v3/__https://www.cis.mpg.de/internships/__;!!IBzWLUs!V_lwwYzaOEIIGpqkzL1Rj7cU5gesbSK4R41gjl2oh23nrTRCzl2eqaHTP0ftj1JUiA4mTeabmhVx4TtsIk9sOBLgVp6wZbrPZXmC3fg$ - Several PhD programs. Deadlines are announced on https://urldefense.com/v3/__https://www.cis.mpg.de/graduate-programs__;!!IBzWLUs!V_lwwYzaOEIIGpqkzL1Rj7cU5gesbSK4R41gjl2oh23nrTRCzl2eqaHTP0ftj1JUiA4mTeabmhVx4TtsIk9sOBLgVp6wZbrPhZDrDRo$ (*31st December 2022 for CS at Max Planck * and IMPRS-TRUST). - CMMRS, a 1-week on-site summer school to expose undergraduate and Master's students to research. Deadline in January/February (TBA). Details will be posted on https://urldefense.com/v3/__https://cmmrs.mpi-sws.org__;!!IBzWLUs!V_lwwYzaOEIIGpqkzL1Rj7cU5gesbSK4R41gjl2oh23nrTRCzl2eqaHTP0ftj1JUiA4mTeabmhVx4TtsIk9sOBLgVp6wZbrPS8bI7Mw$ About the MPIs: The participating institutes are part of a network of over 80 Max Planck Institutes, Germany?s premier basic-research organisations. MPIs have an established record of world-class, foundational research in the sciences, technology, and the humanities. They offer a unique environment that combines the best aspects of a university department and a research laboratory. All the programs listed above are highly selective, and the participating institutes use English as their working language. Kind regards, Catalin -------------- next part -------------- An HTML attachment was scrubbed... URL: From raffi.khatchadourian at hunter.cuny.edu Thu Oct 20 13:18:40 2022 From: raffi.khatchadourian at hunter.cuny.edu (Raffi T Khatchadourian) Date: Thu, 20 Oct 2022 17:18:40 +0000 Subject: [TYPES/announce] Fully-funded Ph.D. position(s) in analysis and transformations of Deep Learning programs in New York City (deadline Dec 15) Message-ID: <37ab9c2e1da8eccdbf1b68ea38e48989945c3b97.camel@hunter.cuny.edu> Fully-funded Ph.D. student position(s) in analysis and transformations of Deep Learning programs in New York City (Deadline Dec 15) I am currently seeking (potentially multiple, fully-funded) Ph.D. students interested in programming languages and software engineering research for an NSF-funded project on analysis and transformations for (imperative) Deep Learning (DL) programs. The project?based in the heart of New York City?focuses on enhancing the robustness, increasing run-time performance, and facilitating the long-lived evolution of DL systems, particularly, large, industrial DL systems. Potential research topics explored during the course of the project may include (static/dynamic) program analysis and transformation (e.g., automated refactoring) and empirical software engineering. Successful candidates will be expected to work on projects that generally yield open-source developer tool research prototypes, plug-ins to popular IDEs, build systems, or static analyzers. Applicants may find additional information?on the?PI's web page. They should also apply to the City University of New York (CUNY) Graduate Center (GC) Ph.D. program in Computer Science (deadline?December 15) following a discussion with the PI. Interested students may refer to the post on the PI's website (https://urldefense.com/v3/__https://bit.ly/3yTuI5a__;!!IBzWLUs!Xbtvho2zkfZgEDGrYJB3XMSxyRUmVD7UqNucN3mpQ_05FxkFXlEfXy7nJJ8nrIoJCzNxjRd8u4ujLlujATXb8QA2oMPk-DeJtUnH5LwEn9uLYSXKBg$ ). Interested students are encouraged to complete the form at the bottom of the post. -- Raffi Khatchadourian Assistant Professor, Computer Science, Hunter College Doctoral Faculty of the Graduate School and University Center's Ph.D. Program in Computer Science City University of New York (CUNY) https://urldefense.com/v3/__http://cs.hunter.cuny.edu/*Raffi.Khatchadourian99__;fg!!IBzWLUs!Xbtvho2zkfZgEDGrYJB3XMSxyRUmVD7UqNucN3mpQ_05FxkFXlEfXy7nJJ8nrIoJCzNxjRd8u4ujLlujATXb8QA2oMPk-DeJtUnH5LwEn9vjwiVpVw$ From Luigia.Petre at abo.fi Fri Oct 21 06:59:36 2022 From: Luigia.Petre at abo.fi (Luigia Petre) Date: Fri, 21 Oct 2022 10:59:36 +0000 Subject: [TYPES/announce] Formal Methods Teaching Tutorial on Frama-C: Dr Allan Blanchard on Friday, October 28, at 3pm CET Message-ID: Dear all, The Formal Methods Teaching tutorials series continues on the last Friday of October with a lecture on Frama-C! Dr Allan Blanchard (CEA-LIST, France) will lecture on Friday October 28, 2022, at 3 pm CEST with a talk entitled "Formal methods for beginners and for C programs - Using Frama-C and its WP plug-in for teaching". More information about our lecturer can be found here: https://urldefense.com/v3/__https://allan-blanchard.fr__;!!IBzWLUs!RUDea8U04J2QnYW49wzQMx89ysGliJmNqknoQvoMoqEQkXfVNxsIaU_tPQ1Vvd_MoVmzEDLguy6iYiPLATd0Bn98FP7rFjMSlqFZ$ . The zoom link for Allan's lecture is https://aboakademi.zoom.us/j/64254430116. The event will last about an hour. Warmly welcome!! Best wishes, Luigia PS: the tutorial series webpage is here: https://urldefense.com/v3/__https://fme-teaching.github.io/2021/08/24/tutorial-series-of-the-fme-teaching-committee/__;!!IBzWLUs!RUDea8U04J2QnYW49wzQMx89ysGliJmNqknoQvoMoqEQkXfVNxsIaU_tPQ1Vvd_MoVmzEDLguy6iYiPLATd0Bn98FP7rFmylpkd8$ . __ Luigia Petre, Docent, PhD Faculty of Science and Engineering ?bo Akademi University, Finland https://urldefense.com/v3/__http://www.users.abo.fi/lpetre__;!!IBzWLUs!RUDea8U04J2QnYW49wzQMx89ysGliJmNqknoQvoMoqEQkXfVNxsIaU_tPQ1Vvd_MoVmzEDLguy6iYiPLATd0Bn98FP7rFlF_u6Wv$ -------------- next part -------------- An HTML attachment was scrubbed... URL: From elenam at morris.umn.edu Fri Oct 21 10:27:34 2022 From: elenam at morris.umn.edu (Elena Machkasova) Date: Fri, 21 Oct 2022 09:27:34 -0500 Subject: [TYPES/announce] TFPIE 2023 call for submissions (deadline Dec 27th) Message-ID: Please consider submitting and spread the word! TFPIE 2023 Call for papers https://urldefense.com/v3/__https://wiki.tfpie.science.ru.nl/TFPIE2023__;!!IBzWLUs!W_aqvyrn_i5Eg-MbItqImeN3Ljof6y8Q3Rw2qdk8I_DOs8pIaPPyr3HRStMCn5lWIEgbV4W1HPp6Zi7PrKwQwXDvt4V3Yz1nXkY$ (January 12th 2023, Boston, MA, USA, co-located with TFP 2023 and POPL 2023) TFPIE 2023 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=tfpie2023__;!!IBzWLUs!W_aqvyrn_i5Eg-MbItqImeN3Ljof6y8Q3Rw2qdk8I_DOs8pIaPPyr3HRStMCn5lWIEgbV4W1HPp6Zi7PrKwQwXDvt4V3R5dTjyM$ After the workshop, presenters are invited to submit (a revised version of) their article for the formal review. The PC will select the best articles for publication in the Electronic Proceedings in Theoretical Computer Science (EPTCS). Articles rejected for presentation and extended abstracts will not be formally reviewed by the PC. Important Dates Submission deadline: December 27th 2022, Anywhere on Earth. Notification: December 30th 2022 (Note: earlier submissions will receive earlier response) TFPIE Registration Deadline: TBA Workshop: January 12th 2023 Submission for formal review: April 19th 2023, Anywhere on Earth. Notification of full article: May 24th 2023 Camera ready: July 1st 2023 Program Committee Christopher Anand - McMaster University, Canada Attila Egri-Nagy - Akita International University, Japan Jason Hemann - Seton Hall University, USA Kevin Kappelmann - Technical University of Munich, Germany Elena Machkasova (Chair) - University of Minnesota Morris, USA Kristina Sojakova - INRIA, France J?rgen Villadsen - Technical University of Denmark, Denmark Registration information See https://urldefense.com/v3/__https://wiki.tfpie.science.ru.nl/TFPIE2023__;!!IBzWLUs!W_aqvyrn_i5Eg-MbItqImeN3Ljof6y8Q3Rw2qdk8I_DOs8pIaPPyr3HRStMCn5lWIEgbV4W1HPp6Zi7PrKwQwXDvt4V3Yz1nXkY$ for updated information. Registration and attendance are mandatory for at least one author of every paper that is presented at the workshop. Presenters will have their registration fee waived. Only papers that have been presented at TFPIE may be submitted to the post-reviewing process. Best regards, Elena Machkasova (program committee chair) -- 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!W_aqvyrn_i5Eg-MbItqImeN3Ljof6y8Q3Rw2qdk8I_DOs8pIaPPyr3HRStMCn5lWIEgbV4W1HPp6Zi7PrKwQwXDvt4V3DnVIRxc$ Pronouns: she/her/hers or any other -------------- next part -------------- An HTML attachment was scrubbed... URL: From bcpierce at cis.upenn.edu Fri Oct 21 19:41:20 2022 From: bcpierce at cis.upenn.edu (Benjamin Pierce) Date: Fri, 21 Oct 2022 19:41:20 -0400 Subject: [TYPES/announce] CoqPL 2023, extended submission deadline (Oct 31) Message-ID: CoqPL 2023 9th International Workshop on Coq for Programming Languages January 21, 2023, co-located with POPL Boston, Massachusetts, USA CALL FOR PRESENTATIONS Deadline: Oct 31, 2022, AOE Workshop Overview The series of CoqPL workshops provide an opportunity for programming languages researchers and practitioners with an interest in Coq to meet and interact with one another and members from the core Coq development team. At the meeting, we will discuss upcoming new features, see talks and demonstrations of exciting current projects, solicit feedback for potential future changes to Coq itself, and generally work to strengthen the vibrant community around our favorite proof assistant. Topics in scope include: - Formalizations of PL research in Coq - General purpose libraries and tactic language extensions - Domain-specific libraries for programming language formalization and verification - IDEs, profilers, tracers, debuggers, and testing tools - Reports on ongoing proof efforts conducted via (or in the context of) the Coq proof assistant - Experience reports from Coq usage in educational or industrial contexts Workshop Format The workshop format will be driven by you, members of the community. We will solicit abstracts for talks and proposals for demonstrations and flesh out format details based on responses. We expect the final program to include experiment reports, panel discussions, and invited talks (details TBA). Talks will be selected according to relevance to the workshop, based on the submission of an extended abstract. To foster open discussion of cutting edge research which can later be published in full conference proceedings, we will not publish papers from the workshop. However, presentations may be recorded and the videos may be made publicly available. Submission Details Submission page can be found here Important Dates: - Submission: Monday, October 31, 2022 - Notification: Thursday, November 17, 2022 - Workshop: Saturday, January 21, 2023 Submissions for talks and demonstrations should be described in an extended abstract, between 1 and 2 pages in length (excluding bibliography). We suggest formatting the text using the two-column ACM SIGPLAN latex style (9pt font). Templates are available from the ACM SIGPLAN page . Program Committee Co-chairs: - Tej Chajed, VMware Research and University of Wisconsin, USA - Benjamin Pierce, University of Pennsylvania, USA Program Committee: - Danil Annenkov, Aarhus University, Denmark - Qinxiang Cao, Shanghai Jiao Tong University, China - Tej Chajed, VMware Research and University of Wisconsin, USA - Maxime Denes, INRIA, France - Hugo Herbelin, INRIA, France - Benjamin C. Pierce, University of Pennsylvania, USA - Clement Pit-Claudel, EPFL, Switzerland - Talia Ringer, University of Illinois, USA - Christine Rizkallah, University of Melbourne, Australia - Zoe Paraskevopoulou, Northeastern University, USA Covid / Remote Participation Plans We will follow the same protocol for virtual / hybrid attendance as POPL 2023 as a whole. -------------- next part -------------- An HTML attachment was scrubbed... URL: From zhoulai.fu at gmail.com Sun Oct 23 08:41:09 2022 From: zhoulai.fu at gmail.com (Zhoulai Fu) Date: Sun, 23 Oct 2022 21:41:09 +0900 Subject: [TYPES/announce] Funded PhD positions in Computer Science at State University of New York, Korea Message-ID: We are seeking outstanding PhD candidates in Computer Science. Main research interests are in Programming Languages, Machine Learning, and their intersection. Highly qualified candidates are encouraged to apply for whatever subjects in CS, in particular, Software Engineering, Security, High-Performance Computing, Data Science, Artificial Intelligence, etc. State University of New York (SUNY), Korea, is a young American university in South Korea, which is set to experience considerable growth in the next few years. PhD students in CS will follow the same education curriculum as Stony Brook University, New York (https://urldefense.com/v3/__https://www.stonybrook.edu/__;!!IBzWLUs!UnX0YSaobm1aDEBECNO-XN3qJ5kD3tic6fjGlwHlvYJtFjJ2tCG_rnGvX7VEXV_yBvPdriWRg2bW_usObLmDndsLeeFVkMzU9w$ ) and receive the same US degree. For details on our PhD program, please refer to the following Handbook: https://urldefense.com/v3/__https://www.cs.stonybrook.edu/sites/default/files/drupalfiles/basicpage/graduate-handbook.pdf__;!!IBzWLUs!UnX0YSaobm1aDEBECNO-XN3qJ5kD3tic6fjGlwHlvYJtFjJ2tCG_rnGvX7VEXV_yBvPdriWRg2bW_usObLmDndsLeeHmtjnJvw$ . Highlights for the PhD opportunity include the following: - PhD degree offered by Stony Brook University, New York, with a vibrant, English-speaking Korean campus (41% international faculty). - One-year visit to our campus in New York, during which the PhD candidate collaborates with a US faculty and a Korean advisor. - Competitive compensation (commensurate with experience). - Convenient life facilities: In-campus dorms; Shopping malls across the street; Gym, swimming pool, IT Center and Health Center all integrated in the campus; National Health Insurance of Korea. - High-performance GPU lab The positions will be available until filled. Applicants should be strongly motivated and have an excellent academic record in CS or related subjects. Interested candidates should contact Prof. ByungKon Kang < byungkon.kang at sunykorea.ac.kr> and Prof. Zhoulai Fu < zhoulai.fu at sunykorea.ac.kr> with a CV or for any questions. Regards, Zhoulai -------------------------------------------------------- Zhoulai Fu, PhD in Computer Science State University of New York (SUNY), Korea https://urldefense.com/v3/__http://www.zhoulaifu.com__;!!IBzWLUs!UnX0YSaobm1aDEBECNO-XN3qJ5kD3tic6fjGlwHlvYJtFjJ2tCG_rnGvX7VEXV_yBvPdriWRg2bW_usObLmDndsLeeHaUnpYdA$ -------------------------------------------------------- -------------- next part -------------- An HTML attachment was scrubbed... URL: From paolo.pistone at uniroma3.it Mon Oct 24 04:37:55 2022 From: paolo.pistone at uniroma3.it (Paolo Pistone) Date: Mon, 24 Oct 2022 08:37:55 +0000 Subject: [TYPES/announce] CfPart: FoPSS 2023 (February 2023, Bertinoro, Italy) Message-ID: *Apologies for cross postings* Call For Participation: 4th edition of the School on Foundations of Programming and Software Systems (FoPSS 2023) February 13-17, 2023, Bertinoro, Italy. https://urldefense.com/v3/__https://site.unibo.it/fopss2023/en__;!!IBzWLUs!VDoGhQwA5AM22LGoVYaEy91B8jA8bXIdYdlolLDugnt0-ICH_5qyS7tAYK8Mw3dGoBA-52OFqtewtCPla4g0WK9rWgwNoTsUSiuFZ2SScQ$ We are very pleased to announce the 4th edition of the School on Foundations of Programming and Software Systems, to be held in Bertinoro on February 13-17, 2023. This will be the first edition of the school after the beginning of the COVID pandemic. The previous editions of the school took place in Porto [1], Oxford [2], and Warsaw [3]. The school is oriented to Master and PhD students, and to young scholars. It will be held at CEUB [4], which can be reached from Bologna in about 90 minutes. (We are considering, depending on the number of participants, to organize bus transfers to and from Bologna Airport on February 12 and 18, 2023). The main theme of this edition of FoPSS are the quantitative aspects of program semantics, verification, and transformation. The following researchers have accepted to give short courses or seminars as part of the school: Deepak Garg (MPI-SWS), on "Resource Analysis Using Types" Marco Gaboardi (Boston University), on "Relational Reasoning for Security and Privacy" Benjamin Kaminski (Saarland University), on "Quantitative Verification, Transformer-style" Delia Kesner (Universit? de Paris), on "Quantitative Types for Higher-Order Programming Languages" Aleks Kissinger (Oxford), on "Picturing Quantum Software" Damiano Mazza (CNRS), on "Introduction to Differentiable Programming" Prakash Panangaden (McGill), on "Bisimulation Metrics and Variations with Applications to Representation Learning" Christin Tasson (Sorbonne Universit?), on "Probabilistic Program Semantics" Valeria Vignudelli (CNRS), on "Equational Theories for Probabilistic Effects" Registration will cover participation to the school and accommodation at CEUB with half board. Thanks to the help of sponsors (including ETAPS, SIGLOG, SIGPLAN, the University of Bologna, and the DIAPASoN Project), we plan to keep the registration fee as low as possible. The reception capacity of the CEUB is big, but subject to limits. We therefore encourage those interested in participating to the school to pre-register by following the link below [5] and fill the form *by October 31, 2022*. This we will help us keep track of the numbers. We would be happy to answer any questions about the organization of the school. Just send us an email! Looking forward to seeing you in Bertinoro. Best Regards, Ugo Dal Lago, Francesco Gavazzo, Paolo Pistone. [1] https://urldefense.com/v3/__https://probprogschool2017.di.uminho.pt/__;!!IBzWLUs!VDoGhQwA5AM22LGoVYaEy91B8jA8bXIdYdlolLDugnt0-ICH_5qyS7tAYK8Mw3dGoBA-52OFqtewtCPla4g0WK9rWgwNoTsUSivEzNVRHw$ [2] https://urldefense.com/v3/__https://www.floc2018.org/fopss/__;!!IBzWLUs!VDoGhQwA5AM22LGoVYaEy91B8jA8bXIdYdlolLDugnt0-ICH_5qyS7tAYK8Mw3dGoBA-52OFqtewtCPla4g0WK9rWgwNoTsUSispgY1oeg$ [3] https://urldefense.com/v3/__https://www.mimuw.edu.pl/*fopss19/__;fg!!IBzWLUs!VDoGhQwA5AM22LGoVYaEy91B8jA8bXIdYdlolLDugnt0-ICH_5qyS7tAYK8Mw3dGoBA-52OFqtewtCPla4g0WK9rWgwNoTsUSivGP23aAg$ [4] https://urldefense.com/v3/__https://www.ceub.it/?lang=en__;!!IBzWLUs!VDoGhQwA5AM22LGoVYaEy91B8jA8bXIdYdlolLDugnt0-ICH_5qyS7tAYK8Mw3dGoBA-52OFqtewtCPla4g0WK9rWgwNoTsUSitchvBG4A$ [5] https://urldefense.com/v3/__https://forms.gle/Z5sinvogkApZrgqaA__;!!IBzWLUs!VDoGhQwA5AM22LGoVYaEy91B8jA8bXIdYdlolLDugnt0-ICH_5qyS7tAYK8Mw3dGoBA-52OFqtewtCPla4g0WK9rWgwNoTsUSiuycln91w$ -------------- next part -------------- An HTML attachment was scrubbed... URL: From dezani at di.unito.it Mon Oct 24 08:12:00 2022 From: dezani at di.unito.it (Mariangiola Dezani) Date: Mon, 24 Oct 2022 14:12:00 +0200 Subject: [TYPES/announce] 2023 Alonzo Church Award: Call for Nominations Message-ID: CALL FOR NOMINATIONS The 2023 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!Qh0XmC43QeO0ARqEIIHuc_26vxJP1IEAL_AN2BzvVnEVgvUmTM1RRV8ZiNUKPJIGxF1ryeRKRk7GtN34wV5G-uS8sAhV7dl4$ , https://urldefense.com/v3/__https://www.eatcs.org/index.php/church-award/__;!!IBzWLUs!Qh0XmC43QeO0ARqEIIHuc_26vxJP1IEAL_AN2BzvVnEVgvUmTM1RRV8ZiNUKPJIGxF1ryeRKRk7GtN34wV5G-uS8sNvtdzaQ$ , and https://urldefense.com/v3/__https://www.eacsl.org/alonzo-church-award/__;!!IBzWLUs!Qh0XmC43QeO0ARqEIIHuc_26vxJP1IEAL_AN2BzvVnEVgvUmTM1RRV8ZiNUKPJIGxF1ryeRKRk7GtN34wV5G-uS8sL_ZWZtw$ . The 2022 Alonzo Church Award was given to Dexter Kozen for his ground- breaking work on the theory and applications of Kleene Algebra with Tests. 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 2023 award, the cut-off date is January 1, 1998. 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 2023 award are now being solicited. The nominating letter must summarise 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 for the 2023 award are automatically considered for all future editions of the award, until they receive the award or the nominated papers are no longer eligible. Nominations should be submitted to dezani at di.unito.it and to mariangiola.dezani at gmail.com by February 1, 2023. PRESENTATION OF THE AWARD The 2023 award will be presented at the 50th EATCS International Colloquium on Automata, Languages and Programming, which is scheduled to take place in Paderborn - Germany on July 10-14, 2023. 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 2023 Alonzo Church Award Committee consists of the following five members: Thomas Colcombet, Mariangiola Dezani (chair), Marcelo Fiore, Radha Jagadeesan, and Igor Walukiewicz. @@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@ Mariangiola Dezani-Ciancaglini Dipartimento di Informatica Universita' di Torino c.Svizzera 185, 10149 Torino (Italy) e-mail : dezani at di.unito.it https://urldefense.com/v3/__http://www.di.unito.it/*dezani__;fg!!IBzWLUs!Qh0XmC43QeO0ARqEIIHuc_26vxJP1IEAL_AN2BzvVnEVgvUmTM1RRV8ZiNUKPJIGxF1ryeRKRk7GtN34wV5G-uS8sEfMKjou$ From pierre-marie.pedrot at inria.fr Mon Oct 24 08:17:13 2022 From: pierre-marie.pedrot at inria.fr (=?UTF-8?Q?Pierre-Marie_P=c3=a9drot?=) Date: Mon, 24 Oct 2022 14:17:13 +0200 Subject: [TYPES/announce] TYPES 2022 Second Post-proceeding CfP Message-ID: TYPES is a major forum for the presentation of research on all aspects of type theory and its applications. TYPES 2022 was held from 20 to 25 June at LS2N, University of Nantes, France. The post-proceedings volume will be published in LIPIcs, Leibniz International Proceedings in Informatics, an open-access series of conference. Submission Guidelines Submission is open to everyone, also to those who did not participate in the TYPES 2022 conference. We welcome high-quality descriptions of original work, as well as position papers, overview papers, and system descriptions. Submissions should be written in English, and being original, i.e. neither previously published, nor simultaneously submitted to a journal or a conference. - Papers have to be formatted with the current LIPIcs style and adhere to the style requirements of LIPIcs. - The upper limit for the length of submissions is 20 pages, excluding bibliography (but including title and appendices). - Papers have to be submitted as PDF via the EasyChair interface, accessible at https://easychair.org/conferences/?conf=posttypes2022 - The processing charge will be sponsored by the LS2N for up to 20 publications, given that these publications do not exceed the page limit. - Authors have the option to attach to their submission a zip or tgz file containing code (formalised proofs or programs), but reviewers are not obliged to take the attachments into account and they will not be published. Deadlines - Abstract Submission : 31 October 2022 (AoE) - Paper submission: 30 November 2022 (AoE) - Author notification: 31 March 2022 List of Topics The scope of the post-proceedings is the same as the scope of the conference: the theory and practice of type theory. In particular, we welcome submissions on the following topics: - Foundations of type theory; - Applications of type theory (e.g. linguistics or concurrency); - Constructive mathematics; - Dependently typed programming; - Industrial uses of type theory technology; - Meta-theoretic studies of type systems; - Proof assistants and proof technology; - Automation in computer-assisted reasoning; - Links between type theory and functional programming; - Formalising mathematics using type theory; - Homotopy type theory and univalent mathematics. Editors Delia Kesner, Universit? Paris Cit?, FR (delia.kesner at irif.fr) Pierre-Marie P?drot, INRIA, FR (pierre-marie.pedrot at inria.fr) Contact In case of questions, contact the editors directly. -------------- next part -------------- A non-text attachment was scrubbed... Name: OpenPGP_0x7922C01FD9BA3C7B.asc Type: application/pgp-keys Size: 4032 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 marco.guarnieri at imdea.org Mon Oct 24 16:15:46 2022 From: marco.guarnieri at imdea.org (Marco Guarnieri) Date: Mon, 24 Oct 2022 22:15:46 +0200 Subject: [TYPES/announce] 2nd Call for Presentations - Workshop on Principles of Secure Compilation (PriSC 2023) Message-ID: ================================================ 2nd Call for Presentations: PriSC 2023 @ POPL 2023 ================================================ Secure compilation is an emerging field that puts together advances in security, programming languages, compilers, verification, systems, and hardware architectures in order to devise more secure compilation chains that eliminate many of today?s security vulnerabilities and that allow sound reasoning about security properties in the source language. For a concrete example, all modern languages provide a notion of structured control flow and an invoked procedure is expected to return to the right place. However, today?s compilation chains (compilers, linkers, loaders, runtime systems, hardware) cannot efficiently enforce this abstraction against linked low-level code, which can call and return to arbitrary instructions or smash the stack, blatantly violating the high-level abstraction. Other problems arise because today?s languages fail to specify security policies, such as data confidentiality, and the compilation chains thus fail to enforce them, especially against powerful side-channel attacks. The emerging secure compilation community aims to address such problems by identifying precise security goals and attacker models, designing more secure languages, devising efficient enforcement and mitigation mechanisms, and developing effective verification techniques for secure compilation chains. 7th Workshop on Principles of Secure Compilation (PriSC 2023) ============================================================= The Workshop on Principles of Secure Compilation (PriSC) is an informal 1-day workshop without any proceedings. The goal of this workshop is to identify interesting research directions and open challenges and to bring together researchers interested in working on building secure compilation chains, on developing proof techniques and verification tools, and on designing software or hardware enforcement mechanisms for secure compilation. The 7th edition of PriSC will be held on January 21 in Boston, Massachusetts, United State together with the ACM SIGPLAN Symposium on Principles of Programming Languages (POPL), 2023. Important Dates =============== * Thu 27 Oct 2022: Submission Deadline * Thu 24 Nov 2022: Acceptance Notification * Sat 21 Jan 2023: Workshop Presentation Proposals and Attending the Workshop ================================================= Anyone interested in presenting at the workshop should submit an extended abstract (up to 2 pages, details below) covering past, ongoing, or future work. Any topic that could be of interest to secure compilation is in scope. Secure compilation should be interpreted very broadly to include any work in security, programming languages, architecture, systems or their combination that can be leveraged to preserve security properties of programs when they are compiled or to eliminate low-level vulnerabilities. Presentations that provide a useful outside view or challenge the community are also welcome. This includes presentations on new attack vectors such as microarchitectural side-channels, whose defenses could benefit from compiler techniques. Specific topics of interest include but are not limited to: * Attacker models for secure compiler chains. * Secure compiler properties: fully abstract compilation and similar properties, memory safety, control-flow integrity, preservation of safety, information flow and other (hyper-)properties against adversarial contexts, secure multi-language interoperability. * Secure interaction between different programming languages: foreign function interfaces, gradual types, securely combining different memory management strategies. * Enforcement mechanisms and low-level security primitives: static checking, program verification, typed assembly languages, reference monitoring, program rewriting, software-based isolation/hiding techniques (SFI, crypto-based, randomization-based, OS/hypervisor-based), security-oriented architectural features such as Intel?s SGX, MPX and MPK, capability machines, side-channel defenses, object capabilities. * Experimental evaluation and applications of secure compilers. * Proof methods relevant to compilation: (bi)simulation, logical relations, game semantics, trace semantics, multi-language semantics, embedded interpreters. * Formal verification of secure compilation chains (protection mechanisms, compilers, linkers, loaders), machine-checked proofs, translation validation, property-based testing. Guidelines for Submitting Extended Abstracts ============================================ Extended abstracts should be submitted in PDF format and not exceed 2 pages (references not included). They should be formatted in two-column layout, 10pt font, and be printable on A4 and US Letter sized paper. We recommend using the new acmart LaTeX style in sigplan mode. Submissions are not anonymous and should provide sufficient detail to be assessed by the program committee. Presentation at the workshop does not preclude publication elsewhere. Contact and More Information ============================ You can find more information on the workshop website: https://urldefense.com/v3/__https://popl23.sigplan.org/home/prisc-2023__;!!IBzWLUs!TgQbhA68uXYkM_7snP8xoP7yrj2Ih0d4Z3OLWKkIpBv9RPwHKxrRMvJvrlMJXesCvLofAShi8z2xpvuRR1J0OPLIeRO48CJSeVSSz-pT$ Submission website: https://urldefense.com/v3/__https://prisc2023.hotcrp.com/__;!!IBzWLUs!TgQbhA68uXYkM_7snP8xoP7yrj2Ih0d4Z3OLWKkIpBv9RPwHKxrRMvJvrlMJXesCvLofAShi8z2xpvuRR1J0OPLIeRO48CJSeR0QIXg3$ For questions please contact the workshop chairs, Marco Guarnieri (marco.guarnieri at imdea.org ) and Shweta Shinde (shweta.shivajishinde at inf.ethz.ch ). -------------- next part -------------- An HTML attachment was scrubbed... URL: From miltner at sfu.ca Tue Oct 25 00:25:43 2022 From: miltner at sfu.ca (Anders Miltner) Date: Tue, 25 Oct 2022 04:25:43 +0000 Subject: [TYPES/announce] PLDI 2023 Artifact Evaluation Committee Nominations Message-ID: We are looking for motivated students and researchers to be members of the PLDI 2023 Artifact Evaluation Committee (AEC). This year, we are accepting (self-)nominations for the AEC. The artifact evaluation process aims to promote, share and catalog the research artifacts of papers accepted to the PLDI research track. The self-nomination form is available at: https://urldefense.com/v3/__https://forms.gle/WYoR9X1DkVj6KhfQ9__;!!IBzWLUs!UqfULxcfgEQri_DKFyLkw0STKr8E5IBhyzSz4GMMT_FF1mhh-e3q-tBxhaRqnbIhRkVmJVQUI4Je3IxdNuPEImIvEQXcYw$ You can also nominate other people (e.g., students, colleagues) at: https://urldefense.com/v3/__https://forms.gle/vRVYYXmpZi1ioXRr8__;!!IBzWLUs!UqfULxcfgEQri_DKFyLkw0STKr8E5IBhyzSz4GMMT_FF1mhh-e3q-tBxhaRqnbIhRkVmJVQUI4Je3IxdNuPEImLNWJAwqQ$ As a committee member, the primary responsibilities would be to review the artifacts submitted corresponding to the already accepted papers in the main research track. In particular, you may have to run the associated tool, check whether the results in the main paper can be reproduced, and inspect the data. We expect the bulk of the review work to take place between end February and early April. Each artifact will take about 8h to review, and reviewers will be assigned about 3 artifacts to review. Come join us in improving the quality of research in our field! Manuel Rigger and Xinyu Wang -------------- next part -------------- An HTML attachment was scrubbed... URL: From musard.balliu at gmail.com Tue Oct 25 07:36:51 2022 From: musard.balliu at gmail.com (Musard Balliu) Date: Tue, 25 Oct 2022 13:36:51 +0200 Subject: [TYPES/announce] PLAS 2022: Call for Papers Message-ID: Dear Fellow Researchers, We welcome submissions to the 17th Workshop on Programming Languages and Analysis for Security (PLAS 2022). This year PLAS is uniquely designed to make it as easy as possible for authors to simply focus on science: No proceedings, no registration fees, no travel, no page limits or complex submission formats - just share and discuss your great ideas with fellow researchers in the areas of programming languages and security. We look forward to receiving your submissions by November 14th, 2022. Best regards, Musard Balliu and Sunjay Cauligi -------------------------------------------------------------------------- PLAS 2022 Call for Papers 17th Workshop on Programming Languages and Analysis for Security (PLAS 2022) https://urldefense.com/v3/__https://plas2022.github.io/__;!!IBzWLUs!V6Q-jp6YSZd13rvUftvqxqPtcC25_eMi3Q_FnLq4JDNAMqHaTD42vZYUzVf4NR1-i2ge22XmarEBsrqJNmwW9DBIAWPiKXlcU7RGrw$ Virtual Event December 12, 2022 -------------------------------------------------------------------------- Important Dates Paper submission: November 14, 2022 (AoE) Author notification: November 30, 2022 Workshop date: December 12, 2022 -------------------------------------------------------------------------- PLAS provides a forum for exploring and evaluating the use of programming language and program analysis techniques for promoting security in the complete range of software systems, from compilers to machine-learned models and smart contracts. The workshop encourages proposals of new, speculative ideas, evaluations of new or known techniques in practical settings, and discussions of emerging threats and problems. We also host position papers that are radical, forward-looking, and lead to lively and insightful discussions influential to the future research at the intersection of programming languages and security. The scope of PLAS includes, but is not limited to: - Language-based techniques for detecting and eliminating side-channel vulnerabilities - Programming language techniques and verification applied to security in other domains (e.g. adversarial learning and smart contracts) - Software isolation techniques (e.g., SFI and sandboxing) and compiler-based hardening techniques (e.g, secure compilation). - Compiler-based security mechanisms (e.g. security type systems) or runtime-based security mechanisms (e.g. inline reference monitors) - Techniques for discovering and detecting security vulnerabilities, including program (binary) analysis and fuzzing - Automated introduction and/or verification of security enforcement mechanisms - Language-based verification of security properties in software, including verification of cryptographic protocols - Specifying and enforcing security policies for information flow and access control - Model-driven approaches to security - Security concerns for Web programming languages - Language design for security in new domains such as cloud computing and IoT - Applications, case studies, and implementations of these techniques -------------------------------------------------------------------------- We invite both short papers and long papers. All submissions should be anonymous. For short papers, we especially encourage the submission of position papers that are likely to generate lively discussion as well as short papers covering ongoing and future work. - *Full papers:* There is no page limit on long papers. Papers in this category are expected to have relatively mature content. Papers that present promising preliminary and exploratory work, or recently published work are particularly welcome in this category. Long papers may receive longer talk slots at the workshop than short papers, depending on the number of accepted submissions. - *Short papers:* should be at most 2 pages long, plus as many pages as needed for references. Papers that present radical, open-ended and forward-looking ideas are particularly welcome in this category. Authors submitting papers in this category must prepend the phrase "Short Paper:" to the title of the submitted paper. The workshop has no published workshop proceedings and there is no restriction on paper format other than the page limits stated above. Presenting a paper (either short or long) at the workshop does not preclude submission to or publication in other venues that are before, concurrent, or after the workshop. Papers presented at the workshop will be made available to workshop participants only. -------------- next part -------------- An HTML attachment was scrubbed... URL: From michael.marcozzi at gmail.com Wed Oct 26 06:59:42 2022 From: michael.marcozzi at gmail.com (=?UTF-8?Q?Micha=C3=ABl_Marcozzi?=) Date: Wed, 26 Oct 2022 12:59:42 +0200 Subject: [TYPES/announce] =?utf-8?q?Postdoc=2C_PhD_and_intern_positions_a?= =?utf-8?q?t_Universit=C3=A9_Paris-Saclay=2C_CEA_List_institute=2C_?= =?utf-8?q?France=2C_in_Software_Security_and_Program_Analysis?= Message-ID: The BINSEC team ( https://urldefense.com/v3/__https://binsec.github.io__;!!IBzWLUs!S_FO1rvjvwKrcdv9zWoUzaZqadwYQ2qciX9KeX7DbhOOE8NNqeBwYqTdLEk4Z1VZ1UdKW2lFrDgTYc6Zj_aEwlC2klXA3mfUYU2-X7YE$ ) opens postdoc, PhD student and research intern positions in software security and program analysis. *START*: as soon as possible. *DURATION*: 2-3 years (postdoc), 3 years (PhD), 2.5-6 months (intern). *GOALS*: vulnerability detection and analysis, software reverse engineering and deobfuscation, binary-level formal verification and code protection *TECHNIQUES*: symbolic execution, static analysis, fuzzing, program synthesis, SMT solvers https://urldefense.com/v3/__https://binsec.github.io/jobs/open/2022/10/25/phd-postdoc-offer.html__;!!IBzWLUs!S_FO1rvjvwKrcdv9zWoUzaZqadwYQ2qciX9KeX7DbhOOE8NNqeBwYqTdLEk4Z1VZ1UdKW2lFrDgTYc6Zj_aEwlC2klXA3mfUYe17xbsq$ *== ABOUT US* *OUR TEAM* - The BINary-level SECurity research group (BINSEC) is a dynamic team of 4 senior and 9 junior researchers, which offers a stimulating and open-minded work environment in English. The group has frequent publications in top-tier security, formal methods and software engineering conferences. It is part of CEA (one of the main French research organisations, employing more than 20k researchers and persistently ranked as a top global innovator) and of Universit? Paris-Saclay (the world?s 16th and European Union?s 1st university, according to the Shanghai ARWU Ranking in 2022). *OUR WORK* - The team has strong expertise in several code analysis approaches, namely symbolic execution, abstract interpretation and fuzzing. We apply these techniques to improve software security, covering notably vulnerability detection and analysis, code (de)obfuscation and formal verification. See our website at https://urldefense.com/v3/__https://binsec.github.io__;!!IBzWLUs!S_FO1rvjvwKrcdv9zWoUzaZqadwYQ2qciX9KeX7DbhOOE8NNqeBwYqTdLEk4Z1VZ1UdKW2lFrDgTYc6Zj_aEwlC2klXA3mfUYU2-X7YE$ for additional information. *== APPLICATION* Candidates should send a CV to binsec-jobs at saxifrage.saclay.cea.fr as soon as possible. Applications will be reviewed as they arrive (first come, first served), depending on our availability, and additional information may be requested from you. *Please read the detailed job offer to prepare your application in the best way:* https://urldefense.com/v3/__https://binsec.github.io/jobs/open/2022/10/25/phd-postdoc-offer.html__;!!IBzWLUs!S_FO1rvjvwKrcdv9zWoUzaZqadwYQ2qciX9KeX7DbhOOE8NNqeBwYqTdLEk4Z1VZ1UdKW2lFrDgTYc6Zj_aEwlC2klXA3mfUYe17xbsq$ --- Dr. Micha?l Marcozzi Tenured Researcher Universit? Paris-Saclay, CEA, List Twitter: @michaelmarcozzi https://urldefense.com/v3/__http://www.marcozzi.net__;!!IBzWLUs!S_FO1rvjvwKrcdv9zWoUzaZqadwYQ2qciX9KeX7DbhOOE8NNqeBwYqTdLEk4Z1VZ1UdKW2lFrDgTYc6Zj_aEwlC2klXA3mfUYcSaxScz$ -------------- next part -------------- An HTML attachment was scrubbed... URL: From Dejan.Nickovic at ait.ac.at Thu Oct 27 03:48:26 2022 From: Dejan.Nickovic at ait.ac.at (=?iso-8859-2?Q?Ni=E8kovi=E6_Dejan?=) Date: Thu, 27 Oct 2022 07:48:26 +0000 Subject: [TYPES/announce] HSCC 2023 Call for papers Message-ID: <1a89777de8ae4d469cec6553e226c718@ait.ac.at> Dear colleagues, On behalf of the PC of HSCC 2023 I would like to draw your attention to the call for papers for the 26th edition to take part in San Antonio, TX. I include a CfP in PDF that you can also use to advertise among your colleagues and post at your institutions. 26th ACM International Conference on Hybrid Systems: Computation and Control 9-12 May 2023, San Antonio, TX, USA https://urldefense.com/v3/__https://hscc.acm.org/2023/__;!!IBzWLUs!Xeu7Xo7nKUyyfaIRYoZQPDW-MJxGxq0rCNEhSP5Vk2vxFJqEjTtemJh682dui9mjsRpEMtprFu8QBLTAdE3uAJxpMroiJnqYcUvC1U69_w$ Scope Hybrid Systems: Computation and Control (HSCC) 2023 is the 26th in a series of conferences focusing on original research on concepts, tools, and techniques from computer science, control theory, and applied mathematics for the analysis and control of hybrid dynamical systems, with an emphasis on computational aspects. By drawing on strategies from computation and control, the hybrid systems field offers techniques that are applicable to both man-made cyber-physical systems (ranging from small robots to global infrastructure networks) and natural systems (ranging from biochemical networks to physiological models). Papers in the conference are expected to range over a wide spectrum of topics from theoretical results to practical considerations, and from academic research to industrial adoption. Topics of interest include, but are not limited to: * Mathematical foundations, computability and complexity * Analysis, verification, validation, and testing * Modeling paradigms and techniques * Design, synthesis, planning, and control * Programming and specification languages * Network science and network-based control * Security, privacy, and resilience for cyber-physical systems with focus on computation and control * Safe autonomy, Artificial intelligence and Machine learning in CPS * Software tools for the above topics * Applications and industrial case studies in: automotive, transportation, autonomous systems, avionics, energy and power, robotics, medical devices, manufacturing, systems and synthetic biology, models for the life sciences, and other related areas. Submission guidelines HSCC solicits submissions which present unpublished original research, not under review elsewhere. HSCC invites submissions in two categories: (1) regular papers and (2) tool and case study papers. Submissions in both of these categories can be either long (10 pages max, 9pt font, two-column ACM format) or short papers (6 pages max, 9pt font, two-column ACM format). Note that the page limits do not include references and appendices. Each submission may include optional appendices with supplementary material. These appendices will be read at the discretion of the program committee and will not be included in the conference proceedings. We will employ a double blind reviewing process and will have a rebuttal phase to provide authors the opportunity to reply to reviewer concerns. Authors are asked to submit their paper using EasyChair. Note that each tool and case study submission, except for a limited number of cases such as, e.g., submissions presenting industrial/proprietary benchmarks, must be accompanied by a Repeatability Evaluation Package (see here for more details). Awards ACM SIGBED HSCC Best Paper Award: All regular papers, including special track papers, will be automatically eligible for this award. HSCC Test-Of-Time Award: This award recognizes the work that 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 call for nominations and eligibility criteria are published here. Repeatability Evaluation: Papers that pass repeatability evaluation process will receive the "artifact evaluated" badge and there will be a Best RE Award. Best Demo/Poster: All demos and posters accepted for presentation at HSCC'23 will be eligible for the best demo/poster award. Important dates Submission deadline October 31, 2022 (AOE) Tool/case study paper repeatability package submission deadline November 7, 2022 (AOE) Rebuttal phase January 9-13, 2023 Acceptance/rejection notifications January 20, 2023 Submission deadline of repeatability packages for accepted regular papers February 6, 2023 (AOE) Posters/demos submission deadline February 6, 2023 (AOE) Conference date May 9-12, 2023 HSCC 2023 will be part of the 16th Cyber Physical Systems Week (CPS Week), and co-located with the International Conference on Cyber-Physical Systems (ICCPS), Information Processing in Sensor Networks (IPSN), the Real-Time and Embedded Technology and Applications Symposium (RTAS), Conference on Internet-of-Things Design and Implementation (IOTDI), and related workshops. Dejan Ni?kovi? Senior Scientist Dependable Systems Engineering Center for Digital Safety & Security AIT Austrian Institute of Technology GmbH Giefinggasse 4 | 1210 Vienna | Austria T +43(0) 50550-4021 | M +43(0) 66488-390038 | F +43(0) 50550-4150 FN: 115980 i HG Wien | UID: ATU14703506 https://urldefense.com/v3/__http://www.ait.ac.at/Email-Disclaimer__;!!IBzWLUs!Xeu7Xo7nKUyyfaIRYoZQPDW-MJxGxq0rCNEhSP5Vk2vxFJqEjTtemJh682dui9mjsRpEMtprFu8QBLTAdE3uAJxpMroiJnqYcUv-ZebK4g$ -------------- next part -------------- An HTML attachment was scrubbed... URL: From Robin.Kaarsgaard at ed.ac.uk Thu Oct 27 03:57:49 2022 From: Robin.Kaarsgaard at ed.ac.uk (Robin Kaarsgaard) Date: Thu, 27 Oct 2022 07:57:49 +0000 Subject: [TYPES/announce] =?utf-8?q?SYCO_10_=E2=80=93_Second_call_for_sub?= =?utf-8?q?missions?= Message-ID: ----------------------------------------- CALL FOR SUBMISSIONS TENTH SYMPOSIUM ON COMPOSITIONAL STRUCTURES (SYCO 10) Edinburgh, United Kingdom 19-20 December, 2022 Submission deadline: Monday 7 November 2022 https://urldefense.com/v3/__https://www.cl.cam.ac.uk/events/syco/10/__;!!IBzWLUs!UzuK50EEcUgMlcP-NUZcce9x2RQPeuPMdHGqtoL3QTpA7DPFDMZ1OixC1jVFzy5x4qQVl-LIRotLVRWg6DiODKJb95kLngMpBrFxiyu0wZ0$ ----------------------------------------- The Symposium on Compositional Structures (SYCO) is an interdisciplinary series of meetings aiming to support the growing community of researchers interested in the phenomenon of compositionality, from both applied and abstract perspectives, and in particular where category theory serves as a unifying common language. Previous SYCO events have been held in Birmingham, Strathclyde, Oxford, Chapman, Leicester, Tallinn, and Como. We welcome submissions from researchers across computer science, mathematics, physics, philosophy, and beyond, with the aim of fostering friendly discussion, disseminating new ideas, and spreading knowledge between fields. Submission is encouraged for both mature research and work in progress, and by both established academics and junior researchers, including students. Submissions is easy, with no formatting or page restrictions. The meeting does not have proceedings, so work can be submitted even if it has been submitted or published elsewhere. You could submit work-in-progress, or a recently completed paper, or even a PhD or Masters thesis. While no list of topics could be exhaustive, SYCO welcomes submissions with a compositional focus related to any of the following areas, in particular from the perspective of category theory: - logical methods in computer science, including classical and quantum programming, type theory, concurrency, natural language processing and machine learning; - graphical calculi, including string diagrams, Petri nets and reaction networks; - languages and frameworks, including process algebras, proof nets, type theory and game semantics; - abstract algebra and pure category theory, including monoidal category theory, higher category theory, operads, polygraphs, and relationships to homotopy theory; - quantum algebra, including quantum computation and representation theory; - tools and techniques, including rewriting, formal proofs and proof assistants, and game theory; - industrial applications, including case studies and real-world problem descriptions. ** IMPORTANT DATES ** All deadlines are 23:59 Anywhere on Earth. Submission deadline: Monday 7 November, 2022 Author notification: Sunday 20 November, 2022 Symposium dates: Monday 19 and Tuesday 20 December 2022 ** SUBMISSION INSTRUCTIONS ** Submissions are by OpenReview, via the SYCO 10 submission page: https://urldefense.com/v3/__https://openreview.net/group?id=cl.cam.ac.uk*SYCO*2022*Symposium__;Ly8v!!IBzWLUs!UzuK50EEcUgMlcP-NUZcce9x2RQPeuPMdHGqtoL3QTpA7DPFDMZ1OixC1jVFzy5x4qQVl-LIRotLVRWg6DiODKJb95kLngMpBrFxH7RNIm4$ Submission is easy, with no format requirements or page restrictions. The meeting does not have proceedings, so work can be submitted even if it has been submitted or published elsewhere. Think creatively: you could submit a recent paper, or notes on work in progress, or even a recent Masters or PhD thesis. In the event that more good-quality submissions are received than can be accommodated in the timetable, the programme committee may choose to *defer* some submissions to a future meeting, rather than reject them. Deferred submissions can be re-submitted to any future SYCO meeting, where they will not need peer review, and where they will be prioritised for inclusion in the programme. Meetings will be held sufficiently frequently to avoid a backlog of deferred papers. If you have a submission which was deferred from a previous SYCO meeting, it will not automatically be considered for SYCO 10; you still need to submit it again through OpenReview. When submitting, append the words "DEFERRED FROM SYCO X" to the title of your paper, replacing "X" with the appropriate meeting number. There is no need to attach any documents. ** PROGRAMME COMMITTEE ** Robin Cockett, University of Calgary Carmen Constantin, University of Edinburgh Ross Duncan, University of Strathclyde Chris Heunen, University of Edinburgh Dominic Horsman, University of Grenoble Robin Kaarsgaard, University of Edinburgh (chair) Marie Kerjean, Universit? Paris 13 Aleks Kissinger, University of Oxford Dan Marsden, University of Nottingham Jade Master, University of Strathclyde Samuel Mimram, ?cole Polytechnique Jean-Simon Pacaud Lemay, Kyoto University Simona Paoli, University of Aberdeen Mathys Rennela, INRIA Paris Mehrnoosh Sadrzadeh, University College London Pawel Sobocinski, Tallinn University of Technology Tarmo Uustalu, Reykjavik University Niccol? Veltri, Tallinn University of Technology Jamie Vicary, University of Cambridge Maaike Zwart, IT University of Copenhagen ** STEERING COMMITTEE ** Ross Duncan, University of Strathclyde Chris Heunen, University of Edinburgh Dominic Horsman, University of Oxford Aleks Kissinger, University of Oxford Samuel Mimram, ?cole Polytechnique Simona Paoli, University of Aberdeen Mehrnoosh Sadrzadeh, University College London Pawel Sobocinski, Tallinn University of Technology Jamie Vicary, University of Cambridge The University of Edinburgh is a charitable body, registered in Scotland, with registration number SC005336. Is e buidheann carthannais a th? ann an Oilthigh Dh?n ?ideann, cl?raichte an Alba, ?ireamh cl?raidh SC005336. From bpientka at cs.mcgill.ca Thu Oct 27 20:02:21 2022 From: bpientka at cs.mcgill.ca (Brigitte Pientka) Date: Fri, 28 Oct 2022 00:02:21 +0000 Subject: [TYPES/announce] PL and AI faculty Position at McGill University Message-ID: We will be hiring for several positions in artificial intelligence (very broadly interpreted). In particularly, we are interested in applicants that work on the intersection of AI to security, privacy, reliability, formal methods, programming languages, and software engineering. The announcement advertises several positions (including (ii) Security, privacy, robustness, or reliability in AI or AI-driven fields.) https://mcgill.wd3.myworkdayjobs.com/en-US/mcgill_careers/details/Tenure-Track-Faculty-Positions-in-Computer-Science--Machine-Learning-and-Artificial-Intelligence_JR0000034064 As suitable candidates will be nominated to become affiliated with Mila (Quebec AI Institute) and may be recommended to receive a CIFAR Chair in AI , candidates ideally have a publication record in top ML/AI conferences, journals, and/or related publication venues. If you are interested, I would encourage you to apply. Feel free to contact me! - Brigitte --------------------------------------------------------------------------- Prof. Brigitte Pientka School of Computer Science McGill University 3480 University Street Montreal, Quebec, H3A 0E9 Canada Phone : +1 (514) 398 2583 E-mail: bpientka at cs.mcgill.ca WWW : http://www.cs.mcgill.ca/~bpientka --------------------------------------------------------------------------- -------------- 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 lutz at lix.polytechnique.fr Fri Oct 28 08:21:47 2022 From: lutz at lix.polytechnique.fr (lutz at lix.polytechnique.fr) Date: Fri, 28 Oct 2022 14:21:47 +0200 Subject: [TYPES/announce] ESSLLI 2023: Call for Course and Workshop Proposals Message-ID: <0d938354e27503f2a770e95252b14d84.squirrel@webmail.lix.polytechnique.fr> Call for Course and Workshop Proposals 34th European Summer School in Logic, Language and Information ? ESSLLI 2023 31 July?11 August, 2023, Ljubljana, Slovenia https://urldefense.com/v3/__https://2023.esslli.eu/__;!!IBzWLUs!VkcjEqQYvwKsMUYHwzbfRkweBHfiOpAr1ENbaVskWmxhTNAyXZZu82nhSUn4pr4r4U4sjyWX2mq_2N7jMrg3PTuqoXdp2wrNtTy75QQ$ Important Dates 13 January 2023: Course Title submission deadline (mandatory) 20 January 2023: Final submission 3 March 2023: Notification Introduction Under the auspices of the Association for Logic, Language, and Information (FoLLI), the European Summer School in Logic, Language, and Information (ESSLLI) runs every year. Except for 2021, where the school was virtual, it runs in a different European country each year. It takes place over two weeks in the summer, hosts approximately 50 different courses at both introductory and advanced levels, and attracts around 400 participants from all over the world. Since 1989, ESSLLI has been providing outstanding interdisciplinary educational opportunities in the fields of Computer Science, Cognitive Science, Linguistics, Logic, Philosophy, and beyond. It comes from a community which recognizes that advances in our common areas require the contributions of multiple interrelated disciplines. The main focus of ESSLLI is the interface between linguistics, logic and computation, with special emphasis in human linguistic and cognitive ability. Courses, both introductory and advanced, cover a wide variety of topics within the combined areas of interest: Logic and Computation, Computation and Language, and Language and Logic. Workshops are also organized, providing opportunities for in-depth discussion of issues at the forefront of research, as well as a series of invited evening lectures. Topics and Format Proposals for courses and workshops at ESSLLI 2023 are invited in all areas of Logic, Linguistics and Computer Sciences. Cross-disciplinary and innovative topics are particularly encouraged. Each course and workshop will consist of five 90 minute sessions, offered daily (Monday-Friday) in a single week. Proposals for two-week courses should be structured and submitted as two independent one-week courses, e.g. as an introductory course followed by an advanced one. In such cases, the ESSLLI program committee reserves the right to accept just one of the two proposals. All instructional and organizational work at ESSLLI is performed completely on a voluntary basis, so as to keep participation fees to a minimum. However, organizers and instructors have their registration fees waived, and are reimbursed for travel and accommodation expenses up to a level to be determined and communicated with the proposal notification. ESSLLI can only guarantee reimbursement for at most one course/workshop organizer, and cannot guarantee full reimbursement of travel costs for lecturers or organizers from outside of Europe. The ESSLLI organizers would appreciate any help in controlling the School's expenses by seeking partial or complete coverage of travel and accommodation expenses from other sources. Categories Each proposal should fall under one of the following categories. Foundational Courses Such courses are designed to present the basics of a research area, to people with no prior knowledge in that area. They should be of elementary level, without prerequisites in the course's topic, though possibly assuming a level of general scientific maturity in the relevant discipline. They should enable researchers from related disciplines to develop a level of comfort with the fundamental concepts and techniques of the course's topic, thereby contributing to the interdisciplinary nature of our research community. Introductory Courses Introductory courses are central to ESSLLI's mission. They are intended to introduce a research field to students, young researchers, and other non-specialists, and to foster a sound understanding of its basic methods and techniques. Such courses should enable researchers from related disciplines to develop some comfort and competence in the topic considered. Introductory courses in a cross-disciplinary area may presuppose general knowledge of the related disciplines. Advanced Courses Advanced courses are targeted primarily to graduate students who wish to acquire a level of comfort and understanding in the current research of a field. Workshops Workshops focus on specialized topics, usually of current interest. Workshop organizers are responsible for soliciting papers and selecting the workshop program. They are also responsible for publishing proceedings if they decide to have proceedings. Proposal Guidelines Course and workshop proposals should closely follow these guidelines to ensure full consideration. Course and Workshop proposals can be submitted by no more than two lecturers/organizers and they are presented by no more than these two lecturers/organizers. All instructors and organizers must possess a PhD or equivalent degree by the submission deadline. Course proposals should mention explicitly the intended course category. Proposals for introductory courses should indicate the intended level, for example as it relates to standard textbooks and monographs in the area. Proposals for advanced courses should specify the prerequisites in detail. Proposals of Courses given at ESSLLI the previous year will have a lower priority of being accepted in the current year. Proposals must be in PDF format include all of the following: 1. Personal information for each proposer: Name, affiliation, contact address, email, homepage (optional) 2. General proposal information: Title, category 3. Contents information: * Abstract of up to 150 words * Motivation and description (up to two pages) * Tentative outline * Expected level and prerequisites * Appropriate references (e.g. textbooks, monographs, proceedings, surveys) 1. Information on the proposer and course: * Will your course appeal to students outside of the main discipline of the course? * Include information on your experience in the intensive one-week interdisciplinary setting * Include evidence that the course proposer is an excellent lecturer 1. Information from workshop organizers: * Include information on relevant preceding meetings and events, if applicable * Include information about potential external funding for participants Submission Information By January 13, 2023: You are asked to submit in EasyChair at least the name(s) of the instructor(s), the ESSLLI area+course level and a short abstract. By January 20: Your submission must be completed by uploading a PDF with the actual proposal as detailed above. Submission Portal Please submit your proposals to https://urldefense.com/v3/__https://easychair.org/conferences/?conf=esslli2023__;!!IBzWLUs!VkcjEqQYvwKsMUYHwzbfRkweBHfiOpAr1ENbaVskWmxhTNAyXZZu82nhSUn4pr4r4U4sjyWX2mq_2N7jMrg3PTuqoXdp2wrNebjP6is$ Childcare If there is enough interest, ESSLLI will provide information on private child care services available during the summer school. EACSL Sponsorship The EACSL will support one Logic and Computation course or workshop addressing topics of interest to Computer Science Logic (CSL) conferences. The selected course or workshop will be designated an EACSL course/workshop in the programme. If you wish to be considered for this, please indicate so in your proposal. Organizing Committee Slavko ?itnik (University of Ljubljana) (chair) ?pela Vintar (University of Ljubljana) Timotej Knez (University of Ljubljana) Mojca Brglez (University of Ljubljana) Matej Klemen (University of Ljubljana) Ale? ?agar (University of Ljubljana) Program Committee Juha Kontinen (University of Helsinki) (chair) Kaja Dobrovoljc (University of Ljubljana) (local co-chair) Area Chairs Language and Computation (LaCo) Kilian Evang (Heinrich Heine University D?sseldorf) Miryam de Lhoneux (KU Leuven) Shane Steinert-Threlkeld (University of Washington) Area Chairs Language and Logic (LaLo) Ivano Ciardelli (University of Padua) Agata Renans (Ruhr-Universit?t Bochum) Jacopo Romoli (Heinrich Heine University D?sseldorf) Area Chairs Logic and Computation (LoCo) Natasha Alechina (Utrecht University) Alessandra Palmigiano (Vrije Universiteit Amsterdam) Lutz Stra?burger (Inria Saclay & ?cole Polytechnique) ESSLLI Steering Committee Darja Fiser (University of Ljubljana) (chair) Phokion Kolaitis (University of California, Santa Cruz) (vice-chair) Roman Kuznets (TU Wien) Petya Osenova (Bulgarian Academy of Sciences and Sofia University) (secretary) Jakub Szymanik (University of Amsterdam) From vincent.rahli at gmail.com Fri Oct 28 17:35:33 2022 From: vincent.rahli at gmail.com (vincent rahli) Date: Fri, 28 Oct 2022 22:35:33 +0100 Subject: [TYPES/announce] Postdoc position at the University of Birmingham Message-ID: Dear all, We would like to invite applications for an up to 3 years fully-funded postdoctoral position within the School of Computer Science at the University of Birmingham (see below for details on how to apply). The successful candidate will contribute to an EPSRC-funded project aiming at designing and formally verifying distributed systems, in particular Byzantine fault-tolerant distributed systems as used for example in blockchain technology. The start date is flexible, ideally early 2023. The environment: ---------------- The School of Computer Science has large and thriving Theory and Security research groups. Among our research interests related to this project are for example: - Formal verification - Proof assistants - Model checking - Blockchain Technology - Security & Privacy Both groups are very active, organising regular seminars, informal meetings, and actively participating in many events such as the Midlands Graduate School or the Cyber Security PhD Winter School. For more information see https://urldefense.com/v3/__https://www.birmingham.ac.uk/research/activity/computer-science/theory-of-computation/index.aspx__;!!IBzWLUs!SsBU8jzeb7Ri4jp5CtqTIN-gUh5ws5PVmfdk_l008d-sSn-OAbC6X35XnpcZQBwfeWKn5IupCrxw49Qta1V1t0iMoeJe913wK6jJcw$ and https://urldefense.com/v3/__https://www.birmingham.ac.uk/research/centre-for-cyber-security-and-privacy/index.aspx__;!!IBzWLUs!SsBU8jzeb7Ri4jp5CtqTIN-gUh5ws5PVmfdk_l008d-sSn-OAbC6X35XnpcZQBwfeWKn5IupCrxw49Qta1V1t0iMoeJe9101EC3pIg$ . How to apply: ------------- Interested people are encouraged to contact me by email (V.Rahli at bham.ac.uk) to discuss their research interests and details of the positions. Further information on how to apply is available here: https://urldefense.com/v3/__https://edzz.fa.em3.oraclecloud.com/hcmUI/CandidateExperience/en/sites/CX_6001/job/521/?utm_medium=jobshare__;!!IBzWLUs!SsBU8jzeb7Ri4jp5CtqTIN-gUh5ws5PVmfdk_l008d-sSn-OAbC6X35XnpcZQBwfeWKn5IupCrxw49Qta1V1t0iMoeJe9128nRwokA$ Best, Vincent Rahli -- https://urldefense.com/v3/__https://vrahli.github.io/__;!!IBzWLUs!SsBU8jzeb7Ri4jp5CtqTIN-gUh5ws5PVmfdk_l008d-sSn-OAbC6X35XnpcZQBwfeWKn5IupCrxw49Qta1V1t0iMoeJe9118X27sDQ$ -------------- next part -------------- An HTML attachment was scrubbed... URL: From pierre-marie.pedrot at inria.fr Sat Oct 29 15:52:59 2022 From: pierre-marie.pedrot at inria.fr (=?UTF-8?Q?Pierre-Marie_P=c3=a9drot?=) Date: Sat, 29 Oct 2022 21:52:59 +0200 Subject: [TYPES/announce] TYPES 2022 Last Post-proceeding CfP -- Extended Deadline Message-ID: <18b38d90-659e-23c5-5928-a1bc9adee2c4@inria.fr> FINAL CALL FOR CONTRIBUTIONS -- EXTENDED DEADLINE TYPES is a major forum for the presentation of research on all aspects of type theory and its applications. TYPES 2022 was held from 20 to 25 June at LS2N, University of Nantes, France. The post-proceedings volume will be published in LIPIcs, Leibniz International Proceedings in Informatics, an open-access series of conference. Submission Guidelines Submission is open to everyone, also to those who did not participate in the TYPES 2022 conference. We welcome high-quality descriptions of original work, as well as position papers, overview papers, and system descriptions. Submissions should be written in English, and being original, i.e. neither previously published, nor simultaneously submitted to a journal or a conference. - Papers have to be formatted with the current LIPIcs style and adhere to the style requirements of LIPIcs. - The upper limit for the length of submissions is 20 pages, excluding bibliography (but including title and appendices). - Papers have to be submitted as PDF via the EasyChair interface, accessible at https://easychair.org/conferences/?conf=posttypes2022 - The processing charge will be sponsored by the LS2N for up to 20 publications, given that these publications do not exceed the page limit. - Authors have the option to attach to their submission a zip or tgz file containing code (formalised proofs or programs), but reviewers are not obliged to take the attachments into account and they will not be published. Deadlines - Abstract Submission (extended): 14 November 2022 (AoE) - Paper submission: 30 November 2022 (AoE) - Author notification: 31 March 2023 (AoE) List of Topics The scope of the post-proceedings is the same as the scope of the conference: the theory and practice of type theory. In particular, we welcome submissions on the following topics: - Foundations of type theory; - Applications of type theory (e.g. linguistics or concurrency); - Constructive mathematics; - Dependently typed programming; - Industrial uses of type theory technology; - Meta-theoretic studies of type systems; - Proof assistants and proof technology; - Automation in computer-assisted reasoning; - Links between type theory and functional programming; - Formalising mathematics using type theory; - Homotopy type theory and univalent mathematics. Editors Delia Kesner, Universit? Paris Cit?, FR (delia.kesner at irif.fr) Pierre-Marie P?drot, INRIA, FR (pierre-marie.pedrot at inria.fr) Contact In case of questions, contact the editors directly. -------------- next part -------------- A non-text attachment was scrubbed... Name: OpenPGP_0x7922C01FD9BA3C7B.asc Type: application/pgp-keys Size: 4033 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 i.hasuo at acm.org Sun Oct 30 02:35:42 2022 From: i.hasuo at acm.org (Ichiro Hasuo) Date: Sun, 30 Oct 2022 15:35:42 +0900 Subject: [TYPES/announce] Postdoc & Scientific Programmer Positions in Tokyo Message-ID: [Please distribute, apologies for multiple postings.] Open Postdoc & Scientific Programmer Positions in Tokyo Hasuo Laboratory at the National Institute of Informatics , Tokyo, Japan invites applications for a scientific programmer and a postdoc researcher. The positions are funded by a JST ERATO project (scientific research) and a JST START project (practical development towards a research-oriented startup), and their scopes are largely the application of foundational research on logic and semantics to real-world problems. See below for the specific scope of each position. The positions are for ~2.5 years max. We are also constantly looking for PhD students. https://urldefense.com/v3/__https://group-mmm.org/eratommsd/call-for-students-ja/__;!!IBzWLUs!TFlcPMXSygs1uyMkZ3cDFTVaozt6ZEWvuji-pdNbWAMXKBdRqVEqr4iUzY7_4-wdk1NsywhboVjSTrusXj2F89a4ZHvj$ Thanks a lot for your consideration. Best, Ichiro ---- Position 1: PostDoc Researcher, Category Theory and Practical Model Checking Algorithms https://urldefense.com/v3/__https://group-mmm.org/eratommsd/postdoc-researcher-category-theory-and-practical-model-checking-algorithms-oct-2022/__;!!IBzWLUs!TFlcPMXSygs1uyMkZ3cDFTVaozt6ZEWvuji-pdNbWAMXKBdRqVEqr4iUzY7_4-wdk1NsywhboVjSTrusXj2F87q9uph3$ We aim to push the landscape of categorical studies (especially on coalgebras) to the modeling of state-of-the-art practical algorithms for formal verification (model checking, game solving, system abstraction, etc.). The position will be especially suited for researchers with coalgebraic and related backgrounds who want to see their results in action as practical verification algorithms. Key publications: - Kori et al., CAV'22 https://urldefense.com/v3/__https://link.springer.com/chapter/10.1007/978-3-031-13185-1_12__;!!IBzWLUs!TFlcPMXSygs1uyMkZ3cDFTVaozt6ZEWvuji-pdNbWAMXKBdRqVEqr4iUzY7_4-wdk1NsywhboVjSTrusXj2F8793XR6J$ - Komorida et al., LICS'21 https://urldefense.com/v3/__https://arxiv.org/abs/2105.10164__;!!IBzWLUs!TFlcPMXSygs1uyMkZ3cDFTVaozt6ZEWvuji-pdNbWAMXKBdRqVEqr4iUzY7_4-wdk1NsywhboVjSTrusXj2F80a4wpFf$ ---- Position 2: PostDoc Researcher, Theorem Proving for Automated Driving https://urldefense.com/v3/__https://group-mmm.org/eratommsd/postdoc-researcher-theorem-proving-for-automated-driving-oct-2022/__;!!IBzWLUs!TFlcPMXSygs1uyMkZ3cDFTVaozt6ZEWvuji-pdNbWAMXKBdRqVEqr4iUzY7_4-wdk1NsywhboVjSTrusXj2F8-XvAwjS$ We aim to develop a comprehensive set of techniques for proving the safety of automated driving. Its core consists of a custom-made program logic and its proof checker; however, elements outside conventional theorem proving studies will be pursued, too, such as heuristics for proof discoveries, implementation of safety proofs in automated driving cars, studying the roles of safety proofs in explainability and social acceptance of automated driving, etc. The position is highly recommended for theorem proving researchers who wish to apply their expertise to a hot application domain (namely automated driving), and furthermore, obtain novel theoretical insights in return from the real-world application. The commercialization of the research output is also planned, with the founding of a spin-off startup (cf. our call for a scientific programmer below). Key publication: - Hasuo et al., IEEE Trans. Intelligent Vehicles, to appear. https://urldefense.com/v3/__https://arxiv.org/abs/2207.02387__;!!IBzWLUs!TFlcPMXSygs1uyMkZ3cDFTVaozt6ZEWvuji-pdNbWAMXKBdRqVEqr4iUzY7_4-wdk1NsywhboVjSTrusXj2F82tBPpkZ$ ---- Position 3: Scientific Programmer towards a Research-Oriented Startup https://urldefense.com/v3/__https://group-mmm.org/eratommsd/open-position-for-a-scientific-programmer-towards-a-research-oriented-startup/__;!!IBzWLUs!TFlcPMXSygs1uyMkZ3cDFTVaozt6ZEWvuji-pdNbWAMXKBdRqVEqr4iUzY7_4-wdk1NsywhboVjSTrusXj2F81AQ0dzW$ A programmer position under government research funding towards a research-oriented startup. An excellent opportunity for those who value both the scientific pursuit of novelties and industrial and social impacts. We look for programmers with a formal logic background. Come join us on the venture! ====== 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!TFlcPMXSygs1uyMkZ3cDFTVaozt6ZEWvuji-pdNbWAMXKBdRqVEqr4iUzY7_4-wdk1NsywhboVjSTrusXj2F86jT7V9U$ -------------- next part -------------- An HTML attachment was scrubbed... URL: From Graham.Hutton at nottingham.ac.uk Mon Oct 31 07:24:09 2022 From: Graham.Hutton at nottingham.ac.uk (Graham Hutton) Date: Mon, 31 Oct 2022 11:24:09 +0000 Subject: [TYPES/announce] Journal of Functional Programming - Call for PhD Abstracts Message-ID: <7DD92DD6-9F68-43A5-AEB6-BF1CCA1D87BC@nottingham.ac.uk> Dear all, If you or one of your students recently completed a PhD (or Habilitation) in the area of functional programming, please submit the dissertation abstract for publication in JFP: simple process, no refereeing, open access, 200+ published to date, deadline 30th November 2022. Please share! Best wishes, Graham Hutton ============================================================ CALL FOR PHD ABSTRACTS Journal of Functional Programming Deadline: 30th November 2022 https://urldefense.com/v3/__http://tinyurl.com/jfp-phd-abstracts__;!!IBzWLUs!RixPQ6BDZjWeuzxDG-DU_8UzSAm-OPahEc9_9wPgq5gIhW0lqMqEVnWTbspq_fr6zGGZhCEQPlQLkyxq_u4QnIYnGkcTkq9-RWG2s1KCF2z8Dg$ ============================================================ PREAMBLE: Many students complete PhDs in functional programming each year. As a service to the community, twice per year the Journal of Functional Programming publishes the abstracts from PhD dissertations completed during the previous year. The abstracts are made freely available on the JFP website, i.e. not behind any paywall. They do not require any transfer of copyright, merely a license from the author. A dissertation is eligible for inclusion if parts of it have or could have appeared in JFP, that is, if it is in the general area of functional programming. The abstracts are not reviewed. Please submit dissertation abstracts according to the instructions below. We welcome submissions from both the student and the advisor/supervisor although we encourage them to coordinate. Habilitation dissertations are also eligible for inclusion. ============================================================ SUBMISSION: Please submit the following information to Graham Hutton by 30th November 2022. o Dissertation title: (including any subtitle) o Student: (full name) o Awarding institution: (full name and country) o Date of award: (month and year; depending on the institution, this may be the date of the viva, corrections being approved, graduation ceremony, or otherwise) o Advisor/supervisor: (full names) o Dissertation URL: (please provide a permanently accessible link to the dissertation if you have one, such as to an institutional repository or other public archive; links to personal web pages should be considered a last resort) o Dissertation abstract: (plain text, maximum 350 words; you may use \emph{...} for emphasis, but we prefer no other markup or formatting; if your original abstract exceeds the word limit, please submit an abridged version within the limit) Please do not submit a copy of the dissertation itself, as this is not required. JFP reserves the right to decline to publish abstracts that are not deemed appropriate. ============================================================ PHD ABSTRACT EDITOR: Graham Hutton School of Computer Science University of Nottingham Nottingham NG8 1BB United Kingdom ============================================================ This message and any attachment are intended solely for the addressee and may contain confidential information. If you have received this message in error, please contact the sender and delete the email and attachment. Any views or opinions expressed by the author of this email do not necessarily reflect the views of the University of Nottingham. Email communications with the University of Nottingham may be monitored where permitted by law. From sam.staton at cs.ox.ac.uk Mon Oct 31 13:20:16 2022 From: sam.staton at cs.ox.ac.uk (Sam Staton) Date: Mon, 31 Oct 2022 17:20:16 +0000 Subject: [TYPES/announce] LICS 2023 Call for Papers and Call for Workshop Proposals Message-ID: CALL FOR PAPERS and WORKSHOP PROPOSALS. Here is both a call for papers (18/23 Jan) and a call for workshop proposals (30 Nov) for LICS 2023 (June 2023). Thirty-Eighth Annual ACM/IEEE Symposium on LOGIC IN COMPUTER SCIENCE (LICS) Boston, June 2023 https://urldefense.com/v3/__https://lics.siglog.org/lics23__;!!IBzWLUs!SkO8KWNERUAYRSAGdGrWU-J_M20ZcZsiXlZB2-WvCyL4by3nx7T7QyQl84fO46WSpKIQvzz5BDwYu5jBmc9JA89_znLibUL3iV1r3Q$ SCOPE The LICS Symposium is an annual international forum on theoretical and practical topics in computer science that relate to logic, broadly construed. We invite submissions on topics that fit under that rubric. Suggested, but not exclusive, topics of interest include: automata theory, automated deduction, categorical models and logics, concurrency and distributed computation, constraint programming, constructive mathematics, database theory, decision procedures, description logics, domain theory, finite model theory, formal aspects of program analysis, formal methods, foundations of computability, foundations of probabilistic, real-time and hybrid systems, games and logic, higher-order logic, knowledge representation and reasoning, lambda and combinatory calculi, linear logic, logic programming, logical aspects of AI, logical aspects of bioinformatics, logical aspects of computational complexity, logical aspects of quantum computation, logical frameworks, logics of programs, modal and temporal logics, model checking, process calculi, programming language semantics, proof theory, reasoning about security and privacy, rewriting, type systems, type theory, and verification. IMPORTANT DATES FOR PAPERS Authors are required to submit a paper title and a short abstract of about 100 words in advance of submitting the extended abstract of the paper. The exact deadline time on these dates is given by anywhere on earth (AoE). Titles and Short Abstracts Due: 18 January 2023 Full Papers Due: 23 January 2023 Author Feedback/Rebuttal Period: 15-19 March 2023 Author Notification: 5 April 2023 Conference: 26-29 June 2023. Submission deadlines are firm; late submissions will not be considered. All submissions will be electronic via easychair. PAPER SUBMISSION INSTRUCTIONS Every full paper must be submitted in the IEEE Proceedings 2-column 10pt format and may be at most 12 pages, excluding references. Latex style files and further submission information is at https://urldefense.com/v3/__https://lics.siglog.org/lics23/cfp.php__;!!IBzWLUs!SkO8KWNERUAYRSAGdGrWU-J_M20ZcZsiXlZB2-WvCyL4by3nx7T7QyQl84fO46WSpKIQvzz5BDwYu5jBmc9JA89_znLibULJ-HsXyg$ . LICS 2023 will use a lightweight double-blind reviewing process. Please see the website for further details and requirements from the double-blind process. The official publication date may differ from the first day of the conference. The official publication date may affect the deadline for any patent filings related to published work. We will clarify the official publication date in due course. -- LICS 2023 Call for Workshop Proposals Researchers and practitioners are invited to submit proposals for workshops on topics relating logic -- broadly construed -- to computer science or related fields. Typically, LICS workshops feature a number of invited speakers and a number of contributed presentations. LICS workshops do not usually produce formal proceedings. However, in the past there have been special issues of journals based in part on certain LICS workshops. Proposals should include: - A short scientific summary and justification of the proposed topic. This should include a discussion of the particular benefits of the topic to the LICS community. - Potential invited speakers. - Procedures for selecting participants and papers. - Plans for dissemination (for example, special issues of journals). - The proposed duration, which is one or two days. - A discussion of the proposed format and agenda. - Expected number of participants, providing data on previous years if the workshop has already been organised in the past. Proposals should be sent to Valentin Blot: lics23-workshops at valentinblot.org IMPORTANT DATES FOR WORKSHOP PROPOSALS - Submission deadline: November 30, 2022 - Notification: mid-December, 2022 - Program of the workshops ready: May 24, 2023 - Workshops: June 24-25, 2023 - LICS conference: June 26-29, 2023 The workshops selection committee consists of the LICS Workshops Chair, the LICS General Chair, the LICS PC Chair and the LICS Conference Chair. From miltner at sfu.ca Mon Oct 31 22:11:49 2022 From: miltner at sfu.ca (Anders Miltner) Date: Tue, 1 Nov 2022 02:11:49 +0000 Subject: [TYPES/announce] PLDI 2023 Second Call for Papers Message-ID: <54F7849B-CD38-4A90-8280-480AB1F39391@sfu.ca> Please distribute widely. *Call for Papers* ==================== 2023 ACM Conference on Programming Language Design and Implementation (PLDI) Mon 19 - Wed 21 June 2023 Orlando, Florida, United States https://urldefense.com/v3/__https://pldi23.sigplan.org/track/pldi-2023-pldi*Call-for-Papers__;Iw!!IBzWLUs!QUT-7RCSC4_D-iHh79zd_WP7MqLwgzzDj9_vn8c6C3zWNQA_sn_tRZm7_5arH7hKfTfHytEltPDqsZa8_i1Ceu8WlX8FXA$ PACMPL Issue PLDI 2023 seeks contributions on all aspects of programming languages research, broadly construed, including design, implementation, theory, applications, and performance. Authors of papers published in PACMPL Issue PLDI 2023 will be invited to present their work in the PLDI conference in June 2023, which is sponsored by ACM SIGPLAN. *Important Dates* =============== Thu 10 Nov 2022, Submission Deadline Mon 6 Feb - Wed 8 Feb 2023, Author Response Fri 24 Feb 2023, Author Notification *Author Instructions* ================== https://urldefense.com/v3/__https://pldi23.sigplan.org/track/pldi-2023-pldi*Call-for-Papers__;Iw!!IBzWLUs!QUT-7RCSC4_D-iHh79zd_WP7MqLwgzzDj9_vn8c6C3zWNQA_sn_tRZm7_5arH7hKfTfHytEltPDqsZa8_i1Ceu8WlX8FXA$ Submission site: https://urldefense.com/v3/__https://pldi2023.hotcrp.com/__;!!IBzWLUs!QUT-7RCSC4_D-iHh79zd_WP7MqLwgzzDj9_vn8c6C3zWNQA_sn_tRZm7_5arH7hKfTfHytEltPDqsZa8_i1Ceu8zobThSg$ *Organizing Committee* ==================== - General Chair: Steve Blackburn, Google and Australia National U. - Program Chair: Nate Foster, Cornell U. - Web Co-Chairs: - Dan Barowy, Williams College - Jedidiah McClurg, Colorado State U. - Publicity Co-Chairs: - William J. Bowman, U. of British Columbia - Anders Miltner, Simon Fraser U. - Sponsorship Co-Chairs: - Sasa Misailovic, U. of Illinois at Urbana-Champaign - Deian Stefan, U. of California at San Diego - Workshops Co-Chairs: - Nadia Polikarpova, U. of California at San Diego - Zachary Tatlock, U. of Washington - Student Research Competition Co-Chairs: - Chandrakana Nandi, Certora - Jubi Taneja, Microsoft Research - Artifact Evaluation Co-Chairs: - Manuel Rigger, National U. of Singapore - Xinyu Wang, U. of Michigan - Diversity and Inclusion Co-Chairs: - Madan Musuvathi, Microsoft Research - Fernando Magno Quint?o Pereira, Federal U. of Minas Gerais - Social Events Co-Chairs: - Rachit Nigam, Cornell U. - Alex Renda, Massachusetts Institute of Technology - Video Chair: Guilherme Espada, U. de Lisboa - Volunteers Co-Chairs: - Hanneli Tavante, McGill U. - Michael James, U. of California at San Diego https://urldefense.com/v3/__https://pldi23.sigplan.org/committee/pldi-2023-organizing-committee__;!!IBzWLUs!QUT-7RCSC4_D-iHh79zd_WP7MqLwgzzDj9_vn8c6C3zWNQA_sn_tRZm7_5arH7hKfTfHytEltPDqsZa8_i1Ceu9sT4C0jQ$ -- Anders Miltner -------------- next part -------------- An HTML attachment was scrubbed... URL: From David.Delahaye at lirmm.fr Tue Nov 1 05:50:39 2022 From: David.Delahaye at lirmm.fr (David Delahaye) Date: Tue, 1 Nov 2022 10:50:39 +0100 Subject: [TYPES/announce] Recruitment of a research engineer in automated proof at LIRMM in Montpellier (France) Message-ID: <8006af1e-d4b6-31a8-7280-98120031b438@lirmm.fr> *** Please feel free to circulate this message *** *** Sorry for the multiple receptions *** The LIRMM (UMR 5506, University of Montpellier, CNRS) is recruiting a full-time research engineer for a period of 12 months in the field of automated proof. The desired start date is January 1, 2023, and the position will be located in Montpellier (France). *Assignments:* The purpose of this position is to strengthen the software development capabilities of the MaREL team (specialized in the field of software engineering) of the Computer Science department of LIRMM. The person hired will be involved in the development of Go?land, an automated reasoning tool developed in the team by Julie Cailler (PhD student) for over a year. This tool is based upon a new proof search procedure for first-order logic, which leverages concurrency to produce proofs in the context of the tableaux method. This tool currently gives excellent results (as measured by the number of solved problems) in comparison with similar tools. Notably, it achieves better results in some problem categories than similar (tableaux-based) tools, some of which have been established for years. A conference article on Go?land has been accepted for publication at IJCAR 2022, a rank A conference, demonstrating the interest of the community for the approach used by that tool. Furthermore, Go?land has taken part in the CASC-J11 competition, organized in parallel with IJCAR 2022, and in which the current best automated deduction tools compete on different sets of problems. The tool has been awarded the ?best newcomer? distinction during this competition. The hired person will participate in the development and maintenance of the Go?land software, which is developed using Go, a language suited to concurrent programming. The aim of this position is twofold. The first mission is to get the tool in working for competitions, particularly CASC, a yearly occurrence that serves as a display of our work. The second is to apply the tool in a more industrial setting. A benchmark of problems originating from the modeling of industrial applications with the B method is already available (as a result of the ANR project Bware) but a number of extensions to Go?land are needed before it can be used on this benchmark. In more detail, the assignments of the hired person will include: * Improving tests for proof search with equality. Equality reasoning is implemented but further testing is required for validation. * Integrating polymorphism in the proof search. Proof search with polymorphic types has been developed recently, but this feature has yet to be integrated and also requires tests for validation. * Integrating linear arithmetic reasoning in the proof search. Currently, the simplex method (for problems involving rational numbers) and the branch and cut algorithm (for problems involving integers) have been developed but their integration and testing remain to be done. * Testing the tool on the whole TPTP problems collection. This library of problems is used in particular for the CASC competition. * Testing the tool on the benchmark of industrial problems taken from the ANR project BWare . This test can only be carried out after the integration of polymorphism and linear reasoning in the tool. *Activities:* The hired person will work under the direction of David Delahaye (PR/full professor in the team MaREL), Simon Robillard (MCF/associate professor in the team MaREL), and Julie Cailler (PhD student in the team MaREL, with a thesis on the topic, and the main developer of Go?land). The technical program follows the assignments described in the previous section. The order of assignments is not critical, with the exception of tests on the BWare benchmarks, for which the integration of polymorphism and linear arithmetic reasoning are prerequisites. *Skills:* The candidate must demonstrate the following: * High motivation for exploratory work in coordination with researchers * Familiarity with the notions of proof and proof search * Familiarity with concurrent programming (regardless of the programming language) * Aptitude for collaborative development and version management using Git * Experience with Agile project management * Excellent aptitude to work in collaboration and to engage external users * Fluency in English, both written and oral, for the purpose of scientific communication * Basic knowledge of French, with the intent to learn the language * Autonomy and initiative, aptitude to make technical decisions and justify them in the context of the project * Affinity for open-source software development *Context:* LIRMM (Laboratoire d'Informatique, de Robotique et de Micro?lectronique de Montpellier) is a research department (/unit? mixte de recherche/) headed by CNRS and the University of Montpellier. It hosts 410 employees, including 192 permanent positions. It is organized in three divisions: Computer Science, Robotics and Micro-Electronics, as well as centralized services, among which the Research Support Service (SAR, comprising 16 engineers) that provides technical support for research projects and manages the technology platforms of the department. The hired engineer will join this service and provide support for researchers in the department. The research topics of the Computer Science division cover a large spectrum ranging from the foundations of computer science (algorithms, computation, data science, software engineering, AI) to inter-disciplinary research (environment, health, biology). This division hosts 106 permanent positions (researchers, teacher-researchers and engineers) and 71 PhD students in 15 teams. The hired person will more specifically join the MaREL team. *Contact :* To have more information about this position, contact the following people: * David Delahaye (_David.Delahaye at lirmm.fr _). * Simon Robillard (_Simon.Robillard at lirmm.fr _). *Link to apply:* To submit your application, please follow the following link (application closes 11/24/2022 at 11:59pm): https://urldefense.com/v3/__https://umemplois.umontpellier.fr/poste/2022-R0458__;!!IBzWLUs!WkgMmw02pADbv6KDuTlJjqRekA85izjkoEmpeQI4O_rQshCuFqb_yKfihCeIZ7-lu8mxjknG3xmxDKWcxYNV-NBcgVeYF9NHMn4OoI8k$ -- 7.5.8 - 27/08/2021 David DELAHAYE Professor Head of the Computer Science Departement Faculty of Sciences LIRMM UMR 5506 Bt. 4 ? CC477 ? 161 rue Ada 34095 Montpellier Cedex 5 ? France Phone: +33 (0)4 67 41 86 01 David.Delahaye at lirmm.fr https://urldefense.com/v3/__http://www.lirmm.fr/*delahaye/__;fg!!IBzWLUs!WkgMmw02pADbv6KDuTlJjqRekA85izjkoEmpeQI4O_rQshCuFqb_yKfihCeIZ7-lu8mxjknG3xmxDKWcxYNV-NBcgVeYF9NHMgOHU4LC$ UNIVERSIT? DE MONTPELLIER D?partement Informatique Bt. 16 ? CC 12 ? Place Eug?ne Bataillon 34095 Montpellier cedex 05 ? France informatique-fds.edu.umontpellier.fr <#> <#> <#> <#> <#> -------------- next part -------------- An HTML attachment was scrubbed... URL: -------------- next part -------------- A non-text attachment was scrubbed... Name: efafloidipjajnae.png Type: image/png Size: 2928 bytes Desc: not available URL: -------------- next part -------------- A non-text attachment was scrubbed... Name: idbcikidnpnmicih.png Type: image/png Size: 85 bytes Desc: not available URL: From noam.zeilberger at gmail.com Tue Nov 1 17:41:37 2022 From: noam.zeilberger at gmail.com (Noam Zeilberger) Date: Tue, 1 Nov 2022 22:41:37 +0100 Subject: [TYPES/announce] 16th Workshop on Computational Logic and Applications: call for talk proposals Message-ID: It is our pleasure to announce that the 16th workshop on Computational Logic and Applications will be held in January 2023, as a hybrid workshop at Ecole Polytechnique (south of Paris) and online. Workshop dates: 12-13 January 2023. Overview and scope ================== Started in 2002, the CLA workshops (https://urldefense.com/v3/__https://cla.tcs.uj.edu.pl/__;!!IBzWLUs!QBYDOrctlQeiXUzt4G3rHOsaEdk7g2n3WNqm5JW6If17KHVna-ZRnfovv_m52WZxGk_Kjut95EfKzz2n7y6gXM-r3dGT-tXI6ijs_6iV$ ) provide an open, free access forum for interdisciplinary research concentrated around combinatorial and quantitative aspects of mathematical logic and their applications in computer science. Topics within the scope of CLA include: - combinatorics of lambda calculus, sequent calculi, and related logical formalisms, as well as their interactions with the combinatorics of maps and related objects; - combinatorics of lattices derived from logic or rewriting; - asymptotic enumeration and statistical properties of formulae, types, proofs, programs, etc.; - quantitative aspects of program evaluation and normalisation; - random generation with applications to logic and programming; - randomness in software testing and counter-example generation. Submission ========== Talk proposals should consist of short abstracts of up to three pages, and may describe either ongoing or previously published work. Submissions should be sent by email to the organizers (see below). Depending on the number of submissions, contributed talks will be 20-30 minutes long. Organizing and Programme Committee ================================== - Olivier Bodini - Alain Giorgetti - Noam Zeilberger Important dates =============== - Submission deadline: November 30, 2022 (AoE) - Notification: December 7, 2022 (AoE) - Registration deadline for in-person attendance: December 16, 2022 - Registration deadline for online attendance: January 9, 2023 - Workshop: January 12-13, 2023 -------------- next part -------------- An HTML attachment was scrubbed... URL: From s.lasota at uw.edu.pl Thu Nov 3 18:01:29 2022 From: s.lasota at uw.edu.pl (=?UTF-8?Q?S=C5=82awomir_Lasota?=) Date: Thu, 3 Nov 2022 23:01:29 +0100 Subject: [TYPES/announce] Postdoc position in automata and concurrency theory, at the University of Warsaw Message-ID: We invite applications of motivated and research-focused individuals to carry out research on Petri nets and their extensions as part of the NCN project "Data-enriched models of computation". The project aims at advancing theoretical foundations at the borderline between automata theory, concurrency and formal verification. The successful candidate will be hosted by the automata theory group at the University of Warsaw, offering a vibrant working atmosphere, and exciting and challenging research problems. ************************************************************************** - Application deadline: November 30, 2022 - Starting date: flexible - Duration: one year, possible extension to another year - Principal investigator: Slawomir Lasota (https://urldefense.com/v3/__http://www.mimuw.edu.pl/*sl__;fg!!IBzWLUs!Teyogg7Xi7WiQvgI177N8amJu29J6mt7iUfhFa5eIgg7cjoBRFFDfPKjLQmW7vXJV6WdpQ_pb3RJ2vwIv1akIHwe9uuYicML7w$ ) - Contact: sl at mimuw.edu.pl ************************************************************************** Further details: https://urldefense.com/v3/__https://www.mimuw.edu.pl/*sl/2022-postdoc-recr.txt__;fg!!IBzWLUs!Teyogg7Xi7WiQvgI177N8amJu29J6mt7iUfhFa5eIgg7cjoBRFFDfPKjLQmW7vXJV6WdpQ_pb3RJ2vwIv1akIHwe9uv7MAn2JA$ -------------- next part -------------- An HTML attachment was scrubbed... URL: From catherine.dubois at ensiie.fr Fri Nov 4 04:17:54 2022 From: catherine.dubois at ensiie.fr (Catherine DUBOIS) Date: Fri, 4 Nov 2022 09:17:54 +0100 Subject: [TYPES/announce] Extended Deadline 11 November 2022 - Formal Methods Teaching Workshop (FMTea 2023) Call for Paper - Message-ID: <2ea01e43-7ccc-07d9-f1fe-3395638c59cc@ensiie.fr> [apologies for cross-postings] ** *# Formal Methods Teaching Workshop (FMTea 2023)* * 6 March 2023 --- Affiliated with Formal Methods 2023 INVITED SPEAKER Erika Abraham, RWTH Aachen (Title to be announced) IMPORTANT DATES * 11 November 2022 : NEW Deadline for submission of papers * 5 December 2022: Notifications to authors * 5 January 2023: Deadline for camera-ready version * 6 March 2023: FMTea 2023 Workshop OBJECTIVES AND SCOPE Formal Methods provide software engineering with tools and techniques for rigorously reasoning about the correctness of systems. While in recent years formal methods are increasingly being used in industry, university curricula are not adapting at the same pace. Some existing formal methods classes interest and challenge students, whereas others fail to ignite student motivation. It is thus important to develop, share, and discuss approaches to effectively teach formal methods to the next generations. This discussion is now more important than ever due to the challenges and opportunities that arose from the pandemic, which forced many educators to adapt and deliver their teaching online. Exchange of ideas is critical to making these new online approaches a success and having a greater reach. We envision this event as a one-day combination of keynote and workshop presentations, where various models of teaching are presented and explored, together with innovative approaches relevant for educators of Formal Methods in the 21st century. More details can be found on our website: https://urldefense.com/v3/__https://fmtea.github.io__;!!IBzWLUs!QiuyZjIaQ-BTl2WxuMo-J5gDJvqqBicnFGFWJotTnF-lbnTWAHj_QU-7_7dL95ii-ccC6RRXH-_-4pZGkdfZdbfqdFNJM9kUGRDupw5DN4Q$ TOPICS We aim to attract papers detailing authors? experiences with FM Teaching. We would like to get papers discussing successes and failures of various methods, case studies, tools, etc. As self-learning seems to be an important aspect of FM teaching, we appreciate experiences with online teaching, including experiences with teaching formal methods via MOOCs. A non-exhaustive list of topics of interest for the FMTea23 workshop is below: * Experiences and proposals related with ?traditional? FM learning and teaching * Experiences and proposals related with online FM learning and teaching * Integrating/embedding FM teaching/thinking within other computer science courses * Teaching FM for industry * Student projects on FM, including group projects * Innovative learning and teaching methods for FM Computer science is transforming into a rigorous engineering discipline. Improved teaching techniques will ensure that FM is at the heart of this transformation process. ORGANIZATION FMTea 2023 is organized by FME?s Teaching Committee. Our broad aim is to support a worldwide improvement in learning Formal Methods, mainly by teaching but also via self-learning. To that end, we have already gathered a list of FM courses taught worldwide (https://urldefense.com/v3/__https://fme-teaching.github.io__;!!IBzWLUs!QiuyZjIaQ-BTl2WxuMo-J5gDJvqqBicnFGFWJotTnF-lbnTWAHj_QU-7_7dL95ii-ccC6RRXH-_-4pZGkdfZdbfqdFNJM9kUGRDu3K4BiEk$ ) and plan to collect other resources as well, such as FM case studies, FM inspirational papers, etc. Furthermore, the FME Teaching Committee coordinates a tutorial series, held online via zoom. Tutorials are collected on the FME Teaching Committee website (https://urldefense.com/v3/__https://fme-teaching.github.io/__;!!IBzWLUs!QiuyZjIaQ-BTl2WxuMo-J5gDJvqqBicnFGFWJotTnF-lbnTWAHj_QU-7_7dL95ii-ccC6RRXH-_-4pZGkdfZdbfqdFNJM9kUGRDumtd5nHs$ ). PROGRAM COMMITTEE ** * Catherine Dubois (co-chair), ENSIIE, France * Pierluigi San Pietro (co-chair), Politecnico di Milano, Italy * Brijesh Dongol, University of Surrey, UK * Luigia Petre, ?bo Akademi University, Finland * Kristin Rozier, Iowa State University, US * Graeme Smith, The University of Queensland, Australia * Claudio Menghi, McMaster University, Canada * Jo?o F. Ferreira, INESC-ID & IST, University of Lisbon, Portugal * Alexandra Mendes, INESC TEC & University of Beira Interior, Portugal * Sandrine Blazy, University of Rennes 1, France * Jos? N. Oliveira, University of Minho, Portugal * Emil Sekerinski, McMaster University, Canada PREVIOUS EDITIONS Several events focused on teaching aspects for Formal Methods were held at the beginning of the 2000s: two BCS-FACS TFM workshops (Oxford in 2003 and London in 2006), the TFM 2004 conference in Ghent (with proceedings published as Springer LNCS Volume 3294), the FM-Ed 2006 workshop (Hamilton, co-located with FM'06), FORMED (Budapest, at ETAPS 2008), FMET 2008 (Kitakyushu 2008, co-located with ICFEM), and TFM 2009 (Eindhoven, at FM 2009 with proceedings published as Springer LNCS Volume 5846). The first? FMTea event was FMTea 2019, the Formal Methods Teaching Workshop and Tutorial, in October 2019 in Porto, Portugal, affiliated with the 3rd World Congress on Formal Methods (FM19) with proceedings as Springer LNCS 11758. The FMTea 2021 workshop, affiliated with FM 2021, the 24th International Symposium on Formal Methods, Beijing, was held only online? in November 2021, with proceedings published as Springer LNCS 13122. SUBMISSION DETAILS FMTea 2023 invites high quality papers reporting on opinions, approaches, and experiences related to the topic of teaching Formal Methods. Each submitted paper will be reviewed by at least three PC members. The conference proceedings will be published in Springer's Lecture Notes in Computer Science series. All submissions must be original, unpublished, and not submitted for publication elsewhere. Submissions must be in PDF format, using the Springer LNCS style files; we suggest to use the LaTeX2e package (the llncs.cls class file, available in llncs2e.zip and the typeinst.dem available in typeinst.zip as a template for your contribution). Papers should not exceed 15 pages in length. Submissions should be made using the FMTea 2023 Easychair web site: https://urldefense.com/v3/__https://easychair.org/conferences/?conf=fmtea2023__;!!IBzWLUs!QiuyZjIaQ-BTl2WxuMo-J5gDJvqqBicnFGFWJotTnF-lbnTWAHj_QU-7_7dL95ii-ccC6RRXH-_-4pZGkdfZdbfqdFNJM9kUGRDuzvTZp7U$ All accepted papers must be presented at the workshop. Their authors must be prepared to sign a copyright transfer statement. At least one author of each accepted paper must register to the conference by an early date, to be indicated by the FM2023 organizers, and present the paper. * -- Catherine Dubois, professor ENSIIE, lab. Samovar -------------- next part -------------- An HTML attachment was scrubbed... URL: -------------- next part -------------- A non-text attachment was scrubbed... Name: catherine_dubois.vcf Type: text/vcard Size: 4 bytes Desc: not available URL: From yegor256 at gmail.com Mon Nov 7 05:47:12 2022 From: yegor256 at gmail.com (Yegor Bugayenko) Date: Mon, 7 Nov 2022 13:47:12 +0300 Subject: [TYPES/announce] CFP IEEE 3rd International Conference on Code Quality (ICCQ'23) Message-ID: Name: 3nd International Conference on Code Quality (ICCQ) Date: April 22, 2023 Venue: St. Petersburg State University, Russia Website: https://urldefense.com/v3/__https://www.iccq.ru/2023.html__;!!IBzWLUs!RBa7iE0oLz2Kus-Znm_prx0nfdOiQzO0BHQytW601W4MDaVZ_QHf1DNM65ZMDrM51sy2Hop75gFlrVhxxcdDakXnKiwBh3s$ Published by: IEEE Xplore (in cooperation with IEEE Computer Society) We believe that the quality of the source code that millions of programmers write every day could be much higher than it is now. We believe that the contribution computer science can make to improve this situation is greatly undervalued. We aim to solve this problem by gathering together cutting-edge researchers and letting them share their most recent ideas on static analysis, program verification, bug detection, and software maintenance. Due to the pandemic situation, the conference will be held in online mode: all speakers will present their work remotely over Zoom. IMPORTANT DATES Paper/abstract submission: 18 Dec 2022 (anywhere on Earth) Author notification: 1 Mar 2023 Camera-ready submissions: 25 Mar 2023 Conference: 22 Apr 2023 PROGRAM COMMITTEE Andrey Terekhov (Chair), SPbU Alexandre Bergel, University of Chile Laura M. Castro, Universidade da Coru?a Stephen Chang, UMass Boston Daniele Cono D'Elia, Sapienza University of Rome Pierre Donat-Bouillud, Czech Technical University Bernhard Egger, Seoul National University Samir Genaim, Universidad Complutense de Madrid Shachar Itzhaky, Technion Yusuke Izawa, Tokyo Institute of Technology Ranjit Jhala, University of California, San Diego Tetsuo Kamina, Oita University Christoph Kirsch, University of Salzburg Yu David Liu, Binghamton University Wolfgang de Meuter, Vrije Universiteit Brussel Antoine Min?, Sorbonne Universit? Guillermo Polito, CRIStAL Xuehai Qian, University of Southern California Junqiao Qiu, Michigan Technological University Yudai Tanabe, Tokyo Institute of Technology Tachio Terauchi, Waseda University Didier Verna, EPITA David West, New Mexico Highlands University Guannan Wei, Purdue University Vadim Zaytsev, University of Twente PUBLICATIONS We consider the following criteria when evaluating papers. Novelty: The paper presents new ideas and results and places them appropriately within the context established by previous research. Importance: The paper contributes to the advancement of knowledge in the field. We also welcome papers that diverge from the dominant trajectory of the field. Evidence: The paper presents sufficient evidence supporting its claims, such as proofs, implemented systems, experimental results, statistical analyses, case studies, and anecdotes. Clarity: The paper presents its contributions, methodology, and results clearly. Papers will be reviewed by three PC members using a double-blind review process. Submissions must be in PDF, printable in black and white on US Letter sized paper. All submissions must adhere to the ACM Small template (sigplan, two columns, 11pt font size). Submitted papers must be at least 4 and at most 16 pages long, including bibliographical references and appendices. Please, submit via EasyChair: https://urldefense.com/v3/__https://easychair.org/cfp/iccq23__;!!IBzWLUs!RBa7iE0oLz2Kus-Znm_prx0nfdOiQzO0BHQytW601W4MDaVZ_QHf1DNM65ZMDrM51sy2Hop75gFlrVhxxcdDakXnlkYadPU$ SPONSORS ICCQ is sponsored by St. Petersburg University, Innopolis University, HSE, MIPT, MSU, Yandex, Kaspersky, SberCloud, Huawei and others. QUESTIONS? If any questions, please email to team at iccq.ru -------------- next part -------------- An HTML attachment was scrubbed... URL: From Luke.Ong at cs.ox.ac.uk Mon Nov 7 08:18:17 2022 From: Luke.Ong at cs.ox.ac.uk (Luke Ong) Date: Mon, 7 Nov 2022 21:18:17 +0800 Subject: [TYPES/announce] Fwd: Postdoc positions in Probabilistic Programming, in Singapore In-Reply-To: References: Message-ID: We invite motivated and well-qualified researchers to work on Bayesian Statistical Probabilistic Programming, as part of a research programme funded by the National Research Foundations, Singapore. The appointees will be hosted by the School of Computer Science and Engineering, Nanyang Technological University, Singapore. ************************************************************************** - Application deadline: November 30, 2022 - Starting date: flexible - Duration: 2 years, possible extension up to 5 years - Principal investigator: Luke Ong - Contact: luke.ong at ntu.edu.sg ************************************************************************** Further details: https://urldefense.com/v3/__https://www3.ntu.edu.sg/home/luke.ong/Vacancies/index.html__;!!IBzWLUs!TONVbAL0Zcd7y0HgjcNNaE5mQkVv-Oc0APd_f2fD2PMZl-tZ5BRnzZl7GJZqOB8Va1E96f66HRM5HdeJnPbqAQwZeaqhxJ_OOWM$ -------------- next part -------------- An HTML attachment was scrubbed... URL: From nobuko.yoshida at cs.ox.ac.uk Mon Nov 7 11:45:10 2022 From: nobuko.yoshida at cs.ox.ac.uk (Nobuko Yoshida) Date: Mon, 7 Nov 2022 16:45:10 +0000 Subject: [TYPES/announce] PhD studentship at University of Oxford Message-ID: Fully Funded Doctoral Studentship in Foundations of Concurrent and Distributed Computing and Programming Languages Student fee status: Home Supervisor: Prof. Nobuko Yoshida, Christopher Strachey Chair of Computing, University of Oxford (nobuko.yoshida at cs.ox.ac.uk) Start Date: October 2023 Closing Date: 19th December noon Reference: 22-CS-NY Application: https://urldefense.com/v3/__https://www.ox.ac.uk/admissions/graduate/courses/dphil-computer-science__;!!IBzWLUs!UWJcaXqLx3YTMGevuS2gCSngDBChIHGB38G3dVpIX-btS8ZWBk9Y3IHnchUNqj18h2pPGnmefOMrlhDUqxNuNHhZUSQeTGpKCqlQB5NaxDU$ The Department of Computer Science at the University of Oxford is offering one fully funded DPhil studentship for home students in the Programming Languages theme under the supervision of Prof. Nobuko Yoshida, to commence next academic year (October 2023). The successful applicant will join the Programming Languages team, an internationally-leading research group who study foundational aspects of concurrent computing, programming language semantics, design and implementation. The successful candidate will have the opportunity to collaborate with other members of the team and of the department. Prof. Yoshida's interests focus on foundational aspects of concurrent and distributed computing, design and implementation of actor programming, verifications, type theories of programming language, specifically, session types. Please see the links for more information about Prof Yoshida's work (https://urldefense.com/v3/__http://mrg.doc.ic.ac.uk/__;!!IBzWLUs!UWJcaXqLx3YTMGevuS2gCSngDBChIHGB38G3dVpIX-btS8ZWBk9Y3IHnchUNqj18h2pPGnmefOMrlhDUqxNuNHhZUSQeTGpKCqlQs3jTC8U$ ). The studentship will provide an annual stipend (at the UKRI rate) at least ?17668 per annum for 3.5 years (42 months). The studentship will also cover the costs of course tuition fees at home level. Research students in the Department of Computer Science are also provided with a fund for travel to conferences and workshops (subject to approval). Applicants must satisfy the usual requirements for studying for a doctorate at Oxford, and apply for admission via the DPhil in Computer Science (https://urldefense.com/v3/__https://www.ox.ac.uk/admissions/graduate/courses/dphil-computer-science__;!!IBzWLUs!UWJcaXqLx3YTMGevuS2gCSngDBChIHGB38G3dVpIX-btS8ZWBk9Y3IHnchUNqj18h2pPGnmefOMrlhDUqxNuNHhZUSQeTGpKCqlQB5NaxDU$ ), quoting studentship reference 22-CS-NY. Candidates are expected to have a strong computational and/or mathematical background, with undergraduate studies in Computer Science, Engineering, Physics, Mathematics or related disciplines. Candidates must also have good writing, communication and presentation skills (see the University's web pages on the DPhil in Computer Science (https://urldefense.com/v3/__https://www.ox.ac.uk/admissions/graduate/courses/dphil-computer-science__;!!IBzWLUs!UWJcaXqLx3YTMGevuS2gCSngDBChIHGB38G3dVpIX-btS8ZWBk9Y3IHnchUNqj18h2pPGnmefOMrlhDUqxNuNHhZUSQeTGpKCqlQB5NaxDU$ ) for details). For further information or for informal discussions about suitability, please contact Prof Yoshida (nobuko.yoshida at cs.ox.ac.uk). For further information about the studentship or the application process, please e-mail Computer Science Graduate Admissions (graduate.admissions at cs.ox.ac.uk). -------------- next part -------------- An HTML attachment was scrubbed... URL: From james.cheney at gmail.com Mon Nov 7 16:56:18 2022 From: james.cheney at gmail.com (James Cheney) Date: Mon, 7 Nov 2022 21:56:18 +0000 Subject: [TYPES/announce] Chancellor's Fellowships at the University of Edinburgh Message-ID: Dear types-announce, The University of Edinburgh is advertising up to 30 Chancellor's Fellowship posts across all areas, with 10 in the College of Science and Engineering, which the advertisement describes as "5-year tenure track fellowships, designed to provide talented early career researchers with the support required to develop into a leading research-active academic at the University of Edinburgh." Candidates are expected to have two or more years postdoctoral experience. The School of Informatics welcomes applications in "all areas of computer science, artificial intelligence and data science" and specifically encourages applications in "quantum computing systems, formal verification, computer architecture, and computer science and artificial intelligence for sustainability" [1]. Cross-disciplinary research that might span one or more Schools in the University is also welcome, particularly aligned with the priority areas "AI and Data Science; Health and Life; Climate and Environmental Sustainability". Several of these topics (perhaps all) overlap with topics discussed in this mailing list/community, and I wanted to highlight that because the The posts are not pre-allocated to specific schools within the College (such as Informatics) and shortlisting and hiring decisions will be made based on the strength of applications to different Schools. Historically, the School of Informatics has attracted a disproportionate number of high-quality applicants and been able to make multiple appointments through this type of mechanism. Appointments at lecturer or senior lecturer/reader grade are possible based on experience. Candidates who already hold (or have been awarded) prestigious externally-funded fellowships such as Royal Society, EPSRC, UKRI or ERC are also welcome to apply, and applications from candidates with backgrounds not currently well-represented in science and engineering are specifically strongly encouraged. I am not an official contact person for these positions but since the University webpage [1] and application page [2] are somewhat vague about what area(s) are in scope and opaque about to whom applicants can direct questions, I am happy to forward any questions I receive to someone appropriate if I don't know the answer myself. --James [1] https://urldefense.com/v3/__https://www.ed.ac.uk/science-engineering/staff/human-resources/chancellors-fellows__;!!IBzWLUs!UOkFTlMHnzDSoa4p1WInpP0ps_BVNtsqXwM1MICOXG2lVwS3LmG4GKgOPDogn89YLIiFYbqRnneoMulKCDyvJEjgYup0PKCPhF1_$ [2] https://urldefense.com/v3/__https://elxw.fa.em3.oraclecloud.com/hcmUI/CandidateExperience/en/sites/CX_1001/job/5516__;!!IBzWLUs!UOkFTlMHnzDSoa4p1WInpP0ps_BVNtsqXwM1MICOXG2lVwS3LmG4GKgOPDogn89YLIiFYbqRnneoMulKCDyvJEjgYup0PAWNP8yT$ -------------- next part -------------- An HTML attachment was scrubbed... URL: From efiliot at gmail.com Tue Nov 8 05:16:29 2022 From: efiliot at gmail.com (Emmanuel Filiot) Date: Tue, 8 Nov 2022 11:16:29 +0100 Subject: [TYPES/announce] CONFEST 2023 -- Call for Workshop Proposals Message-ID: * CONFEST 2023 * -- Call for Workshop Proposals September 18 - September 23 2023, Antwerpen, Belgium (https://urldefense.com/v3/__https://www.uantwerpen.be/en/conferences/confest-2023/__;!!IBzWLUs!UDhIR1yBiG58TiSgD_ZGygASRynK_B798rd_ExCFciq4FvKEMoDic4oVO5LDy9lhtrzhwCQD5WJ3wwJXR_-P23ZSzT3oOA$ ) CONFEST is an umbrella conference comprising four international meetings: - CONCUR (34th International Conference on Concurrency Theory), - QEST (20th International Conference on Quantitative Evaluation of SysTems), - FORMATS (21st International Conference on Formal Modeling and Analysis of Timed Systems), and - FMICS (28th International Conference on Formal Methods for Industrial Critical Systems). Researchers and practitioners are invited to submit proposals for ONE DAY workshops on topics related to theory, formal modeling, verification, performance evaluation and engineering of concurrent, timed, industrial, and other systems. Typically, CONFEST workshops feature a number of invited speakers and a number of contributed presentations. The workshops will take place one day before (18 September) and one day after (23 September) the main conferences. TOPICS The purpose of the workshops is to provide participants with a friendly, stimulating, and interactive atmosphere for - presenting novel ideas, - discussing their applications, - encouraging cross-fertilization between industry and academia, and - fostering opportunities for young and prospective researchers. ORGANIZATION CONFEST?23 is planned as a physical, in-person event, with some support for remote participation. In a limited number of cases, there will be remote-participation support for speakers and for other participants who are unable to come. Please take this into account when preparing a workshop proposal and communicate to participants requiring such support that they should contact the organisers of CONFEST explaining their case. We will provide the following to workshop organisers: - Meeting rooms on demand - Coffee breaks, catering for lunch, both are included - CONFEST'23 website cannot be made accessible for edits by third parties but workshop organisers can either host their own website and provide a link to it that we put on CONFEST website, or they send us their content and we put it in the website. - Registration will be centralized by CONFEST. - Special rates for hotels, which can be found in the website https://urldefense.com/v3/__https://www.uantwerpen.be/en/conferences/confest-2023/info/__;!!IBzWLUs!UDhIR1yBiG58TiSgD_ZGygASRynK_B798rd_ExCFciq4FvKEMoDic4oVO5LDy9lhtrzhwCQD5WJ3wwJXR_-P23ZAY-qe-g$ , as well as further local information about Antwerp. INSTRUCTIONS FOR PROPOSAL SUBMISSION Workshop proposals should include: - The name and the preferred date of the proposed workshop. - The names and contact information (web page, email address) of the organisers. - A short scientific summary and justification of the proposed topic for the CONFEST community (500 words max). - A discussion of the proposed format and agenda. - If applicable, a brief description of past versions of the workshop, including dates, organisers, submission and acceptance counts, and attendance. - Procedures for selecting papers and participants. - The publication plan (only invited speakers, no published proceedings, pre-/post-proceedings published with EPTCS/ENTCS/...). - Potentially invited speakers. - Tentative schedule for paper submission and notification of acceptance. The main responsibility for organizing the workshop goes to the workshop organiser(s), including: - workshop publicity (possibly including call for papers, submission and review process) - scheduling of workshop activities in collaboration with the CONFEST workshop chair. Proposals should be sent to Emmanuel Filiot (workshop chair): efiliot at gmail.com IMPORTANT DATES - Submission deadline February 2, 2023 - Notification February 16, 2023 - Program of the workshops ready: August 16, 2023 - Workshops: September 18, 23, 2023 - CONFEST conferences: September 18-23, 2023 The CONFEST 2023 workshop chair, Emmanuel Filiot Universit? libre de Bruxelles, Belgium -------------- next part -------------- An HTML attachment was scrubbed... URL: From fioravanti at unich.it Wed Nov 9 10:08:23 2022 From: fioravanti at unich.it (Fabio Fioravanti) Date: Wed, 9 Nov 2022 16:08:23 +0100 Subject: [TYPES/announce] PhD positions in Blockchain and DLT including analysis and verification of smart contracts using Horn clauses Message-ID: <2c19c351-4b9f-5f82-0265-5667d1b6e99a@unich.it> We are looking for strong and motivated candidates for 11 PhD positions in the Italian National PhD Program in Blockchain and and Distributed Ledger Technology at various Italian universities. Application deadline: 18 november 2022 Interviews: 21-24 november 2022 PhD Program website: https://urldefense.com/v3/__https://isas.unicam.it/dni/blockchain-and-DLT__;!!IBzWLUs!QCuxq6pIUrFazTXZx_MMGyaUIESm0PqDGht59-uQ55ZAFGQd7Yh-WPsSr30951Rvw1aNPkopI2eejhBlcAKbZ1Wzz5aXKha6rSM$ Application details and research topics: https://urldefense.com/v3/__https://www.unicam.it/bandi/bando-n-76799-del-07112022__;!!IBzWLUs!QCuxq6pIUrFazTXZx_MMGyaUIESm0PqDGht59-uQ55ZAFGQd7Yh-WPsSr30951Rvw1aNPkopI2eejhBlcAKbZ1Wzz5aXjTFQhyU$ In particular, one position is on analysis, verification and testing of smart contracts using constrained Horn clauses (CHC) at the University of Chieti-Pescara. For further information please contact Fabio Fioravanti fabio.fioravanti at unich.it Best regards -- Fabio Fioravanti University of Chieti-Pescara, Italy fabio.fioravanti at unich.it https://urldefense.com/v3/__https://www.sci.unich.it/*fioravan/__;fg!!IBzWLUs!QCuxq6pIUrFazTXZx_MMGyaUIESm0PqDGht59-uQ55ZAFGQd7Yh-WPsSr30951Rvw1aNPkopI2eejhBlcAKbZ1Wzz5aXl-0hCBA$ From Matteo.Sammartino at rhul.ac.uk Thu Nov 10 05:08:32 2022 From: Matteo.Sammartino at rhul.ac.uk (Sammartino, Matteo) Date: Thu, 10 Nov 2022 10:08:32 +0000 Subject: [TYPES/announce] Postdoc Position on Hardware Verification via Model Learning, Royal Holloway University of London -- Application deadline 7 Dec 2022 Message-ID: - Application deadline: Midnight, 7 Dec 2022 - Salary: ?37,467 - Duration: until November 2023 Applications are invited for the post of Post-Doctoral Research Assistant in the Computer Science Department at Royal Holloway, University of London. The post holder will have an exciting opportunity to work on the EPSRC-funded "Verification of Hardware Concurrency via Model Learning" (CLeVer) project (EP/S028641/1), led by Prof. Alexandra Silva (UCL/Cornell) and Matteo Sammartino (RHUL), in collaboration with ARM, world-leading designer of multi-core chips. For an informal discussion about the post, please contact Dr. Matteo Sammartino on matteo.sammartino at rhul.ac.uk. # Brief description of the project Digital devices are increasingly complex, therefore there is a pressing need to automate the assessment of their correctness. Formal verification provides highly effective techniques to assess the correctness of systems. However, formal models are usually built by humans, and as such can be error-prone and inaccurate. The project aims to develop a novel verification framework for hardware, which combines learning, testing and model-checking. Not all models are suitable for this purpose and hence specific classes of models will need to be developed, depending on the task at hand. Subsequently, learning and verification techniques for these classes need to be devised and tested in realistic case studies. We have an industrial partner, ARM, that will provide valuable guidance on the design and development of the aforementioned tasks. # The ideal candidate We are looking for candidates with a PhD in one of the following areas: model-based testing and verification, model learning, automated analysis of hardware systems. Experience in multiple areas will be valued. Candidates ideally should also have strong programming skills. # Where to apply https://urldefense.com/v3/__https://jobs.royalholloway.ac.uk/0922-411-R__;!!IBzWLUs!Ql4x98AHBGBXp8EftOjO8vr9oTKppmjfsdYpqCJyeLkaUYZbajCRXcVw1LdY-wgIUroTgr7fZ4Oeq9LVpCtQ5NwmmyKAU69TUSdFpOq5C3-D$ Best wishes, Matteo Sammartino ============================== Matteo Sammartino, Lecturer Royal Holloway University of London Department of Computer Science Tel.: (+44) (0) 1784 44 3690 Office: 2-07, Bedford Building https://urldefense.com/v3/__https://matteosammartino.com/__;!!IBzWLUs!Ql4x98AHBGBXp8EftOjO8vr9oTKppmjfsdYpqCJyeLkaUYZbajCRXcVw1LdY-wgIUroTgr7fZ4Oeq9LVpCtQ5NwmmyKAU69TUSdFpA87nBfj$ 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. -------------- next part -------------- An HTML attachment was scrubbed... URL: From dirk.pattinson at anu.edu.au Fri Nov 11 01:32:38 2022 From: dirk.pattinson at anu.edu.au (Dirk Pattinson) Date: Fri, 11 Nov 2022 06:32:38 +0000 Subject: [TYPES/announce] ANU Logic Summer School: Call for Participation Message-ID: <5378255B-4AA3-419D-A0CA-3963F31FC388@anu.edu.au> Dear Colleagues, after last year's online edition of the logic summer school, it is our greatest pleasure to announce that we organise The Logic Summer School @ ANU 5-16 December 2022 as an in-person event Programme and registration form at https://urldefense.com/v3/__http://lss.cecs.anu.edu.au__;!!IBzWLUs!XI6JHNHwsuHTghUFg-PRklcn4O_2ejcVTEBO-mwkkgqO9XRPNKLzXNBavYcPXlNw5lElX0jTuzZ9aFDJyLR24zJRSg4JtyUh9SqpnEgHig$ with registration opening later today. Everybody is most welcome. Please consider to attend yourself, and please spread the word to your undergrads, your PhD students,your PostDocs, and your colleagues! Yours with best wishes, Peter Hoefner, Dirk Pattinson Organisers, ANU Logic Summer School -------------- next part -------------- An HTML attachment was scrubbed... URL: From j.a.perez at rug.nl Sun Nov 13 21:39:37 2022 From: j.a.perez at rug.nl (=?UTF-8?B?Sm9yZ2UgQS4gUMOpcmV6?=) Date: Sun, 13 Nov 2022 21:39:37 -0500 Subject: [TYPES/announce] Assistant professor position in Theoretical Computer Science at University of Groningen. Message-ID: Dear colleagues, The University of Groningen (NL) invites applications for one assistant professor position (tenure-track) in Theoretical Computer Science. The successful candidate will join us at the Fundamental Computing group of the Bernoulli Institute for Mathematics, Computer Science and AI. The group already has research expertise on concurrency theory, modal logic, coalgebra, and proof theory (see https://urldefense.com/v3/__http://www.rug.nl/fse/fc__;!!IBzWLUs!QOUjCGWM_sgjWSvO9yEQkjwqv94X0927WoHU5V89MVYusZnnsomN-pHOPisHrDG54uAmyf1-a5H5M5_pw75GZYUkotQu48DH$ ); we seek to reinforce our profile in Theoretical Computer Science, very broadly construed. This is a tenure-track position with 60% teaching - 30% research - 10% organizational tasks. Our tenure-track system offers well-defined perspectives for career and personal development. In particular, after five years of appointment, assistant professors are assessed for tenure and promotion to associate professor. The application deadline is January 8, 2023. For further details about this position, our tenure-track system, and the link to the application form see https://urldefense.com/v3/__https://www.rug.nl/about-ug/work-with-us/job-opportunities/?details=00347-02S0009PCP&cat=wp__;!!IBzWLUs!QOUjCGWM_sgjWSvO9yEQkjwqv94X0927WoHU5V89MVYusZnnsomN-pHOPisHrDG54uAmyf1-a5H5M5_pw75GZYUkoo0MByUP$ . Please disseminate widely among potential candidates. If you have any questions, please feel free to contact me . Best wishes, Jorge -- Jorge A. P?rez Associate Professor Leader, Fundamental Computing group Bernoulli Institute for Math, CS and AI University of Groningen, The Netherlands / From andrei.h.popescu at gmail.com Mon Nov 14 07:59:53 2022 From: andrei.h.popescu at gmail.com (Andrei Popescu) Date: Mon, 14 Nov 2022 12:59:53 +0000 Subject: [TYPES/announce] Sam Staton giving this year's LMS/BCS-FACS Evening Seminar (online) -- registration open until this Wednesday at 5PM, UTC Message-ID: EVENT: Annual LMS/BCS-FACS Evening Seminar SPEAKER: Sam Staton, University of Oxford TITLE: Programming-based foundations for statistics DATE: Thursday, 17 November 2022, Starting time: 18:00 UTC VENUE: Online via Zoom EVENT PAGE: https://urldefense.com/v3/__https://www.lms.ac.uk/events/lectures/lms-bcs-facs-evening-seminars__;!!IBzWLUs!XSgrIhXR1p1jOKG1y5-RK0Su79NZHATVtJ-o2Dn7hrPV8DnZpuVuU4EgPlIsnkoq1P_JuO0t9vWL5xyrV87D70LbAk4cnbIf-q9OmkmV$ REGISTRATION LINK: https://urldefense.com/v3/__https://www.lms.ac.uk/civicrm/event/register?id=88&reset=1__;!!IBzWLUs!XSgrIhXR1p1jOKG1y5-RK0Su79NZHATVtJ-o2Dn7hrPV8DnZpuVuU4EgPlIsnkoq1P_JuO0t9vWL5xyrV87D70LbAk4cnbIf-vFm4sOV$ Prior registration is required for attendance -- the registration site will close on Wednesday, 16 November, at 17:00 SYNOPSIS Probabilistic programming is a popular tool for statistics and machine learning. The idea is to describe a statistical model as a program with random choices. The program might be a simulation of a system, such as a physics model, a model of viral spread, or a model of electoral behaviour. We can now carry out statistical inference over the system, for example, by running a Monte Carlo simulation ? running the simulation 100,000?s of times. As I will discuss in this talk, the idea of treating statistical models as computer programs also has a foundational appeal. If we can understand statistical models as programs, then the foundations of probability and statistics can be discussed in terms of program semantics. There is a chance of new foundational perspectives on statistics, in terms of programming languages and their formal methods. As I will explain, this programming-based foundation for statistics is attractive because there are some intuitively simple scenarios, such as inference over function spaces, which have an easy programming implementation, but for which the traditional mathematical interpretation is complicated. SPEAKER BIOGRAPHY Sam Staton is a Professor of Computer Science and Royal Society University Research Fellow at the University of Oxford. There he currently runs an ERC grant "Better Languages for Statistics". Before arriving in Oxford in 2015, Sam spent time in Nijmegen, Paris, and Cambridge. His PhD was in Cambridge with Marcelo Fiore (2007). Sam's main research is in programming language theory, but he is also interested in logic and category theory. He has recent contributions in probabilistic programming languages, and quantum computing and programming languages. Webpage: https://urldefense.com/v3/__https://www.cs.ox.ac.uk/people/samuel.staton/main.html__;!!IBzWLUs!XSgrIhXR1p1jOKG1y5-RK0Su79NZHATVtJ-o2Dn7hrPV8DnZpuVuU4EgPlIsnkoq1P_JuO0t9vWL5xyrV87D70LbAk4cnbIf-pNv5HnP$ From pierre.courtieu at cnam.fr Mon Nov 14 08:15:17 2022 From: pierre.courtieu at cnam.fr (pierre.courtieu at cnam.fr) Date: Mon, 14 Nov 2022 13:15:17 +0000 Subject: [TYPES/announce] ProofGeneal release 4.5 Message-ID: <87e0f05a96d98f2153849a105d17698a@cnam.fr> Dear list, We are happy to announce the release of [Proof General version 4.5](https://urldefense.com/v3/__https://github.com/ProofGeneral/PG/releases/tag/v4.5__;!!IBzWLUs!V69kuQwkn1BzqYx5z9l0SyjqaCuIXgTGyA0_YaIrDYDy2tp2IqEEB-VG7TIIPLt8WyO9t50ONX91tC5KCQxfg9EgbS8ZiTP8zDhL2n9kFg$ ). Proof General is a generic Emacs mode for proof assistants. It can be instantiated for the proof assistant of your choice, and is supplied ready-customized for Coq, PhoX, EasyCrypt, Qrhl-tool. Website: https://urldefense.com/v3/__https://proofgeneral.github.io/__;!!IBzWLUs!V69kuQwkn1BzqYx5z9l0SyjqaCuIXgTGyA0_YaIrDYDy2tp2IqEEB-VG7TIIPLt8WyO9t50ONX91tC5KCQxfg9EgbS8ZiTP8zDgZe5gBLA$ Core maintainers e-mail: proof-general-maintainers at groupes.renater.fr Proof General includes these features, amongst others: - Script management: proof assistant state reflected in editor - Commands for building and replaying proofs - Syntax highlighting of proof scripts and prover output; hiding proofs - Menu for jumping to theorems in a proof script - Provision to easily run proof assistant on a remote host - Works on any system where emacs and coq are running ## Summary of changes from 4.4 to 4.5: ### Generic changes - **proof-general** is now a MELPA (https://urldefense.com/v3/__https://melpa.org/*/proof-general__;Iw!!IBzWLUs!V69kuQwkn1BzqYx5z9l0SyjqaCuIXgTGyA0_YaIrDYDy2tp2IqEEB-VG7TIIPLt8WyO9t50ONX91tC5KCQxfg9EgbS8ZiTP8zDjngAIi6g$ ) and NonGNU ELPA (https://urldefense.com/v3/__https://elpa.nongnu.org/nongnu-devel/proof-general.html__;!!IBzWLUs!V69kuQwkn1BzqYx5z9l0SyjqaCuIXgTGyA0_YaIrDYDy2tp2IqEEB-VG7TIIPLt8WyO9t50ONX91tC5KCQxfg9EgbS8ZiTP8zDgsR7a85Q$ ) Emacs package. - It now requires GNU Emacs 25.2 or later - License changed to GPL-3.0-or-later - Remove support for the following systems: Twelf, CCC, Lego, Hol-Light, ACL2, Plastic, Lambda-Clam, Isabelle, HOL98. - Support for Qrhl-tool (by Dominique Unruh) - Support for EasyCrypt (by Pierre-Yves Strub) - PG's manual is continuously deployed at https://urldefense.com/v3/__https://proofgeneral.github.io/doc/master/userman/__;!!IBzWLUs!V69kuQwkn1BzqYx5z9l0SyjqaCuIXgTGyA0_YaIrDYDy2tp2IqEEB-VG7TIIPLt8WyO9t50ONX91tC5KCQxfg9EgbS8ZiTP8zDghKm3sRw$ ### Coq changes - Auto Compilation of Requires improved: - support of vos/vok compilation - background compilation - "Omit complete opaque proofs" mode for speed. - Automatic insertion of "Proof using" annotations. - Folding/unfolding hypotheses. - Support Ssreflect's `move=>` intro style with `C-c C-a TAB` - Support Coq's ``Diffs`` and ``Show Proof Diffs`` features. ### Miscellaneous - New mode: `opam-switch-mode` (https://urldefense.com/v3/__https://github.com/ProofGeneral/opam-switch-mode__;!!IBzWLUs!V69kuQwkn1BzqYx5z9l0SyjqaCuIXgTGyA0_YaIrDYDy2tp2IqEEB-VG7TIIPLt8WyO9t50ONX91tC5KCQxfg9EgbS8ZiTP8zDiHZBvpkg$ ), also distributed on MELPA, allows to easily perform `opam switch` (and thus switch between coq versions) from within Emacs. - To keep PG up-to-date (https://urldefense.com/v3/__https://proofgeneral.github.io/*keeping-proof-general-up-to-date__;Iw!!IBzWLUs!V69kuQwkn1BzqYx5z9l0SyjqaCuIXgTGyA0_YaIrDYDy2tp2IqEEB-VG7TIIPLt8WyO9t50ONX91tC5KCQxfg9EgbS8ZiTP8zDgzWE0gLQ$ ), we recommend to install PG from MELPA or NonGNU-devel-ELPA and use `M-x proof-upgrade-elpa-packages RET` every once in a while. The ProofGeneral Team -------------- next part -------------- An HTML attachment was scrubbed... URL: From catalin.hritcu at gmail.com Tue Nov 15 03:32:02 2022 From: catalin.hritcu at gmail.com (Catalin Hritcu) Date: Tue, 15 Nov 2022 09:32:02 +0100 Subject: [TYPES/announce] Tenure-track Faculty Positions at Max Planck Institutes in Computer Science Message-ID: The Max Planck Institutes in Computer Science invite applications for tenure-track faculty in all areas of computer science. We expect to fill several positions: https://urldefense.com/v3/__https://www.cis.mpg.de/tenure-track-openings-at-max-planck-institutes-in-computer-science__;!!IBzWLUs!Rf025tfP0cGGzvzHLig7kcCMxFUDKgj1ldF5WbCEgdcnkdzSNUsfjlzXJmGoIOisDs1v2VhN9eYNqivp87vE5nt4LJLa-W4flsbeOMo$ A doctoral degree in computer science or related areas and an outstanding research record are required. Successful candidates are expected to build a team and pursue a highly visible research agenda, both independently and in collaboration with other groups. The institutes are part of a network of over 80 Max Planck Institutes, Germany?s premier basic-research organisations. MPIs have an established record of world-class, foundational research in the sciences, technology, and the humanities. The institutes offer a unique environment that combines the best aspects of a university department and a research laboratory: Faculty enjoy full academic freedom, lead a team of doctoral students and post-docs, and have the opportunity to teach university courses; at the same time, they enjoy ongoing institutional funding in addition to third-party funds, a technical infrastructure unrivaled for an academic institution, as well as internationally competitive compensation. We maintain an international and diverse work environment and seek applications from outstanding researchers worldwide. The working language is English; knowledge of the German language is not required for a successful career at the institutes. *Qualified candidates should apply on our application website (apply.cis.mpg.de ). Review of applications will begin by December 1st, 2022.* The Max Planck Society wishes to increase the number of women in those areas where they are underrepresented. Women are therefore explicitly encouraged to apply. The Max Planck Society is also committed to increasing the number of employees with severe disabilities in its workforce. Applications from persons with severe disabilities are expressly desired. The initial tenure-track appointment is for five years; it can be extended to seven years based on a positive midterm evaluation in the fourth year. A permanent contract can be awarded upon a successful tenure evaluation in the sixth year. -------------- next part -------------- An HTML attachment was scrubbed... URL: From Ralph.Matthes at irit.fr Tue Nov 15 07:41:40 2022 From: Ralph.Matthes at irit.fr (Ralph Matthes) Date: Tue, 15 Nov 2022 13:41:40 +0100 Subject: [TYPES/announce] =?utf-8?q?FICS=2723=3A_Call_for_Contributions_-?= =?utf-8?q?_Fixed_Points_in_Computer_Science_=28CSL=2723_workshop_17_feb_2?= =?utf-8?q?023=29?= Message-ID: The 11th International Workshop on Fixed Points in Computer Science will take place in Warsaw on 17 February 2023 as a satellite of the International Conference CSL 2023 (Computer Science Logic). The goal of the workshop is to bring together people from different fields such as algebra/coalgebra, verification, logic, around the thematic of fixed points. This workshop will be without proceedings. In particular you can present work that is already published elsewhere, or in progress. Depending on the nature of the contributions, a special issue of Fundamenta Informaticae might be published with selected contributions (we have the approval by the journal for this). Fixed points play a fundamental role in several areas of computer science. They are used to justify (co)recursive definitions and associated reasoning techniques. The construction and properties of fixed points have been investigated in many different settings such as: design and implementation of programming languages, logic, verification, databases. Topics include, but are not restricted to: -fixed points in algebra and coalgebra -fixed points in formal languages and automata -fixed points in game theory -fixed points in programming language semantics -fixed points in the mu-calculus and modal logics -fixed points in process algebras and process calculi -fixed points in functional programming and type theory -fixed points in relation to dataflow and circuits -fixed points in logic programming and theorem proving -fixed points in finite model theory, descriptive complexity theory, and databases -fixed points in category theory for logic in computer science Invited Speaker --------------------------------- -TBA ===================================== Submission and Registration Instructions ===================================== Abstracts presenting your communication should be sent via https://urldefense.com/v3/__https://easychair.org/conferences/?conf=fics2023__;!!IBzWLUs!X4SU02SRZjxOH-L4PZCvJuWFi0Dr1DcNHfaYCrDIdD2CyjPEAS-wKPMOqwGrp0kgPvQZl4VUU4_GkNZVu_BGs4rSZqZCc4J6F3tisw$ . Submissions should be from 1 to 3 pages long, excluding bibliography. Registration will be opened soon, as for other CSL workshops. It will include a small fee to cover the cost of invited speaker and social event. An effort will be made to enable online participation for those who cannot attend in person. Important dates --------------------------------- Submission deadline: 06/01/2023 AoE Notification: 27/01/2023 Workshop: 17/02/2023 ===================================== Committees ===================================== Program Committee --------------------------------- -Henning Basold (LIACS, Univ. Leiden) -Karoliina Lehtinen (CNRS & LIS Marseille) -Denis Kuperberg, chair (CNRS & ENS Lyon) -Ralph Matthes (CNRS & Univ. Toulouse) -Matteo Mio (CNRS & ENS Lyon) -Damian Niwinski (University of Warsaw) -Fredrik Nordvall Forsberg (Univ. of Strathclyde) -Luigi Santocanale (LIS, Univ. Aix-Marseille I) -Tarmo Uustalu (Institute of Cybernetics, Tallinn) Steering Committee --------------------------------- -Peter Dybjer (Chalmers University of Technology) -Ralph Matthes (IRIT, Toulouse) -Damian Niwinski (University of Warsaw) -Luigi Santocanale (LIS, Universit? Aix-Marseille I) -Denis Kuperberg, chair (CNRS & ENS Lyon) -Tarmo Uustalu (Institute of Cybernetics, Tallinn) -Igor Walukiewicz (LaBRI, Bordeaux) From research at ralfj.de Tue Nov 15 15:27:07 2022 From: research at ralfj.de (Ralf Jung) Date: Tue, 15 Nov 2022 21:27:07 +0100 Subject: [TYPES/announce] =?utf-8?q?PhD_positions_in_program_verification?= =?utf-8?q?_and_separation_logic_at_ETH_Z=C3=BCrich?= Message-ID: Hello everyone, I am offering up to two fully funded PhD positions in my newly founded research group at ETH Z?rich. I am looking for strong students that want to do research at the foundations of programming language theory, in program verification and separation logic, with a focus on Rust and Iris. Knowledge of Coq is greatly appreciated. Interested candidates can contact me directly at research at ralfj.de. Please explain why you are interested in a PhD in this field and what your prior experience is. Also include a CV and possible contacts for recommendation letters. For more information about ETH Z?rich, see https://urldefense.com/v3/__https://ethz.ch/en/the-eth-zurich/working-teaching-and-research.html__;!!IBzWLUs!QCpgLWCjxj5qAJFUaiDts7XnxqyqHwCOSwL1vsAB2mFw7U4jFigcmKzY4vPVwxLB57GyWqVKVS3bogEagi2sFk-XabVNxmbGcw$ . Kind regards, Ralf https://urldefense.com/v3/__https://research.ralfj.de/__;!!IBzWLUs!QCpgLWCjxj5qAJFUaiDts7XnxqyqHwCOSwL1vsAB2mFw7U4jFigcmKzY4vPVwxLB57GyWqVKVS3bogEagi2sFk-XabXQb3e6mw$ From Rene.Thiemann at uibk.ac.at Thu Nov 17 03:05:34 2022 From: Rene.Thiemann at uibk.ac.at (=?iso-8859-1?Q?Thiemann=2C_Ren=E9?=) Date: Thu, 17 Nov 2022 08:05:34 +0000 Subject: [TYPES/announce] ITP 2023: First Call for Papers Message-ID: ITP 2023: First Call for Papers https://urldefense.com/v3/__https://mizar.uwb.edu.pl/ITP2023/__;!!IBzWLUs!QqUvQf6oRiqVcy1qRcLWvQak31vCOGCFowXu14Ffv0zQC1bgzgAJtU9gdjjhTUPP8cl-CJnNnV6cj7mnaXn98WYaTdidwLV8ByoXaO5Stw$ The international conference on Interactive Theorem Proving (ITP 2023) will take place on July 31 to August 4, 2023 in Bialystok, Poland. It is planned as a face-to-face (physical) meeting. The ITP conference series is concerned with all aspects of interactive theorem proving, ranging from theoretical foundations to implementation aspects and applications in program verification, security, and the formalization of mathematics. This will be the 14th conference in the ITP series, while predecessor conferences from which it has evolved have been going since 1988. Paper Submission ITP welcomes submissions describing original research on all aspects of interactive theorem proving and its applications. Suggested topics include, but are not limited to, the following: - formalizations of computational models - improvements in theorem prover technology - formalizations of mathematics - integration with automated provers and other symbolic tools - verification of security algorithms - industrial applications of interactive theorem provers - formal aspects of hardware and software - user interfaces for interactive theorem provers - use of theorem provers in education - concise and elegant worked examples of formalizations (proof pearls) Submissions will undergo single-blind peer review. Regular papers should be no more than 16 pages in length excluding bibliographic references in LIPIcs format, and they should not include an appendix. For detailed instructions for authors on document preparation see: https://urldefense.com/v3/__https://www.dagstuhl.de/en/publications/lipics/instructions-for-authors/__;!!IBzWLUs!QqUvQf6oRiqVcy1qRcLWvQak31vCOGCFowXu14Ffv0zQC1bgzgAJtU9gdjjhTUPP8cl-CJnNnV6cj7mnaXn98WYaTdidwLV8ByqA0sjHfw$ We also welcome short papers, which can be used to describe interesting work that is still ongoing and not fully mature. Such a preliminary report is limited to 6 pages and may consist of an extended abstract. Each of these papers should have the phrase "Short paper" as a subtitle. Accepted submissions in this category will be published in the main proceedings and will be presented as short talks. The papers are to be submitted via EasyChair via the following link: https://urldefense.com/v3/__https://easychair.org/conferences/?conf=itp2023__;!!IBzWLUs!QqUvQf6oRiqVcy1qRcLWvQak31vCOGCFowXu14Ffv0zQC1bgzgAJtU9gdjjhTUPP8cl-CJnNnV6cj7mnaXn98WYaTdidwLV8BypqSl7sEQ$ All submissions are expected to be accompanied by verifiable evidence of a suitable implementation, such as the source files of a formalization for the proof assistant used. Important Dates (AoE) Abstract submission deadline: February 13, 2023 Paper submission deadline: February 20, 2023 Author notification: April 17, 2023 Camera-ready copy due: May 15, 2023 Conference: July 31 to August 4, 2023 Publication Details As in earlier years, the conference proceedings will be published open access in the LIPIcs series ("Leibniz International Proceedings in Informatics"). For more information on the series see https://urldefense.com/v3/__https://www.dagstuhl.de/en/publications/lipics__;!!IBzWLUs!QqUvQf6oRiqVcy1qRcLWvQak31vCOGCFowXu14Ffv0zQC1bgzgAJtU9gdjjhTUPP8cl-CJnNnV6cj7mnaXn98WYaTdidwLV8ByrQx94Ujw$ . From research at ralfj.de Fri Nov 18 08:46:04 2022 From: research at ralfj.de (Ralf Jung) Date: Fri, 18 Nov 2022 14:46:04 +0100 Subject: [TYPES/announce] =?utf-8?q?ETH_Z=C3=BCrich_looking_to_hire_assis?= =?utf-8?q?tant_professor_for_=22Software_Security_and_Formal_Methods=22_?= =?utf-8?q?=28deadline_Jan_8=29?= Message-ID: Hi all, ETH Z?rich is looking to hire a tenure track assistant professor in "Computer Security", which includes "Software Security and Formal Methods". From my own experience of being here for a grand total of not even 3 weeks, I can say that ETH is an a amazing place to work at, and Z?rich is a great city. :D For more information, see . Also feel free to contact me with any questions. Kind regards, Ralf From emilio.tuosto at gssi.it Sun Nov 20 10:58:12 2022 From: emilio.tuosto at gssi.it (emilio.tuosto at gssi.it) Date: Sun, 20 Nov 2022 07:58:12 -0800 Subject: [TYPES/announce] COORDINATION 2023 Call For Papers Message-ID: 25th International Conference on Coordination Models and Languages June 19-23, 2023; Lisboa, Portugal Website: https://urldefense.com/v3/__https://www.discotec.org/2023/coordination__;!!IBzWLUs!VWHrZyDPKRRhgp_HKV0U8WRsKxd71INDTXLY5ub6GALP3EbnUgOSaZHPSLyHpRPtr5oEGvrmXFPoZlH7C9KKSdd24qd8TmKf_g0NrA$ COORDINATION 2023 is one of the three conferences of DisCoTec 2023 https://urldefense.com/v3/__https://www.discotec.org/2023/__;!!IBzWLUs!VWHrZyDPKRRhgp_HKV0U8WRsKxd71INDTXLY5ub6GALP3EbnUgOSaZHPSLyHpRPtr5oEGvrmXFPoZlH7C9KKSdd24qd8TmITAYmKKA$ Submission Link: https://urldefense.com/v3/__https://easychair.org/conferences/?conf=coordination2023__;!!IBzWLUs!VWHrZyDPKRRhgp_HKV0U8WRsKxd71INDTXLY5ub6GALP3EbnUgOSaZHPSLyHpRPtr5oEGvrmXFPoZlH7C9KKSdd24qd8TmITcjWrBg$ --------------------------------------------------------------------------------- Call for Papers --------------- Modern information systems rely increasingly on combining concurrent, distributed, mobile, adaptive, reconfigurable and heterogeneous components. New models, architectures, languages and verification techniques are necessary to cope with the complexity induced by the demands of today?s software development. Coordination languages have emerged as a successful approach, in that they provide abstractions that cleanly separate behaviour from communication, therefore increasing modularity, simplifying reasoning, and ultimately enhancing software development. Building on the success of the previous editions, this conference provides a well-established forum for the growing community of researchers interested in models, languages, architectures, and implementation techniques for coordination. Topics: ------- * Theoretical models and foundations for coordination: component composition, concurrency, mobility, dynamic, spatial and probabilistic aspects of coordination, logic, emergent behaviour, types, semantics; * Specification, refinement, and analysis of architectures: patterns and styles, verification of functional and non-functional properties, including performance and security aspects; * Dynamic software architectures: distributed mobile code, configuration, reconfiguration, networked computing, parallel, high-performance and cloud computing * Nature- and bio-inspired approaches to coordination; * Coordination of multi-agent and collective systems: models, languages, infrastructures, self-adaptation, self-organisation, distributed solving, collective intelligence and emerging behaviour; * Coordination and modern distributed computing: web services, peer-to-peer networks, grid computing, context-awareness, ubiquitous computing, mobile computing; * Coordination platforms for infrastructures of emergent new application domains like IoT, fog- and edge-computing; * Cybersecurity aspects of coordinated systems, coordinated approaches to cybersecurity; * Programming methodologies, languages, middleware, tools, and environments for the development and verification of coordinated applications; * Tools, languages and methodologies for secure coordination; * Industrial relevance of coordination and software architectures: programming in the large, domain-specific software architectures and coordination models, case studies; * Interdisciplinary aspects of coordination; * Industry-led efforts in coordination and case studies. We invite you to submit: ----------------------- * Regular long papers (7-15 pages, not counting references): describing thorough and complete research results and experience reports. * Regular short papers (4-6 pages, not counting references): describing research in progress or opinion papers on the past of COORDINATION research, on the current state of the art, or on prospects for the years to come. * Short tool papers (4-6 pages, not counting references): describing technological artefacts in the scope of the research topics of COORDINATION. Short tool papers are not required to provide an account of theoretical foundations and are not required to present the design and implementation concerns. They should provide a clear account of the tool?s functionality and discuss the tool?s practical capabilities. The paper must contain a link to a publicly downloadable MPEG-4 demo video of at most 10 minutes length. * Long tool papers (7-15 pages, not counting references): describing technological artefacts in the scope of the research topics of COORDINATION. A full-length tool paper should provide a brief account of the theoretical foundations (including relevant citations), present the design and implementation concerns (possibly including software architecture and core data structures), provide a clear account of the tool?s functionality, discuss the tool?s practical capabilities (possibly with reference to the type and size of problems it can handle), and (when applicable) report on realistic case studies (possibly providing a rigorous experimental evaluation). Papers that present extensions to existing tools should clearly describe the improvements or extensions with respect to previously published versions of the tool (possibly providing data on enhancements in terms of resources and capabilities). The paper must contain a link to a publicly downloadable MPEG-4 demo video of at most 10 minutes length. * Survey papers (16-25 pages, not counting references): describing important results and success stories that originated in the context of COORDINATION. Important dates --------------- * Abstract submission: February 11, 2023 * Paper submission: February 18, 2023 * Paper notification: March 31, 2023 * Artefact submission: April 14, 2023 * Artefact notification: April 30, 2023 * Camera-ready: April 30, 2023 Dates are Anywhere on Earth (AoE). Proceedings ----------- The conference proceedings, formed by accepted submissions from any category, will be published by Springer in LNCS-IFIP volumes. Special issues -------------- Following the tradition of previous editions of COORDINATION, depending on the quality and number of the submissions, COORDINATION 2023 will host special issues of selected papers in reputable journals like the journal of Science of Computer Programming?s Software Track for tool papers and the journal of Logical Methods in Computer Science for the remaining categories. Program Committee chairs ------------------------ Ant?nia Lopes (University of Lisbon, Portugal) Sung-Shik Jongmans (Open University of the Netherlands, Netherlands) Publicity chair --------------- Giorgio Audrito (University of Torino, Italy) Program Committee ----------------- Giorgio Audrito (University of Turin, Italy) Marco Autili (Universit? dell?Aquila, Italy) Massimo Bartoletti (Universit? degli Studi di Cagliari, Italy) Laura Bocchi (University of Kent, UK) Marcello Bonsangue (Leiden University, The Netherlands) Javier C?mara (University of Malaga, Spain) Ilara Castellani (INRIA, France) Adrian Francalanza (University of Malta, Malta) Vashti Galpin (University of Edinburgh, UK) Narges Khakpour (Newcastle University, UK) Eva K?hn (Vienna University of Technology, Austria) Alberto Lluch Lafuente (Technical University of Denmark, Denmark) Michele Loreti (University of Camerino, Italy) Mieke Massink (CNR-ISTI, Italy) Sung Meng (Peking University, China) Hern?n Melgratti (University of Buenos Aires, Argentina) Fabrizio Montesi (University of Southern Denmark, Denmark) Rumyana Neykova (Brunel University London, UK) Anna Philippou (University of Cyprus, Cyprus) Jos? Proen?a (Polytechnic Institute of Porto, Portugal) Rosario Pugliese (University of Florence, Italy) Marjan Sirjani (M?lardalen University, Sweden) Violet Ka I Pun (Western Norway University of Applied Sciences, Norway) Carolyn Talcott (SRI International, USA) Silvia Lizeth Tapia Tarifa (University of Oslo, Norway) Maurice ter Beek (CNR-ISTI, Italy) Peter Thiemann (Universit?t Freiburg, Germany) Emilio Tuosto (Gran Sasso Science Institute, Italy) Mirko Viroli (University of Bologna, Italy) Artefact Evaluation Committee chair ----------------------------------- Alceste Scalas (Technical University of Denmark, Denmark) Artefact Evaluation Committee ----------------------------- TBA ************************************************************ Emilio Tuosto Gran Sasso Science Institute Department of Computer Science ORCID: 0000-0002-7032-3281 Viale F. Crispi, 7 - 67100 L'Aquila (Italy) Office: Palazzo Mariani P1-N Phone: +39 0862 428 0312 homepage -> https://urldefense.com/v3/__https://cs.gssi.it/emilio.tuosto/__;!!IBzWLUs!VWHrZyDPKRRhgp_HKV0U8WRsKxd71INDTXLY5ub6GALP3EbnUgOSaZHPSLyHpRPtr5oEGvrmXFPoZlH7C9KKSdd24qd8TmIP9Baqow$ ************************************************************ From davide.ancona at unige.it Mon Nov 21 04:07:27 2022 From: davide.ancona at unige.it (Davide Ancona) Date: Mon, 21 Nov 2022 10:07:27 +0100 Subject: [TYPES/announce] nominations for the Dahl-Nygaard prize for the 2023 year Message-ID: ============================================================================ Dahl-Nygaard Prizes 2023: call for nominations [https://urldefense.com/v3/__https://sites.google.com/aito.org/home/aito-dahl-nygaard__;!!IBzWLUs!T5chiMebAS2ghCZ78k9Fn6suHim2cmnUAiMnYdRlWvK1xl6YhXTzcWsdBAAVauE7ZGEI2yBULyJAsonoy9w713vPmfZKCyWvoU_n1mw$ ] ============================================================================ In 2004, AITO established an annual prize in the name of the Ole-Johan Dahl and Kristen Nygaard to honor their pioneering work on object-orientation. The prizes are named after Ole-Johan Dahl and Kristen Nygaard, whose pioneering conceptual and technical work in the sixties shaped that view of programming and modeling which is now known as object-orientation. One prize is awarded to a junior researcher (who has obtained the PhD degree at most 7 years before the award year, excluding any parental leave), and one prize to a senior researcher. The senior researcher should have made a significant long-term contribution to the field in research or engineering. The junior researcher should have made a promising contribution to the field through a paper, a thesis, or a prototype implementation. Nominations are due by *December 15* and should be made using the following online form: https://urldefense.com/v3/__https://docs.google.com/forms/d/e/1FAIpQLSd9qQb8MmtkWM01vLhIpqPTIlmgciNwDiiLtSxot05x6k6c4w/viewform__;!!IBzWLUs!T5chiMebAS2ghCZ78k9Fn6suHim2cmnUAiMnYdRlWvK1xl6YhXTzcWsdBAAVauE7ZGEI2yBULyJAsonoy9w713vPmfZKCyWvGIeFcE4$ Davide Ancona (AITO Secretary) on behalf of John Boyland (Dahl-Nygaard prize committee chair, 2023) From georg.moser at uibk.ac.at Mon Nov 21 06:48:02 2022 From: georg.moser at uibk.ac.at (Georg Moser) Date: Mon, 21 Nov 2022 12:48:02 +0100 Subject: [TYPES/announce] PhD Position in Theory Message-ID: <6a040a20-655f-de29-134b-ba446503a8d6@uibk.ac.at> 4-year PhD position @ University of Innsbruck ====================================================================== Within the TCS Group of the Department of Computer Science at the University of Innsbruck, Austria there is an opening for a 4 year PhD student position; kindly see https://urldefense.com/v3/__https://tcs-informatik.uibk.ac.at/vacancies/__;!!IBzWLUs!XgKY1begv1OxjvUnRvg9E0mEdD8ewx_6EG2VfQGwjZ-1M7HrhrCN4lw1uUZahx-WECReIIEqrKdvkDluDZ1R4wcJAM1qycC22Zz3Gt0$ for further details. Applications (including CV, short letter of motivation, three references) should submitted via the following link https://urldefense.com/v3/__https://lfuonline.uibk.ac.at/public/karriereportal.details?asg_id_in=13052__;!!IBzWLUs!XgKY1begv1OxjvUnRvg9E0mEdD8ewx_6EG2VfQGwjZ-1M7HrhrCN4lw1uUZahx-WECReIIEqrKdvkDluDZ1R4wcJAM1qycC26CTJH3c$ no later than December 22, 2022. Informal inquiries may be sent to georg.moser at uibk.ac.at. The city of Innsbruck is superbly located in the beautiful surroundings of the Tyrolean Alps. The combination of urban life in this historic town and the Alpine environment provides a high quality of living. Further information is available from the following links: - Theoretical Computer Science Group https://urldefense.com/v3/__https://tcs-informatik.uibk.ac.at/__;!!IBzWLUs!XgKY1begv1OxjvUnRvg9E0mEdD8ewx_6EG2VfQGwjZ-1M7HrhrCN4lw1uUZahx-WECReIIEqrKdvkDluDZ1R4wcJAM1qycC23MM95mE$ - Department of Computer Science https://urldefense.com/v3/__https://www.uibk.ac.at/informatik/__;!!IBzWLUs!XgKY1begv1OxjvUnRvg9E0mEdD8ewx_6EG2VfQGwjZ-1M7HrhrCN4lw1uUZahx-WECReIIEqrKdvkDluDZ1R4wcJAM1qycC2K8SPOrE$ - University of Innsbruck https://urldefense.com/v3/__https://www.uibk.ac.at/__;!!IBzWLUs!XgKY1begv1OxjvUnRvg9E0mEdD8ewx_6EG2VfQGwjZ-1M7HrhrCN4lw1uUZahx-WECReIIEqrKdvkDluDZ1R4wcJAM1qycC2jOiYuI8$ Best wishes, Georg --- Univ.-Prof. Dr. Georg Moser Theoretical Computer Science, University of Innsbruck Technikerstrasse 21a, 6020 Innsbruck From Graham.Hutton at nottingham.ac.uk Mon Nov 21 07:20:23 2022 From: Graham.Hutton at nottingham.ac.uk (Graham Hutton) Date: Mon, 21 Nov 2022 12:20:23 +0000 Subject: [TYPES/announce] 10 PhD studentships in Nottingham Message-ID: Dear all, The School of Computer Science at the University of Nottingham in the UK is seeking applications for 10 fully-funded PhD studentships: https://urldefense.com/v3/__https://tinyurl.com/ten-phd-2022__;!!IBzWLUs!VBm1bcV5i-SSEKb-M7KExGpuck3ljbNmp0m8XUx8pH2IB0ETEKNjVOvkPrCy5LbDnlP6MwzQVGCuYqUqgP0cEcv4K8QBvClVwXUcdTty_RFyQg$ Applicants in the area of the Functional Programming Lab (tinyurl.com/fp-notts) are strongly encouraged! If you are interested in applying, please contact a potential supervisor as soon as possible; the application deadline is 12th Feb 2023: Thorsten Altenkirch - constructive logic, proof assistants, homotopy type theory, category theory, lambda calculus. Ulrik Buchholtz - homotopy type theory, synthetic homotopy theory, proof assistants, constructive mathematics, and related topics. Graham Hutton - functional programming, haskell, category theory, program verification, program calculation. Nicolai Kraus - homotopy type theory, higher category theory, constructive mathematics, and related topics. Dan Marsden - category theory, logic, finite model theory, diagrammatic reasoning, foundations of computer science. These positions are open to students of any nationality. Best wishes, The FP Lab +-----------------------------------------------------------+ 10 Fully-Funded PhD Studentships School of Computer Science University of Nottingham, UK https://urldefense.com/v3/__https://tinyurl.com/ten-phd-2022__;!!IBzWLUs!VBm1bcV5i-SSEKb-M7KExGpuck3ljbNmp0m8XUx8pH2IB0ETEKNjVOvkPrCy5LbDnlP6MwzQVGCuYqUqgP0cEcv4K8QBvClVwXUcdTty_RFyQg$ Applications are invited from international and home students for 10 fully-funded PhD studentships offered by the School of Computer Science, starting on 1st October 2023. The topics for the studentships are open, but should relate to the interests of one the School's research groups: Computational Optimisation and Learning; Computer Vision; Cyber Security; Functional Programming; Intelligent Modelling and Analysis; Mixed Reality; Uncertainty in Data and Decision Making; Visualisation and Computer Graphics; Cyber-Physical Health and Assistive Robotics Technologies. The studentships are fully funded for 3.5 years and include a stipend of ?17,668 per year and tuition fees. Applicants are normally expected to have a first-class class bachelors or masters in Computer Science or another relevant area, and must obtain the support of a potential supervisor in the School prior to submitting their application. If you are interested in applying, please contact a potential supervisor as soon as possible, and at least two weeks prior to the closing date. If the supervisor wishes to support your application, they will direct you to make an official application through the MyNottingham system. Closing date for applications: Sunday 12th February 2023. +-----------------------------------------------------------+ This message and any attachment are intended solely for the addressee and may contain confidential information. If you have received this message in error, please contact the sender and delete the email and attachment. Any views or opinions expressed by the author of this email do not necessarily reflect the views of the University of Nottingham. Email communications with the University of Nottingham may be monitored where permitted by law. From james.ben.worrell at gmail.com Tue Nov 22 06:24:52 2022 From: james.ben.worrell at gmail.com (James Worrell) Date: Tue, 22 Nov 2022 11:24:52 +0000 Subject: [TYPES/announce] Postdoc position in verification and automata learning at MPI-SWS, in association with Cornell and Oxford Message-ID: A postdoctoral position in automated verification and automata learning is open at the Max Planck Institute for Software Systems in Saarbr?cken, Germany, in the group of Prof. Jo?l Ouaknine. The project is a joint collaboration with Prof. Alexandra Silva (Cornell University) and Prof. James Worrell (Oxford University). The post is based in Saabr?cken, but the successful candidate will have the opportunity occasionally to travel to Cornell (Ithaca, USA) and Oxford (UK). Active automata learning has become an important technique in model-based verification, as it enables the automated inference of models. There is a gap between the existing learning algorithms and the expressive models that have been used in e.g. probabilistic model checking. The goal of this project is two-fold: on the one hand, we want to design active learning algorithms for probabilistic automata and study the limits of learnability; on the other hand, we want to explore their use in practical scenarios, including randomised routing. Qualifications: -- A PhD awarded (or nearing completion) in Computer Science, Mathematics, or a closely related discipline. -- Knowledge and publications across some areas of: logic in computer science, formal verification, automata theory, programming language theory, probabilistic systems, learning, randomised algorithms, concurrency theory, program synthesis. This position is available on a full time basis for one year in the first instance, with the possibility of renewal(s). For informal enquiries, please contact Prof. Jo?l Ouaknine . -------------- next part -------------- An HTML attachment was scrubbed... URL: From kyrozier at iastate.edu Fri Nov 18 10:12:15 2022 From: kyrozier at iastate.edu (Rozier, Kristin-Yvonne [AER E]) Date: Fri, 18 Nov 2022 15:12:15 +0000 Subject: [TYPES/announce] Call for Papers: NASA Formal Methods (NFM) 2023 Message-ID: ***************************************************** ???? The Fifteenth NASA Formal Methods Symposium https://urldefense.com/v3/__https://conf.researchr.org/home/nfm-2023__;!!IBzWLUs!TNwWDVGGjF5GKWPzLkg1kPtWoG8XbHzoEwK1GcdcpBBaZP5zeJYQK9QR_kD2xbkX6f0XVWinRMMge4dgmcWC2OM56Ay0Ck6ZXzM$ ?????????????????? 16 - 18 May 2023 University of Houston Clear Lake, Houston, Texas, USA ***************************************************** Theme of the Symposium: ----------------------- The widespread use and increasing complexity of mission-critical and safety-critical systems at NASA and in the aerospace industry require advanced techniques that address these systems' specification, design, verification, validation, and certification requirements. The NASA Formal Methods Symposium (NFM) is an annual forum to foster collaboration between theoreticians and practitioners from NASA, academia, and industry. NFM's goals are to identify challenges and to provide solutions for achieving assurance for such critical systems. New developments and emerging applications like autonomous software for uncrewed deep space human habitats, caretaker robotics, Unmanned Aerial Systems (UAS), UAS Traffic Management (UTM), and the need for system-wide fault detection, diagnosis, and prognostics provide new challenges for system specification, development, and verification approaches. The focus of these symposiums are on formal techniques and other approaches for software assurance, including their theory, current capabilities and limitations, as well as their potential application to aerospace, robotics, and other NASA-relevant safety-critical systems during all stages of the software life-cycle. Topics of Interest: ------------------- We encourage submissions on cross-cutting approaches that bring together formal methods and techniques from other domains such as probabilistic reasoning, machine learning, control theory, robotics, and quantum computing among others. ??? * Formal verification, including theorem proving, model checking, and static analysis ??? * Advances in automated theorem proving including SAT and SMT solving ??? * Use of formal methods in software and system testing ??? * Run-time verification ??? * Techniques and algorithms for scaling formal methods, such as abstraction and symbolic methods, compositional techniques, as well as parallel and/or distributed techniques ??? * Code generation from formally verified models ??? * Safety cases and system safety ??? * Formal approaches to fault tolerance ??? * Theoretical advances and empirical evaluations of formal methods techniques for safety-critical systems, including hybrid and embedded systems ??? * Formal methods in systems engineering and model-based development ??? * Correct-by-design controller synthesis ??? * Formal assurance methods to handle adaptive systems Important Dates: ---------------- Abstract Submission:? 9 Dec 2022 Paper Submission:??? 16 Dec 2022 Paper Notifications: 20 Feb 2023 Camera-ready Papers: 12 Mar 2023 Symposium:??????? 16-18 May 2023 Location & Cost: ---------------- The symposium will take place in the STEM Building at University of Houston Clear Lake, Houston, Texas, USA, 16-18 May 2023. There will be no registration fee for participants. All interested individuals, including non-US citizens, are welcome to attend, to listen to the talks, and to participate in discussions; however, all attendees must register. Submission Details: ------------------- There are two categories of submissions: ?? 1. Regular papers describing fully developed work and complete results (15 pages + references) ?? 2. Two categories of short papers: (6 pages + references) ?? (a) Tool Papers describing novel, publicly-available tools ?? (b) Case Studies detailing complete applications of formal methods to real systems with publicly-available artifacts All papers should be in English and describe original work that has not been published or submitted elsewhere. All submissions will be fully reviewed by members of the Programme Committee. Papers will appear in the Formal Methods subline of Springer's Lecture Notes in Computer Science (LNCS) and must use LNCS style formatting (https://urldefense.com/v3/__https://www.springer.com/gp/computer-science/lncs/conference-proceedings-guidelines__;!!IBzWLUs!TNwWDVGGjF5GKWPzLkg1kPtWoG8XbHzoEwK1GcdcpBBaZP5zeJYQK9QR_kD2xbkX6f0XVWinRMMge4dgmcWC2OM56Ay0gHg_8X4$ ). Papers must be submitted in PDF format at the EasyChair submission site: https://urldefense.com/v3/__https://easychair.org/conferences/?conf=nfm2023__;!!IBzWLUs!TNwWDVGGjF5GKWPzLkg1kPtWoG8XbHzoEwK1GcdcpBBaZP5zeJYQK9QR_kD2xbkX6f0XVWinRMMge4dgmcWC2OM56Ay05Yjshho$ Keynote Speakers: ----------------- Julia Badger, NASA Johnson Space Center Ken McMillan, UT Austin Sanjit Seshia, UC Berkeley Organizers: ----------- Swarat Chaudhuri (UT Austin) Jim Dabney (University of Houston Clear Lake/NASA JSC) Kristin Yvonne Rozier (Iowa State University/NASA JSC) Programme Committee: -------------------- Julia Badger, NASA Johnson Space Center Stanley Bak, Stony Brook University Suguman Bansal, University of Pennsylvania Dirk Beyer, LMU Munich Nikolaj Bj?rner, Microsoft Research Sylvie Boldo, Inria and Universit? Paris-Saclay Georgiana Caltais, University of Twente Swarat Chaudhuri, UT Austin Darren Cofer, Rockwell Collins Jennifer Davis, Collins Aerospace Ewen Denney, NASA Ames Research Center Catherine Dubois, ENSIIE-Samovar Rohit Dureja, IBM Corporation Alexandre Duret-Lutz, LRDE/EPITA Aaron Dutle, NASA Langley Research Center Souradeep Dutta, University of Pennsylvania R?diger Ehlers, Clausthal University of Technology Chuchu Fan, MIT Marie Farrell, Maynooth University Bernd Finkbeiner, CISPA Helmholtz Center for Information Security Alwyn Goodloe, NASA Langley Research Center Arie Gurfinkel, University of Waterloo Klaus Havelund, NASA Jet Propulsion Laboratory Constance Heitmeyer, Naval Research Laboratory Marijn Heule, Carnegie Mellon University Kerianne Hobbs, Air Force Research Laboratory Bardh Hoxha, Toyota Research Institute North America Susmit Jha, SRI International Rajeev Joshi, Amazon Web Services Panagiotis Manolios, Northeastern University Anastasia Mavridou, SGT Inc. / NASA Ames Research Center Stefan Mitsch, Carnegie Mellon University Cesar Munoz, Amazon Natasha Neogi, NASA Langley Research Center Corina Pasareanu, CMU NASA, KBR Ivan Perez, KBR / NASA Ames Research Center Zvonimir Rakamaric, University of Utah Giles Reger, Amazon Web Services and The University of Manchester Kristin Yvonne Rozier, Iowa State University Johann Schumann, NASA Ames Research Center Cristina Seceleanu, M?lardalen University Yasser Shoukry, University of California Irvine Laura Titolo, National Institute of Aerospace Oksana Tkachuk, Amazon Web Services Stefano Tonetta, FBK Nestan Tsiskaridze, Stanford University Caterina Urban, INRIA Cristian-Ioan Vasile, Lehigh University Virginie Wiels, ONERA / DTIS Huan Xu, University of Maryland Huafeng Yu, TOYOTA InfoTechnology Center USA -- ____________________________________________________________ __ /\ \ \_____ / \ ###[==_____> / \ /_/ __ / __ \ \ \_____ | ( ) | ###[==_____> /| /\/\ |\ /_/ / | | | | \ / |=|==|=| \ Kristin Yvonne Rozier, Ph.D. / | | | | \ Black&Veatch Associate Prof, Iowa State Univ / USA | ~||~ |NASA \ |______| ~~ |______| Fall, 2022: at Carnegie Mellon (__||__) Office: GHC 7211 /_\ /_\ !!! !!! laboratory.temporallogic.org From ruy at cin.ufpe.br Thu Nov 17 06:34:13 2022 From: ruy at cin.ufpe.br (Ruy Jose Guerra Barretto de Queiroz) Date: Thu, 17 Nov 2022 08:34:13 -0300 Subject: [TYPES/announce] 29th WoLLIC 2023 - Call for Papers In-Reply-To: References: Message-ID: [Please distribute. Apologies for multiple postings] CALL FOR PAPERS WoLLIC 2023 29th Workshop on Logic, Language, Information and Computation 11-14 July, 2023 Halifax, Nova Scotia, Canada ORGANISATION Department of Mathematics and Statistics, Dalhousie University, Canada Centro de Inform?tica, Universidade Federal de Pernambuco, Brazil 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-ninth WoLLIC will be held at the Department of Mathematics and Statistics, Dalhousie University, Halifax, Nova Scotia, Canada, July 11 to 14, 2023. It is sponsored by the Association for Symbolic Logic (ASL), the Interest Group in Pure and Applied Logics (IGPL), the The Association for Logic, Language and Information (FoLLI), the European Association for Theoretical Computer Science (EATCS), and the Sociedade Brasileira de L?gica (SBL). LOCATION Halifax (https://urldefense.com/v3/__https://www.halifax.ca/__;!!IBzWLUs!TfQFH82-eSw7W43xC_ODUZ8bjcqqRYW74Ak1fr7HWrosrOfZ7fcYNw1xiR4rJShQbTmyR-23GpWnt-xFAGkszjTCll-o$ ) is the capital and largest municipality of the Canadian province of Nova Scotia, and the largest municipality in Atlantic Canada. (Wikipedia) FORMAT WoLLIC 2023 will be a hybrid event. SCOPE 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. PAPER SUBMISSION 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!TfQFH82-eSw7W43xC_ODUZ8bjcqqRYW74Ak1fr7HWrosrOfZ7fcYNw1xiR4rJShQbTmyR-23GpWnt-xFAGkszi72mchf$ ). 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 either in person or via remote connection. (At least one author is required to pay a full, on-site registration fee before granting that the paper will be published in the proceedings.) Papers must be submitted electronically at the WoLLIC 2023 EasyChair website https://urldefense.com/v3/__https://easychair.org/conferences/?conf=wollic2023__;!!IBzWLUs!TfQFH82-eSw7W43xC_ODUZ8bjcqqRYW74Ak1fr7HWrosrOfZ7fcYNw1xiR4rJShQbTmyR-23GpWnt-xFAGkszvBIZ2l6$ . PROCEEDINGS The proceedings of WoLLIC 2023, 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 2023 issue of a scientific journal (tba). INVITED SPEAKERS (TBA) STUDENT GRANTS ASL sponsorship of WoLLIC 2023 will permit ASL student members to apply for a modest travel grant (deadline: 90 days before the event starts). See https://urldefense.com/v3/__http://www.aslonline.org/studenttravelawards.html__;!!IBzWLUs!TfQFH82-eSw7W43xC_ODUZ8bjcqqRYW74Ak1fr7HWrosrOfZ7fcYNw1xiR4rJShQbTmyR-23GpWnt-xFAGkszk9_2zWb$ for details. IMPORTANT DATES February 20, 2023: Abstracts deadline February 27, 2023: Full papers deadline May 15, 2023: Author notification June 5, 2023: Final version deadline (firm) PROGRAMME COMMITTEE Bahareh Afshari (University of Amsterdam, Netherlands) Zena Ariola (University of Oregon, USA) Adriana Balan (University Politechnica of Bucharest, Romania) Marta B?lkov? (Czech Academy of Sciences, Czech Republic) Jos?e Desharnais (Laval University, Canada) David Fern?ndez-Duque (Czech Academy of Sciences, Czech Republic) Santiago Figueira (Universidad de Buenos Aires, Argentina) Silvia Ghilezan (University of Novi Sad & Mathematical Institute SASA, Serbia) Sujata Ghosh (Indian Statistical Institute, India) Nina Gierasimczuk (Danish Technical University, Denmark) Helle Hvid Hansen (University of Groningen, Netherlands) (Co-Chair) Andreas Herzig (CNRS, University of Toulouse, France) Juha Kontinen (University of Helsinki, Finland) Roman Kuznets (TU Wien, Austria) Martha Lewis (University of Bristol, UK) Johannes Marti (University of Oxford, UK) George Metcalfe (University of Bern, Switzerland) Michael Moortgat (Utrecht University, Netherlands) Cl?udia Nalon (University of Brasilia, Brasil) Carlos Olarte (Universit? Sorbonne Paris Nord, France) Sophie Pinchinat (University of Rennes, France) Francesca Poggiolesi (CNRS, University Paris 1 Panth?on-Sorbonne, France) Sylvain Pogodalla (INRIA Nancy, France) Revantha Ramanayake (University of Groningen, Netherlands) Mehrnoosh Sadrzadeh (University College London, UK) Philip Scott (University of Ottawa, Canada) Andre Scedrov (University of Pennsylvania, USA) (Co-Chair) Viorica Sofronie-Stokkermans (University of Koblenz-Landau, Germany) Kazushige Terui (Kyoto University, Japan) Mladen Vukovi? (University of Zagreb, Croatia) 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 Julien Ross (Dalhousie Univ) Peter Selinger (Dalhousie Univ) (Co-Chair) Anjolina G. de Oliveira (Univ Federal de Pernambuco, Brasil) Ruy de Queiroz (Univ Federal de Pernambuco, Brasil) (co-chair) SPECIALl SESSION: SCREENING OF MOVIES ABOUT MATHEMATICIANS (TBA) FURTHER INFORMATION Contact one of the Co-Chairs of the Organising Committee. WEB PAGE https://urldefense.com/v3/__http://wollic.org/wollic2023/__;!!IBzWLUs!TfQFH82-eSw7W43xC_ODUZ8bjcqqRYW74Ak1fr7HWrosrOfZ7fcYNw1xiR4rJShQbTmyR-23GpWnt-xFAGkszgNNFdc7$ -------------- next part -------------- An HTML attachment was scrubbed... URL: From Chris.Heunen at ed.ac.uk Tue Nov 22 12:22:09 2022 From: Chris.Heunen at ed.ac.uk (Chris Heunen) Date: Tue, 22 Nov 2022 17:22:09 +0000 Subject: [TYPES/announce] SYCO 10: Call for Participation Message-ID: -------------------------------------------------------- CALL FOR PARTICIPATION TENTH SYMPOSIUM ON COMPOSITIONAL STRUCTURES (SYCO 10) In person at the University of Edinburgh, UK 19-20 December 2022 Registration deadline: 11 December 2022 (AoE) It is possible to attend online, but not to present online. Please register even when attending online. https://urldefense.com/v3/__https://www.cl.cam.ac.uk/events/syco/10__;!!IBzWLUs!X7witIkpD0mAih_1aY9fcjL6BQRDGlD5Shlj9RfIAuHBGKolXgotY-iDpvfqGh6kE1pWTF9VLp39sG7onb56N6xhTZPLAy748I6GNg$ -------------------------------------------------------- The Symposium on Compositional Structures (SYCO) is an interdisciplinary series of meetings aiming to support the growing community of researchers interested in the phenomenon of compositionality, from both applied and abstract perspectives, and in particular where category theory serves as a unifying common language. Previous SYCO events have been held at University of Birmingham, University of Strathclyde, University of Oxford, Chapman University, University of Leicester, Tallinn University of Technology, and University of Insubria. The programme consists of 2 invited talks and 18 contributed talks. -------------------------------------------------------- INVITED TALKS * John Baez (University of California Riverside) * Emily Roff (University of Edinburgh) -------------------------------------------------------- CONTRIBUTED TALKS Full schedule available at https://urldefense.com/v3/__https://www.cl.cam.ac.uk/events/syco/10__;!!IBzWLUs!X7witIkpD0mAih_1aY9fcjL6BQRDGlD5Shlj9RfIAuHBGKolXgotY-iDpvfqGh6kE1pWTF9VLp39sG7onb56N6xhTZPLAy748I6GNg$ * Cl?mence Chanavat: Cubical Type Theory Inside a Presheaf Topos * Jade Edenstar Master, Benjamin Merlin Bumpus, Zoltan A. Kocsis: Structured Decompositions: Structural and Algorithmic Compositionality * Jade Edenstar Master: How to Compose Shortest Paths * Makoto Hamana: Complete Algebraic Semantics for Second-Order Rewriting Systems based on Abstract Syntax with Variable Binding * Peter Hines: On coherence for Stoic conjunction * Satoshi Kura: On the Relationship Between Weakest Precondition Transformers and CPS Transformations * Louis Lemonnier, Vladimir Zamdzhiev, Titouan Carette: Central Submonads and Notions of Computation * Leo Lobski: Quantum quirks, classical contexts: Towards a Bohrification of effect algebras * Edward Morehouse: Locally Cubical Gray-Categories * Giti Omidvar, Lutz Strassburger: The Composition of Combinatorial Flows * Alex Rice, Jamie Vicary, Eric Finster: A Type Theory for Strictly Associative Infinity Categories * Richard Statman: Cayley Monoids * Calin Tataru: A layout algorithm for higher-dimensional string diagrams * Ana Luiza Tenorio, Hugo Luiz Mariano, Peter Arndt: Non-topos sheaf on non-unital monoidal categories * Jamie Vicary: Exact dynamics in dual-unitary quantum circuits with projective measurements * Vincent Wang: Foam, data structures, and games * Carlos Zapata-Carratala: What is n-ary associativity? A Proposal of Higher-Arity Categories -------------------------------------------------------- REGISTRATION Registration is open until the 11th of December, 2022. You can register for either the in person meeting or for the online event. Registration is free. Please register via: https://urldefense.com/v3/__https://forms.gle/RQeSe2zcndXghwhM6__;!!IBzWLUs!X7witIkpD0mAih_1aY9fcjL6BQRDGlD5Shlj9RfIAuHBGKolXgotY-iDpvfqGh6kE1pWTF9VLp39sG7onb56N6xhTZPLAy4RNx57Lw$ More details are available on the conference website: https://urldefense.com/v3/__https://www.cl.cam.ac.uk/events/syco/10__;!!IBzWLUs!X7witIkpD0mAih_1aY9fcjL6BQRDGlD5Shlj9RfIAuHBGKolXgotY-iDpvfqGh6kE1pWTF9VLp39sG7onb56N6xhTZPLAy748I6GNg$ -------------------------------------------------------- PROGRAMME COMMITTEE Robin Cockett, University of Calgary Carmen Constantin, University of Edinburgh Ross Duncan, University of Strathclyde Chris Heunen, University of Edinburgh Robin Kaarsgaard, University of Edinburgh (chair) Marie Kerjean, Universit? Paris 13 Aleks Kissinger, University of Oxford Dan Marsden, University of Nottingham Jade Master, University of Strathclyde Samuel Mimram, ?cole Polytechnique Jean-Simon Pacaud Lemay, Kyoto University Simona Paoli, University of Aberdeen Mathys Rennela, INRIA Paris Mehrnoosh Sadrzadeh, University College London Pawel Sobocinski, Tallinn University of Technology Tarmo Uustalu, Reykjavik University Niccol? Veltri, Tallinn University of Technology Jamie Vicary, University of Cambridge Maaike Zwart, IT University of Copenhagen -------------------------------------------------------------- STEERING COMMITTEE Ross Duncan, University of Strathclyde Chris Heunen, University of Edinburgh Dominic Horsman, University of Grenoble Aleks Kissinger, University of Oxford Samuel Mimram, ?cole Polytechnique Simona Paoli, University of Aberdeen Mehrnoosh Sadrzadeh, University College London Pawel Sobocinski, Tallinn University of Technology Jamie Vicary, University of Cambridge The University of Edinburgh is a charitable body, registered in Scotland, with registration number SC005336. Is e buidheann carthannais a th? ann an Oilthigh Dh?n ?ideann, cl?raichte an Alba, ?ireamh cl?raidh SC005336. From dezani at di.unito.it Wed Nov 23 12:35:16 2022 From: dezani at di.unito.it (Mariangiola Dezani) Date: Wed, 23 Nov 2022 18:35:16 +0100 Subject: [TYPES/announce] 2023 Alonzo Church Award: Call for Nominations Message-ID: <0A0DDE3F-63C2-4789-9416-3A533566AC1C@di.unito.it> CALL FOR NOMINATIONS The 2023 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!XIn0q951p5ge58_HPcQZouQplEzM7AbHvYN-JjSt-Es3Vhzy83FKzCA1XlP4kHlTPk3WqZMIcguam0CyBVvq_LxrfgJ5SiUc$ , https://urldefense.com/v3/__https://www.eatcs.org/index.php/church-award/__;!!IBzWLUs!XIn0q951p5ge58_HPcQZouQplEzM7AbHvYN-JjSt-Es3Vhzy83FKzCA1XlP4kHlTPk3WqZMIcguam0CyBVvq_Lxrfq7ZI5XZ$ , and https://urldefense.com/v3/__https://www.eacsl.org/alonzo-church-award/__;!!IBzWLUs!XIn0q951p5ge58_HPcQZouQplEzM7AbHvYN-JjSt-Es3Vhzy83FKzCA1XlP4kHlTPk3WqZMIcguam0CyBVvq_LxrftrbDAtx$ . The 2022 Alonzo Church Award was given to Dexter Kozen for his ground- breaking work on the theory and applications of Kleene Algebra with Tests. 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 2023 award, the cut-off date is January 1, 1998. 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 2023 award are now being solicited. The nominating letter must summarise 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 for the 2023 award are automatically considered for all future editions of the award, until they receive the award or the nominated papers are no longer eligible. Nominations should be submitted to dezani at di.unito.it and to mariangiola.dezani at gmail.com by February 1, 2023. PRESENTATION OF THE AWARD The 2023 award will be presented at the 50th EATCS International Colloquium on Automata, Languages and Programming, which is scheduled to take place in Paderborn - Germany on July 10-14, 2023. 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 2023 Alonzo Church Award Committee consists of the following five members: Thomas Colcombet, Mariangiola Dezani (chair), Marcelo Fiore, Radha Jagadeesan, and Igor Walukiewicz. @@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@ Mariangiola Dezani-Ciancaglini Dipartimento di Informatica Universita' di Torino c.Svizzera 185, 10149 Torino (Italy) -------------- next part -------------- An HTML attachment was scrubbed... URL: From violetpun at gmail.com Wed Nov 23 16:05:04 2022 From: violetpun at gmail.com (Violet Ka I Pun) Date: Wed, 23 Nov 2022 22:05:04 +0100 Subject: [TYPES/announce] 2 PhD positions in Formal Analysis for Concurrent Workflows in HVL, Bergen, Norway Message-ID: <40D5C169-818C-4322-A4C8-0C1D480A02E2@gmail.com> ---------------------------------------------------------------------------------- 2 PhD positions in Formal Analysis for Concurrent Workflows available at Dept. of Computer Science, Western Norway University of Applied Sciences, Bergen, Norway ---------------------------------------------------------------------------------- Deadline: 13th January 2023 Link to detailed job posting: https://urldefense.com/v3/__https://www.jobbnorge.no/en/available-jobs/job/235100/two-phd-research-fellows-in-formal-analysis-for-concurrent-workflows-for-a-period-of-3-years__;!!IBzWLUs!VqJM05qHB9RcDRgZ3ukk5pPnn_oAFAAaOtiVwHB_TGZoVwfwtYUDMr_2kaqkzTDAP4uHaUBb90WntjRqVLFdRHQGDkYcG6hD$ About the positions -------------------------- The two positions are part of the Norwegian Research Council Young Research Talents project CroFlow (https://urldefense.com/v3/__https://croflow.github.io/__;!!IBzWLUs!VqJM05qHB9RcDRgZ3ukk5pPnn_oAFAAaOtiVwHB_TGZoVwfwtYUDMr_2kaqkzTDAP4uHaUBb90WntjRqVLFdRHQGDq1OqZXE$ ). The goal of the project is to develop an innovative model-driven methodology and framework that facilitates automation of planning concurrent workflows with highly automated analyses and tool support. Cross-organisational workflows involve multiple concurrently running workflows coming from different organisations. While tasks in these individual workflows may run independently in parallel, there are very often dependencies between them, e.g., execution orders or shared resources, which makes planning such workflows particularly challenging and error prone. The project aims to leverage various techniques in formal methods to model and analyse cross-organisational workflows in terms of concurrent programs, and to automate workflow revisioning upon changes in the dependencies. These are exciting positions for candidates interested in topics such as software verification, static analysis and formal modelling languages. The two prospective PhD students will work together and contribute to the project from three perspectives: - to design a formal modelling language for concurrent workflows with explicit notions of dependencies with respect to execution orders or shared resources, - to reconstruct existing workflows in the form of a formal model based on event logs, and - to develop automated formal analyses for the concurrent workflow models. The PhD students will collaborate with the project external partners of CroFlow, including Haukeland University Hospital in Bergen, Uppsala University in Sweden and the University of L?beck in Germany. Contact: Associate Professor Violet Ka I Pun ( Violet.Ka.I.Pun at hvl.no ) -- Violet Ka I Pun / https://urldefense.com/v3/__http://violet.foldr.org/__;!!IBzWLUs!VqJM05qHB9RcDRgZ3ukk5pPnn_oAFAAaOtiVwHB_TGZoVwfwtYUDMr_2kaqkzTDAP4uHaUBb90WntjRqVLFdRHQGDnzm8-EF$ -------------- next part -------------- An HTML attachment was scrubbed... URL: From F.Sieczkowski at hw.ac.uk Thu Nov 24 14:23:23 2022 From: F.Sieczkowski at hw.ac.uk (Sieczkowski, Filip K) Date: Thu, 24 Nov 2022 19:23:23 +0000 Subject: [TYPES/announce] Fully funded PhD positions in PL theory and interactive theorem proving at Heriot-Watt University in Edinburgh Message-ID: *Fully funded PhD positions in PL theory and interactive theorem proving at Heriot-Watt University in Edinburgh* We are soliciting applications for PhD positions in the theory of programming languages and interactive theorem proving (broadly construed) at the Department of Computer Science of Heriot-Watt University. Potential PhD projects can be found on our department website, https://urldefense.com/v3/__https://www.hw.ac.uk/uk/schools/mathematical-computer-sciences/research/phd/phd-oportunities-in-computer-science.htm__;!!IBzWLUs!RxfAeApgKyBBcwvubnxedvANQKnQdsBcWMJlP_E1z0x99jvczUeKM2ImLatCr0ibY3zEp-nUT0xI3f7qbwGMI3Fbiu1KYVr2aRCnA0p4$ , under the ?Rigorous Systems? header, although the list is not exhaustive and other related topics can be discussed and arranged. We encourage prospective candidates to contact Kathrin Stark (k.stark at hw.ac.uk), Filip Sieczkowski (f.sieczkowski at hw.ac.uk) or Marko Doko (m.doko at hw.ac.uk) for more information. Why do your PhD at Heriot-Watt? The programming languages community at the University is strong and growing fast, which makes it a great place to start your research career. We are further a part of the vibrant Scottish programming languages community, with Scottish Programming Languages Institute organising various activities, such as summer schools, seminar series, and more. Finally, Edinburgh is an exciting city to live in, with plenty of cultural and recreational opportunities. The positions are open for both UK and international applicants. Find information on how to apply see the application website, the deadline is January, 23. Please contact us to help you navigate the application process. Best regards, -- Filip Sieczkowski ________________________________ Founded in 1821, Heriot-Watt is a leader in ideas and solutions. With campuses and students across the entire globe we span the world, delivering innovation and educational excellence in business, engineering, design and the physical, social and life sciences. This email is generated from the Heriot-Watt University Group, which includes: 1. Heriot-Watt University, a Scottish charity registered under number SC000278 2. Heriot- Watt Services Limited (Oriam), Scotland's national performance centre for sport. Heriot-Watt Services Limited is a private limited company registered is Scotland with registered number SC271030 and registered office at Research & Enterprise Services Heriot-Watt University, Riccarton, Edinburgh, EH14 4AS. The contents (including any attachments) are confidential. If you are not the intended recipient of this e-mail, any disclosure, copying, distribution or use of its contents is strictly prohibited, and you should please notify the sender immediately and then delete it (including any attachments) from your system. From matteo.maffei at tuwien.ac.at Mon Nov 28 02:35:49 2022 From: matteo.maffei at tuwien.ac.at (Maffei, Matteo) Date: Mon, 28 Nov 2022 07:35:49 +0000 Subject: [TYPES/announce] 7 PhD positions available in Austria within the SPyCoDe (Semantic and Cryptographic Foundations of Security and Privacy by Compositional Design) Special Research Program Message-ID: SPyCoDe (Semantic and Cryptographic Foundations of Security and Privacy by Compositional Design) is a special research program funded by FWF. World-class researchers from TU Wien, IST Austria, Universit?t Wien, TU Graz and Universit?t Klagenfurt team up to create the technological foundations for designing complex, multi-layer systems with provable S&P guarantees. Interdisciplinary approach integrates computer-aided verification, system security, cryptography, and touching on further fields, like networks, game theory, and blockchains. The team includes experts from all disciplines at the core of SPyCoDe, with 6 ERC grant holders (for a total of 10 ERC grants), 6 young researchers who already received prestigious awards, and >40% female researchers. SPyCoDe is looking for 7 highly qualified and motivated students who have a master's degree in computer science or another related field and experience in formal methods, system security, security and privacy and/or cryptography for collaborative interdisciplinary research. SPyCoDe is offering PhD positions for 4 years for 30 hours/week, with an option to upgrade to 40 hours/week with very competitive salary. The 7 projects available in this call are list below, along with the principal investigator acting as supervisor and the research institution: ? Project Title Principal Investigator Research Institution 1 Interface Theory for Security and Privacy Henzinger , Thomas A. IST Austria 2 Game-Theoretic Models for Blockchain Applications Fuchsbauer, Georg TU Wien 5 Verification of Side Channel Properties Bloem, Roderick TU Graz 4 Cross-Layer Security for Blockchain Consensus Pietrzak, Krzysztof IST Austria 5 Security and Privacy by Design for Smart Contracts Maffei, Matteo TU Wien 6 Secure Blockchains in Network Transition Periods Ullrich, Johanna Universit?t Wien 7 Secure Network and Hardware for Efficient Blockchains Kokoris-Kogias, Eleftherios IST Austria Application start: 28.11.2022 Application deadline: 23.12.2022 Expected start of work: 01.02.2023 You can find more information about the projects, requirements for candidates and application procedure on the SPyCoDe website https://urldefense.com/v3/__https://spycode.at__;!!IBzWLUs!Ug1zy62Qh-_anc49iS1lGS1lVqshVSLO09qlTVC8nBGarculcWb7a437xwQKCur1Wx8LFtxKyVrm3GQwgyIj9YZCiAV3tSMJNlV7dKk-E1M$ -------------- next part -------------- An HTML attachment was scrubbed... URL: From smuller2 at iit.edu Mon Nov 28 15:10:10 2022 From: smuller2 at iit.edu (Stefan Muller) Date: Mon, 28 Nov 2022 14:10:10 -0600 Subject: [TYPES/announce] Tenure-Track Faculty Position at Illinois Tech Message-ID: Illinois Tech is hiring this year (for Fall 2023), and PL is likely to be one of a few focus areas. We have a close-knit, highly collaborative faculty and an excellent, diverse, and excited group of students, and are located in Chicago! Application and more information are here: https://urldefense.com/v3/__https://academicjobsonline.org/ajo/jobs/23124__;!!IBzWLUs!WelIp5g__lse0RS9Iqv49Ip3iNnaxONHOhHGK26TKkJANioKRO_5WaFF2uHu5BH-b0ctaYSvNCmOpzLSi5AcOMoWjiMoZa6x$ Feel free to contact me (smuller2 at iit.edu) with any questions. Stefan -- Stefan Muller Gladwin Development Chair Assistant Professor Computer Science Department Illinois Institute of Technology From carsten at dcs.bbk.ac.uk Mon Nov 28 15:14:42 2022 From: carsten at dcs.bbk.ac.uk (Carsten Fuhs) Date: Mon, 28 Nov 2022 20:14:42 +0000 Subject: [TYPES/announce] FSCD 2023: First Call for Papers Message-ID: <087553ed-a3c5-dff3-97d2-44712caad7ee@dcs.bbk.ac.uk> CALL FOR PAPERS Eighth International Conference on Formal Structures for Computation and Deduction (FSCD 2023) July 3-6, 2023, Rome, Italy https://urldefense.com/v3/__https://easyconferences.eu/fscd2023/__;!!IBzWLUs!WKzkX8GXPNruUEGQhunN41gqqVl7ZRCEhHkMykcb4jlC_iGhc21za8Q84YMB38R-2REp0vuBiuUWiBZQn7FdgZousz7DgWzLYFte$ In-cooperation with ACM SIGLOG and SIGPLAN IMPORTANT DATES --------------- All deadlines are midnight anywhere-on-earth (AoE); late submissions will not be considered. Abstract: January 30, 2023 Submission: February 3, 2023 Rebuttal: March 24-28, 2023 Notification: April 13, 2023 Final version: April 27, 2023 OVERVIEW -------- FSCD (https://urldefense.com/v3/__https://fscd-conference.org/__;!!IBzWLUs!WKzkX8GXPNruUEGQhunN41gqqVl7ZRCEhHkMykcb4jlC_iGhc21za8Q84YMB38R-2REp0vuBiuUWiBZQn7FdgZousz7Dgczxr8sv$ ) 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 logic, 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; - Applications of formal systems in education. 6. Formal Systems for 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 ------------- We aim to have a special issue of Logical Methods in Computer Science of selected papers. More details will be provided later. SUBMISSION GUIDELINES --------------------- The submission site is: https://urldefense.com/v3/__https://easychair.org/conferences/?conf=fscd2023__;!!IBzWLUs!WKzkX8GXPNruUEGQhunN41gqqVl7ZRCEhHkMykcb4jlC_iGhc21za8Q84YMB38R-2REp0vuBiuUWiBZQn7FdgZousz7DgTFT6JEU$ Submissions must be formatted using the LIPIcs style files (https://urldefense.com/v3/__https://submission.dagstuhl.de/series/details/5*author__;Iw!!IBzWLUs!WKzkX8GXPNruUEGQhunN41gqqVl7ZRCEhHkMykcb4jlC_iGhc21za8Q84YMB38R-2REp0vuBiuUWiBZQn7FdgZousz7DgQdGAjN-$ ) and submitted via EasyChair. 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. Shorter papers are welcome and will be given equal consideration. A system description 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 each accepted paper is expected to register and present the work in person at the conference. In case that this is not possible for some unforeseen reason, online presentation will be arranged, but in person registration will still be required. 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. When submitting the paper, other authors should declare to the PC Chair that at least 50% of contribution is made by the junior researcher(s). PROGRAM COMMITTEE CHAIRS ----------------------- Marco Gaboardi, Boston University Femke van Raamsdonk, Vrije Universiteit Amsterdam Email: fscd2023 at easychair.org PROGRAM COMMITTEE ----------------- Martin Avanzini, INRIA Patrick Bahr, ITU Copenhagen Pablo Barenbaum, University of Quilmes (CONICET) & ICC Filippo Bonchi, University of Pisa Sabine Broda, University of Porto Valeria De Paiva, Topos Institute Andrej Dudenhefner, TU Dortmund Santiago Escobar, Universitat Polit?cnica de Val?ncia Claudia Faggian, University of Paris (IRIF) Frank (Peng) Fu, Dalhousie University Silvio Ghilardi, University of Milano Clemens Grabmayer, GSSI or Gran Sasso Science Institute Nao Hirokawa, JAIST Mirai Ikebuchi, National Institute of Informatics Ambrus Kaposi, Eotvos Lorand University Ian Mackie, University of Sussex Radu Mardare, University of Strathclyde Aart Middeldorp, University of Innsbruck Anders Mortberg, University of Stockholm Daniele Nantes-Sobrinho, Imperial College London / University of Bras?lia Vincent van Oostrom, Independent researcher Grigore Rosu, University of Illinois Urbana-Champaign Luca Roversi, University of Torino Aleksy Schubert, University of Warsaw Jakob G. Simonsen, University of Copenhagen Alwen Tiu, Australian National University Valeria Vignudelli, CNRS/ENS Lyon Johannes Waldmann, HTWK Leipzig Sarah Winkler, University of Bolzano CONFERENCE CHAIR ---------------- Daniele Gorla, University of Rome - Sapienza WORKSHOP CHAIR -------------- Ivano Salvo, University of Rome - Sapienza STEERING COMMITTEE WORKSHOP CHAIR -------------------------------- Cynthia Kop, Radboud University Nijmegen PUBLICITY CHAIR --------------- Carsten Fuhs, Birkbeck, University of London FSCD STEERING COMMITTEE ----------------------- Zena Ariola, University of Oregon Alejandro D?az-Caro, Quilmes University & ICC/CONICET Amy Felty, University of Ottawa Carsten Fuhs, Birkbeck, University of London Herman Geuvers (Chair), Radboud University Nijmegen Silvia Ghilezan, University of Novi Sad J?rgen Giesl, RWTH Aachen University Stefano Guerrini, Universit? de Paris 13 Delia Kesner, Universit? de Paris Diderot Naoki Kobayashi, University of Tokyo Cynthia Kop, Radboud University Nijmegen Luigi Liquori, Inria Daniele Nantes, Imperial College London / University of Bras?lia From erdweg at uni-mainz.de Fri Nov 25 11:43:48 2022 From: erdweg at uni-mainz.de (Erdweg, Sebastian) Date: Fri, 25 Nov 2022 16:43:48 +0000 Subject: [TYPES/announce] PhD and post-doc positions in Mainz, Germany Message-ID: <8257D06C-247A-47D5-98A4-3BE8F6A597F8@uni-mainz.de> We have multiple open positions for PhD students and post-docs in the PL Group of the University of Mainz in Germany. The available positions include a gross monthly salary of ~4000 Euro. Our team meets and socializes in Mainz; remote work is an option. The PL Group at the University of Mainz was founded in 2019. Our goal is to support developers in creating and maintaining software systems that are easier to write, more secure, run faster, and consume less energy. Our current research topics include: -- Incremental computing: How can a computation react to a change of its input efficiently? We have observed up to 10,000x speedups in prior work, can incrementality help us save as much energy? Can we build a new foundation for incremental computing to support a wider range of computations? -- WebAssembly: How can we discover and prevent security vulnerabilities in WebAssembly? We have built a data-flow analysis platform for WebAssembly to identify properties of WebAssembly programs at compile time. Can this platform be used to protect WebAssembly users while also optimizing the code for performance? -- Datalog: How can the power of Datalog best be exploited in modern software development? How can we abstract over and hide the technicalities of Datalog, for example, by compiling DSLs to Datalog. And how can we optimize Datalog code to provide truly declarative performance, without exposing users to details of the underlying database technology? -- Language engineering: How can we build programming-language tools with modest effort and without duplicating the language's semantics? For example, can we derive type checkers, debuggers, and other editor services from the language?s semantics? And does this require a language workbench or can we support rich services for embedded languages as well? Mainz is part of the Frankfurt Metropolitan Area and only a short train ride away from Frankfurt's international community and culture. Mainz itself lies at the confluence of the Rhine and Main rivers, surrounded by plenty of nature. https://urldefense.com/v3/__https://mainz.de/en/worth-seeing/reasons-to-love-mainz.php__;!!IBzWLUs!Vg20rrpKTO1LE18FQ_3Sauc3RHj2z417izDJatQxpBFvwBTscaxIGwpXSgc-8A--sYoD64r9SOuJZ7veccxytaX4la1QJ0sBzg$ I'm excited to hear from interested candidates via email. If you know potential candidates, please forward this message to them. Sebastian Erdweg https://urldefense.com/v3/__https://www.pl.informatik.uni-mainz.de/erdweg__;!!IBzWLUs!Vg20rrpKTO1LE18FQ_3Sauc3RHj2z417izDJatQxpBFvwBTscaxIGwpXSgc-8A--sYoD64r9SOuJZ7veccxytaX4la3bNuod-A$ From carsten at dcs.bbk.ac.uk Tue Nov 29 06:59:04 2022 From: carsten at dcs.bbk.ac.uk (Carsten Fuhs) Date: Tue, 29 Nov 2022 11:59:04 +0000 Subject: [TYPES/announce] FSCD-CADE 2023: Call for Workshop Proposals Message-ID: (Apologies for the cross postings.) -------------------------------------------------------------------- Call for Workshop and Tutorial Proposals - FSCD 2023, 8th edition of the International Conference on Formal Structures for Computation and Deduction (https://urldefense.com/v3/__https://easyconferences.eu/fscd2023/__;!!IBzWLUs!XEqE4_FzifZWe-_TPKpB9oDG9PqC5ETwnGTME_hkVd4mNWru6pdhq-081HKeeHP5PYSGD71Svl9ihEa5pwB7o9OCsmw1mdkGgXsO$ ) July 3-6, 2023 - CADE-29, the 29th Conference on Automated Deduction (https://urldefense.com/v3/__https://easyconferences.eu/cade2023/__;!!IBzWLUs!XEqE4_FzifZWe-_TPKpB9oDG9PqC5ETwnGTME_hkVd4mNWru6pdhq-081HKeeHP5PYSGD71Svl9ihEa5pwB7o9OCsmw1mcfiZOcC$ ) July 1-4, 2023 Rome, Italy We invite proposals for workshops, tutorials or other satellite events, on any topic related to formal structures in computation, deduction and automated reasoning, from theoretical foundations to tools and applications. FSCD satellite events will take place before the main conference on July 1-2, and CADE satellite events will take place after the main conference on July 4 (afternoon)-5. It is expected that satellite events would run for 1/2, 1 or 2 days (max 1 and 1/2 day for CADE satellite events), and be open to participants of parallel events. Please note overlaps between FSCD workshops and CADE conference and between CADE workshops and FSCD conference (see Important Dates below). PROPOSALS -------------------- Proposals must be limited to three pages and should be submitted via easychair: https://urldefense.com/v3/__https://easychair.org/my/conference?conf=fscd23cade29ws__;!!IBzWLUs!XEqE4_FzifZWe-_TPKpB9oDG9PqC5ETwnGTME_hkVd4mNWru6pdhq-081HKeeHP5PYSGD71Svl9ihEa5pwB7o9OCsmw1mfg_ncDs$ Each proposal should consist of the following two parts. 1) A description part including: - a short scientific justification of the proposed topic, its significance, and the particular benefits of the workshop to the community, as well as a list of previous or related workshops (if relevant); - a brief description (up to 120 words) of the event for the website and publicity material. 2) An organisational part including: - contact information for the workshop organisers; - proposed affiliated conference; - estimate of the number of workshop participants; - proposed format and agenda (e.g. paper presentations, tutorials, demo sessions, etc.) - potential invited speakers; - procedures for selecting papers and participants; - tentative schedule for paper submission and notification of acceptance; - plans for dissemination, if any (e.g. a journal special issue); - duration (which may vary from half a day to two days (max 1 and 1/2 days for CADE)); - any other special requirements. The Organising Committee of FSCD-CADE will determine the final list of accepted workshops based on the recommendations from the Workshop Chairs of the hosting conferences and availability of space and facilities. The organisers of satellite events are expected to create and maintaina website for the event; handle paper selection, reviewing and acceptance; draw up a tentative programme of talks; advertise their event though specialist mailing lists; prepare the informal pre-proceedings (if applicable) in a timely fashion; and arrange any post-proceedings. The FSCD-CADE organising committee will handle promotion of the event on the main conference website; integration of the event's programme into the overall timetable; registration of participants; arrangement of an appropriate meeting room; and provision of lunch and coffee breaks for participants. The organisers may rely on one free registration for every workshop, to be used e.g. for one invited speaker. No other cost will be covered by the local organisation. Workshop organisers are encouraged to find sponsors for financing workshop expenses. IMPORTANT DATES -------------------- Main Conferences: CADE July 1-4, 2023 FSCD July 3-6, 2023 Workshops: CADE July 4 (afternoon) and 5, 2023 FSCD July 1-2, 2023 Submission of workshop proposals: December 18th, 2022 Notification of success of proposals: December 23rd, 2022 -------------------- Best wishes, Ivano Salvo Workshop Chair From hbarendregt at gmail.com Tue Nov 29 10:06:24 2022 From: hbarendregt at gmail.com (Henk Barendregt) Date: Tue, 29 Nov 2022 16:06:24 +0100 Subject: [TYPES/announce] New Lambda Calculus book Message-ID: Dear colleagues, We are delighted to announce that our new book "A Lambda Calculus Satellite" has been recently published. This book presents the state of the art of research in lambda calculus in 2022, including the solutions to most open problems raised in "The Lambda Calculus, its syntax and semantics" (1981/84). It contains many examples, exercises, and open problems for you to solve. Further details are provided below. Best wishes, Henk Barendregt and Giulio Manzonetto ================================================================= *** BOOK ANNOUNCEMENT *** A Lambda Calculus Satellite - 1st Edition Henk Barendregt, Radboud University Giulio Manzonetto, University Sorbonne Paris Nord with chapters by Stefano Guerrini and Vincent Padovani College Publications, October 2022 602 pages, ISBN 978-1-84890-415-6 https://urldefense.com/v3/__https://tinyurl.com/mryxjksn__;!!IBzWLUs!TDSYugG1yjtKvhrRBdf0bb_0WSoSgUqgLbDyROIL60x2LaZ1_wBpzW7soGm7dNxRzivOt79uM22YVlvrn8bX5DqY_psOPLLsG1E$ ================================================================= DESCRIPTION: In 1936 the notion of intuitive computability was operationalized in two different ways: via Turing machines and via lambda-calculus. The difference consisted in manipulating beads (bits) for the former approach versus manipulating trees (rewriting lambda-terms) for the latter. Both proposals turned out to formalize the same notion of computability, and led to the Church-Turing Thesis, claiming that intuitive computability is captured in the correct way. This resulted in the foundation of imperative and functional programming. Variants of lambda-calculus are being used in another powerful field of applications, namely proof-checking, the basis for certifying mathematical theorems and thereby high tech industrial products. These two areas of research are still being actively investigated and make lambda-calculus a major tool in the present stages of science and of the industrial revolution. In this book lambda-calculus is considered from another angle: as a study of these tree-like structures, investigating the relation between their shape and their action. This is like studying numbers qualitatively, rather than for their applications dealing quantitatively with objects and phenomena in the world. Barendregt's book 'The Lambda Calculus, its Syntax and Semantics? (1981/84), does treat the subject from the same methodological viewpoint, and includes several open conjectures. In the more than four decades that have passed, most---but not all---of these conjectures have been solved, sometimes in ingenious PhD theses. This 'Satellite' to the aforementioned book presents these solutions in a uniform style and adds other topics of interest. ================================================================= CONTENTS: Acknowledgements About lambda-calculus About this book General notations I) Preliminaries 1 The lambda-calculus in a nutshell 2 B?hm trees and variations 3 Theories and models of lambda-calculus II) Reduction 4 Leaving a beta-reduction plane 5 Optimal lambda reduction (chapter by Stefano Guerrini) 6 Infinitary lambda calculus 7 Starlings (chapter by Vincent Padovani) III) Conversion 8 Perpendicular Lines Property 9 Bijectivity and invertibility in lambda-eta IV) Theories 10 Sensible theories 11 The kite V) Models 12 Ordered models and theories 13 Filter models 14 Relational models 15 Church algebras for lambda-calculus VI) Open Problems 16 Open Problems VII) Appendix A Mathematical background References Indices =================================================== -------------- next part -------------- An HTML attachment was scrubbed... URL: From kkmicins at syr.edu Tue Nov 29 17:04:32 2022 From: kkmicins at syr.edu (Kristopher K Micinski) Date: Tue, 29 Nov 2022 22:04:32 +0000 Subject: [TYPES/announce] Call for Participation: POPL'23 Message-ID: Call for Participation: POPL'23 January 15--21, 2022, Boston Registration now open: https://urldefense.com/v3/__https://cvent.me/kV4ZYZ__;!!IBzWLUs!Wm8jvIvdxhmWeqbq_OJ3U94m-enYMBS55jGsSTJ7l5nrXWHoePw-LWwdXTuqRENRm8me7Vg3RXVhUgrwCP93m9mGTNK8H8HZ$ (Early registration ends Fri, Dec 16!) POPL'23 --- The 50th ACM Symposium on Principles of Programming Languages, will be held in Boston, MA, from January 15 to January 21, 2023. The annual POPL meeting is a forum for the discussion of all aspects of programming languages and programming systems. This year marks POPL's 50th anniversary, and will bring POPL back to the site of its first occurrence: Boston, Massachusetts. The symposium is sponsored by ACM SIGPLAN, in cooperation with ACM SIGACT and ACM SIGLOG. This year's program consists of 74 research papers on a wide variety of topics. The registration is now open, see POPL'23 website for details. Location: POPL?23 will be held in person in Boston from Sunday, January 15 to Saturday, January 21, 2023. The conference will be held at the Boston Park Plaza hotel, just steps away from the beautiful Boston Common. POPL'22 will feature a keynote lectures by Viktor Vafeiadis. TutorialFest at POPL will host a wide variety of exciting tutorials, including: "Deductive Verification of Probabilistic Programs" by Benjamin Lucien Kaminski, Joost-Pieter Katoen, and Christoph Matheja "Incorrectness Logic and Under-approximation: Foundations of Bug Catching" by Quang Loc Le, Peter O'Hearn, and Azalea Raad "Isabelle/HOL: Foundations, Induction, and Coinduction" by Andrei Popescu, and Dmitriy Traytel "Neurosymbolic Programming" by Swarat Chaudhuri, Atharva Sehgal, Jennifer Sun, and Yisong Yue "QuickChick: Combining Random Testing and Verification in Coq" by Leonidas Lampropoulos "RUST: Regions, Uniqueness, Ownership & Types" by James Noble and Tobias Wrigstad "Using a Proof Assistant to Teach PL Theory, Without the Overhead" by Jonathan Aldrich and John Boyland "Z3 Internals -- A guide to principles, art and empirics of programming SMT solvers" by Nikolaj Bj?rner Mentoring: POPL'22 will include the following events for helping attendees with research and career opportunities in programming languages: Programming Languages and Mentoring Workshop (PLMW) Junior Faculty Mentoring Breakfast Mentoring Breakfast for Graduating PhDs and Postdocs Diversity, Equity, and Inclusion: POPL is committed to welcoming and fostering participation by diverse members of PL community. DEI events at POPL'22 include Women at POPL Lunch LGBTQ+ at POPL Lunch Co-located meetings: Certified Programs and Proofs (CPP) 2023 24th International Symposium on Practical Aspects of Declarative Languages (PADL) 2022 23rd International Conference on Verification, Model Checking, and Abstract Interpretation (VMCAI) 2022 Co-located workshops: Eighth International Workshop on Coq for Programming Languages (CoqPL) Seventh International Workshop on Languages for Inference (LAFI) ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation (PEPM) Workshop on Principles of Secure Compilation (PriSC) Programming Languages and the Law (ProLaLa) First Workshop on the Implementation of Type Systems (WITS) Organizing Committee: Andrew C. Myers (General Chair) Amal Ahmed (PC Chair) Ilya Sergey (Industrial Relations) Kristopher Micinski (Publicity) William Bowman and Anders Miltner (Workshops) Jeehoon Kang and Danfeng Zhang (Student Research Competition) Leonidas Lampropoulos and Mukund Raghothaman (Artifact Evaluation) Kostas Ferles and Yuepeng Wang (Web) Shraddha Barke and Konstantinos Kallas (Student Volunteer) Benjamin Delaware (Accessibility, Diversity, and Inclusion) Guilherme Espada (Video) Apoorv Ingle (Virtualization) Neringa Young (Treasury and Conference Manager) Industry Sponsors: POPL'22 gratefully acknowledges financial support from industry sponsors: Platinum: Jane Street, ahrefs, Epic Games, and Input | Output Silver: JetBrains Bronze: Certik, Certora, and Google PLMW Gold: Jane Street PLMW Silver: Galois Early stage: Veridise Women at POPL: Tarides From icfp.publicity at googlemail.com Thu Dec 1 03:31:44 2022 From: icfp.publicity at googlemail.com (ICFP Publicity) Date: Thu, 1 Dec 2022 16:31:44 +0800 Subject: [TYPES/announce] ICFP 2023: Call for Workshop and Co-Located Event Message-ID: CALL FOR WORKSHOP AND CO-LOCATED EVENT PROPOSALS ICFP 2023 28th ACM SIGPLAN International Conference on Functional Programming September 4 - 9, 2023 Seattle, WA, USA https://urldefense.com/v3/__https://icfp23.sigplan.org/__;!!IBzWLUs!TJNnIz3lUZx7T9plQpVFi9BkG5CWF-jEAPpzp7Tjp1wayAVMYlJPncQXDbNp8v0bwCNNzZm6yBb97_CsoSaU9-xDHptT6An7sIuk7BXrBP8$ The 28th ACM SIGPLAN International Conference on Functional Programming will be held in Seattle, WA, USA on September 4 - 9, 2023, with the option of virtual participation. ICFP provides a forum for researchers and developers to hear about the latest work on the design, implementations, principles, and uses of functional programming. Proposals are invited for workshops (and other co-located events, such as symposiums) to be affiliated with ICFP 2023 and sponsored by SIGPLAN. These events should be less formal and more focused than ICFP itself, include sessions that enable interaction among the attendees, and foster the exchange of new ideas. The preference is for one-day events, but other schedules can also be considered. The workshops are scheduled to occur on September 4th (the day before ICFP) and September 8-9th (the two days after ICFP). ---------------------------------------------------------------------- Submission details Deadline for submission: December 22, 2022 Notification of acceptance: January 13, 2023 Prospective organizers of workshops or other co-located events are invited to submit a completed workshop proposal form in plain text format to the ICFP 2023 workshop co-chairs (Arthur Azevedo de Amorim and Yannick Forster) via email to icfp-workshops-2023 at googlegroups.com by December 22, 2022. (For proposals of co-located events other than workshops, please fill in the workshop proposal form and just leave blank any sections that do not apply.) Please note that this is a firm deadline. Organizers will be notified whether their event proposal is accepted by January 13, 2023, and if successful, depending on the event, they will be asked to produce a final report after the event has taken place that is suitable for publication in SIGPLAN Notices. The proposal form is available at: https://urldefense.com/v3/__http://www.icfpconference.org/icfp2023-files/icfp23-workshops-form.txt__;!!IBzWLUs!TJNnIz3lUZx7T9plQpVFi9BkG5CWF-jEAPpzp7Tjp1wayAVMYlJPncQXDbNp8v0bwCNNzZm6yBb97_CsoSaU9-xDHptT6An7sIuk0DhCQio$ Further information about SIGPLAN sponsorship is available at: https://urldefense.com/v3/__http://www.sigplan.org/Resources/Proposals/Sponsored/__;!!IBzWLUs!TJNnIz3lUZx7T9plQpVFi9BkG5CWF-jEAPpzp7Tjp1wayAVMYlJPncQXDbNp8v0bwCNNzZm6yBb97_CsoSaU9-xDHptT6An7sIuktf5YbqI$ ---------------------------------------------------------------------- Selection committee The proposals will be evaluated by a committee comprising the following members of the ICFP 2023 organizing committee, together with the members of the SIGPLAN executive committee. Workshop Co-Chair: Arthur Azevedo de Amorim (Boston University) Workshop Co-Chair: Yannick Forster (Inria Nantes) General Chair: Nikhil Swamy (Microsoft Research) Program Chair: Sam Lindley (University of Edinburgh) ---------------------------------------------------------------------- Further information Any queries should be addressed to the workshop co-chairs (Arthur Azevedo de Amorim and Yannick Forster), via email to icfp-workshops-2023 at googlegroups.com. From vladimir.zamdzhiev at inria.fr Fri Dec 2 10:59:53 2022 From: vladimir.zamdzhiev at inria.fr (Vladimir Zamdzhiev) Date: Fri, 2 Dec 2022 16:59:53 +0100 Subject: [TYPES/announce] QPL 2023 - Preliminary Call for Papers Message-ID: <80e3f22a-1702-be76-aa0d-7502721f3495@inria.fr> ======================================= QPL 2023 - Preliminary Call for Papers ======================================= The 20th International Conference on Quantum Physics and Logic (QPL 2023) will take place from 17 July to 21 July 2023 at the "Institut Henri Poincar?" in Paris, France. Quantum Physics and Logic is an annual conference that brings together academic and industry researchers working on mathematical foundations of quantum computation, quantum physics, and related areas. The main focus is on the use of algebraic and categorical structures, formal languages, type systems, semantic methods, as well as other mathematical and computer scientific techniques applicable to the study of physical systems, physical processes, and their composition. Work applying quantum-inspired techniques and structures to other fields (such as linguistics, artificial intelligence, and causality) is also welcome. ======================================= Important Dates ======================================= Abstract submission deadline: 1 March 2023 Paper submission deadline: 7 March 2023 Notification: 1 May 2023 All deadlines are stated with respect to the Anywhere on Earth (AoE) time zone. ======================================= Submissions ======================================= Prospective speakers are invited to submit one (or more) of the following: * Proceedings submission. This consists of a 5-12 page paper. It must provide ?sufficient evidence of results of genuine interest, in sufficient detail for ?the program committee to assess the merits of the work. Submissions of work ?in progress are encouraged, but must be more substantial than a research ?proposal. * Non-proceedings submission. This consists of a 3 page summary, together with ?a link to a separate published paper or preprint. If the published paper or ?preprint is not publicly available (e.g. not open access), then it should be ?included in full after the summary. * Poster submission. This consists of a 3 page abstract of partial results or ?work in progress. * Programming tool submission. This consists of a 3 page description of a ?programming tool or framework, with a strong preference for open-source ?contributions. The conference website and the submission website will be announced in a subsequent CFP. ======================================= Presentations ======================================= Authors of accepted proceedings and non-proceedings submissions will be invited to give a long or short talk, depending on the quality and maturity of the submission. Authors of accepted poster submissions will be invited to present their work at the poster session. Authors of accepted programming tool submissions will be invited to live demo their tool to conference attendees, at the same time as the poster session. There will be an award for Best Student Paper at the discretion of the Program Committee. Papers eligible for the award are those where all the authors are students at the time of submission. ======================================= Conference Proceedings ======================================= Conference proceedings will be published in Electronic Proceedings in Theoretical Computer Science (EPTCS) after the conference. ======================================= QPL 2023 Programme Committee ======================================= TBA ======================================= QPL 2023 Organising Committee ======================================= * Pierre-Emmanuel Emeriau (Quandela, France) * Shane Mansfield ? ? ? ? (Quandela, France) * Simon Perdrix ? ? ? ? ? (Inria Nancy, France) * Beno?t Valiron? ? ? ? ? (CentraleSup?lec, Universit? Paris-Saclay, France) * Augustin Vanrietvelde ? (Inria Saclay, France) * Renaud Vilmart? ? ? ? ? (Inria Saclay, France) * Vladimir Zamdzhiev? ? ? (Inria Saclay, France) -------------- next part -------------- An HTML attachment was scrubbed... URL: From paolo.pistone at uniroma3.it Fri Dec 2 12:47:23 2022 From: paolo.pistone at uniroma3.it (Paolo Pistone) Date: Fri, 2 Dec 2022 17:47:23 +0000 Subject: [TYPES/announce] Call for Participation: Online Workshop Series "Proofs, Computation and Meaning" In-Reply-To: References: Message-ID: *Apologies for cross postings* ******************************************************************************* Call For Participation: Online Workshop Series "Proofs, Computation and Meaning" Third online event: December 7, 2022, 4 pm CET Website: https://urldefense.com/v3/__http://ls.informatik.uni-tuebingen.de/pcm-online/__;!!IBzWLUs!TZ5MJofKHnh2rJGwKYZzxRgbV2HzR6hIxiSk5ZyKvzzLvPBa85fp38ywh7dcFCGx46WyEK3WIl42ayEc0Pskv9VlmpDyGrfqytKYGj0AuA$ ******************************************************************************* This online workshop series was originally planned as an in person meeting which was canceled due to the outbreak of the Coronavirus pandemic in early March 2020. The event was planned to bring researchers whose work focuses on the notion of formal proof from either a philosophical, computational or mathematical perspective. With the obvious limitations of an online format, we wish to keep this original motivation, which looks even more timely in a time in which interdisciplinary interactions are made more difficult by the pandemic. The goal is that of creating an opportunity for members of different communities to interact and exchange their views on proofs, their identity conditions, and the more convenient ways of representing them formally. ******************************************************************************* SCOPE: Around thirty years after the fall of Hilbert's program, the proofs-as-programs paradigm established the view that a proof should not be identified, as in Hilbert's metamathematics, with a string of symbols in some formal system. Rather, proofs should consist in computational or epistemic objects conveying evidence to mathematical propositions. The relationship between formal derivations and proofs should then be analogous to the one between words and their meanings. This view naturally gives rise to questions such as ?which conditions should a formal arrangement of symbols satisfy to represent a proof?? or ?when do two formal derivations represent the same proof?". These questions underlie past and current research in proof theory both in the theoretical computer science community (e.g. categorical logic, domain theory, linear logic) and in the philosophy community (e.g. proof-theoretic semantics). In spite of these common motivations and historical roots, it seems that today proof theorists in philosophy and in computer science are losing sight of each other. This workshop aims at contributing to a renaissance of the interaction between researchers with different backgrounds by establishing a constructive environment for exchanging views, problems and results. ******************************************************************************* ORGANIZATION: The workshop series includes three events, each focusing on one specific aspect of proofs and their representation. To foster interaction and discussion, each event will consists in short talks followed by a 15 minutes slot during which participants can engage in discussion or just take a short break. Event 3. On the nature of proofs December 7, 4-7 pm (CET) The developments of logic, and of proof theory in particular, have lead us to look at proofs primarily through the lens of various formal systems, such as natural deduction, sequent calculus, tableaux, proof nets etc. Yet, is it possible to investigate the nature of proofs, their identity conditions, their relations with computation and with meaning in a direct way, i.e. independently of the choice of a particular formal system? Speakers: - Bahareh Afshari (University of Amsterdam/University of Gothenburg) - Sonia Marin (University of Birmingham) - Alberto Naibo (Paris 1 Panth?on-Sorbonne University) - Antonio Piccolomini d'Aragona (Czech Academy of Science) - Noam Zeilberger (?cole Polytechnique Paris-Saclay) ******************************************************************************* CALL FOR PARTICIPATION: If you attended previous workshops, you will receive a Zoom link soon. Otherwise, please send an e-mail to luca.tranchini at gmail.com or paolo.pistone at uniroma3.it. -------------- next part -------------- An HTML attachment was scrubbed... URL: From Luigia.Petre at abo.fi Fri Dec 2 16:22:23 2022 From: Luigia.Petre at abo.fi (Luigia Petre) Date: Fri, 2 Dec 2022 21:22:23 +0000 Subject: [TYPES/announce] FMTea Tutorial on Teaching TLA+ in Industry: Principal Research Engineer Markus Kuppe, RiSE group at Microsoft Research, US, on Friday, December 9, 2022 at 3 pm CET Message-ID: Dear all, The Formal Methods Teaching tutorials series wraps up 2022 with a lecture on Friday, December 9, 2022! Principal Research Engineer Markus Kuppe (RiSE group at Microsoft Research, US) will lecture on Friday, December 9, 2022 at 3 pm CET on his experiences on teaching TLA+ in industry. His talk is entitled entitled "Stories from the trenches: Teaching the TLA+ specification language in Industry". More information about our lecturer can be found here: https://urldefense.com/v3/__https://www.linkedin.com/in/markus-kuppe-643559180/__;!!IBzWLUs!Ur2PnbHQB7nvucJhiCLk2Mhh8wFdv6jGsLKXaHRkMB0HSh5X0DooJT8p6PqPDINB-trLuzJ12asiVDEneUN56rQqJljey3aKTvVD$ . The zoom link for Markus' lecture is https://aboakademi.zoom.us/j/64254430116. The event will last about an hour. Warmly welcome!! Best wishes, Luigia PS: the tutorial series webpage is below; we continue in January 2023! https://urldefense.com/v3/__https://fme-teaching.github.io/2021/08/24/tutorial-series-of-the-fme-teaching-committee/__;!!IBzWLUs!Ur2PnbHQB7nvucJhiCLk2Mhh8wFdv6jGsLKXaHRkMB0HSh5X0DooJT8p6PqPDINB-trLuzJ12asiVDEneUN56rQqJljey0WoKt-N$ . __ Luigia Petre, Docent, PhD Faculty of Science and Engineering ?bo Akademi University, Finland https://urldefense.com/v3/__http://www.users.abo.fi/lpetre__;!!IBzWLUs!Ur2PnbHQB7nvucJhiCLk2Mhh8wFdv6jGsLKXaHRkMB0HSh5X0DooJT8p6PqPDINB-trLuzJ12asiVDEneUN56rQqJljey7WOVfFx$ -------------- next part -------------- An HTML attachment was scrubbed... URL: From elenam at morris.umn.edu Sat Dec 3 18:28:02 2022 From: elenam at morris.umn.edu (Elena Machkasova) Date: Sat, 3 Dec 2022 17:28:02 -0600 Subject: [TYPES/announce] TFPIE 2023 call for submissions (deadline Dec 27th) Message-ID: Trends in Functional Programming in Education (TFPIE) 2023 Call for papers https://urldefense.com/v3/__https://wiki.tfpie.science.ru.nl/TFPIE2023__;!!IBzWLUs!S_ucaUFn8TE322faSl0PLUmr7PVCZK9jyoxNhYRuav9ZwpjrOXoTzSd7Uz7vSUpnIkhPYH9g6aysXj_Bll0tNEkp-gDQgLXW1mY$ (January 12th 2023, Boston, MA, USA, co-located with TFP 2023 and followed by POPL 2023) TFPIE 2023 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=tfpie2023__;!!IBzWLUs!S_ucaUFn8TE322faSl0PLUmr7PVCZK9jyoxNhYRuav9ZwpjrOXoTzSd7Uz7vSUpnIkhPYH9g6aysXj_Bll0tNEkp-gDQE1c2Cgw$ After the workshop, presenters are invited to submit (a revised version of) their article for the formal review. The PC will select the best articles for publication in the Electronic Proceedings in Theoretical Computer Science (EPTCS). Articles rejected for presentation and extended abstracts will not be formally reviewed by the PC. Important Dates Submission deadline: December 27th 2022, Anywhere on Earth. Notification: December 30th 2022 (Note: earlier submissions will receive earlier response) TFPIE Registration Deadline: see https://urldefense.com/v3/__https://trendsfp.github.io/register.html__;!!IBzWLUs!S_ucaUFn8TE322faSl0PLUmr7PVCZK9jyoxNhYRuav9ZwpjrOXoTzSd7Uz7vSUpnIkhPYH9g6aysXj_Bll0tNEkp-gDQGVPxJr0$ Workshop: January 12th 2023 Submission for formal review: April 19th 2023, Anywhere on Earth. Notification of full article: May 24th 2023 Camera ready: July 1st 2023 Program Committee Christopher Anand - McMaster University, Canada Attila Egri-Nagy - Akita International University, Japan Jason Hemann - Seton Hall University, USA Kevin Kappelmann - Technical University of Munich, Germany Elena Machkasova (Chair) - University of Minnesota Morris, USA Kristina Sojakova - INRIA, France J?rgen Villadsen - Technical University of Denmark, Denmark Invited Speaker: Shriram Krishnamurthi, Brown University Registration information: See https://urldefense.com/v3/__https://wiki.tfpie.science.ru.nl/TFPIE2023__;!!IBzWLUs!S_ucaUFn8TE322faSl0PLUmr7PVCZK9jyoxNhYRuav9ZwpjrOXoTzSd7Uz7vSUpnIkhPYH9g6aysXj_Bll0tNEkp-gDQgLXW1mY$ for updated information. Registration and 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!S_ucaUFn8TE322faSl0PLUmr7PVCZK9jyoxNhYRuav9ZwpjrOXoTzSd7Uz7vSUpnIkhPYH9g6aysXj_Bll0tNEkp-gDQhYcv0cA$ Pronouns: she/her/hers or any other -------------- next part -------------- An HTML attachment was scrubbed... URL: From p.gardner at imperial.ac.uk Mon Dec 5 04:28:07 2022 From: p.gardner at imperial.ac.uk (Gardner, Philippa A) Date: Mon, 5 Dec 2022 09:28:07 +0000 Subject: [TYPES/announce] Lectureships (assistant professorships) at Imperial College London Message-ID: Hello all, Just to let you know (if you don?t know already) that the deadline for lectureships (assistant professorships) in the Department of Computer Science at Imperial College London is **12th December**. Details are here: https://urldefense.com/v3/__https://www.imperial.ac.uk/jobs/description/ENG02284/lecturers-computing__;!!IBzWLUs!QQwQoqR16BZyWnPFBHa3yAwNiU4247wOxaAbTKiK2ncVCfcnDVo9weNMdO_19nPNCf_65X4jsgIbmpmMGf0JO2yaicnBYtxPrgiG-f8$ Please feel free to contact me or others in the Department (Ally Donaldson, Sophia Drossopoulou, Azalea Raad, Nick Wu,?) if you wish. Best wishes, Philippa -------------- next part -------------- An HTML attachment was scrubbed... URL: From stevez at seas.upenn.edu Mon Dec 5 17:00:28 2022 From: stevez at seas.upenn.edu (Steve Zdancewic) Date: Mon, 5 Dec 2022 17:00:28 -0500 Subject: [TYPES/announce] Certified Programs and Proofs (CPP) 2023: Call for Participation Message-ID: *** Call for Participation *** *** Certified Programs and Proofs (CPP) 2023 *** ?- Early registration deadline: 16 December 2022 ?- Registration: https://urldefense.com/v3/__https://popl23.sigplan.org/attending/registration__;!!IBzWLUs!VE2zpt_aQX8dkbQUsJdFuhk5Qqou96y_iWz0kNvBKCRg_b850AdKkxPcnJ1JBhQhx8efA8QwNPtEfMLzgRCb2EH-tUZEtfnRBdE$ ?- Further reduced student participation fee: see below ?- Accommodation: Boston Park Plaza ?? https://urldefense.com/v3/__https://popl23.sigplan.org/venue/POPL-2023-venue__;!!IBzWLUs!VE2zpt_aQX8dkbQUsJdFuhk5Qqou96y_iWz0kNvBKCRg_b850AdKkxPcnJ1JBhQhx8efA8QwNPtEfMLzgRCb2EH-tUZEbGAgrZ0$ Certified Programs and Proofs (CPP) is an international conference on practical and theoretical topics in all areas that consider formal verification and certification as an essential paradigm for their work. CPP spans areas of computer science, mathematics, logic, and education. CPP 2023 (https://urldefense.com/v3/__https://popl23.sigplan.org/home/CPP-2023__;!!IBzWLUs!VE2zpt_aQX8dkbQUsJdFuhk5Qqou96y_iWz0kNvBKCRg_b850AdKkxPcnJ1JBhQhx8efA8QwNPtEfMLzgRCb2EH-tUZEj6u3gMg$ ) will be held on 16-17 January 2023 and will be co-located with POPL 2023. CPP 2023 is sponsored by ACM SIGPLAN, in cooperation with ACM SIGLOG, and supported by a diverse set of industrial sponsors. Similarly to other events collocated with POPL 2023, CPP will take place as an in-person event at Boston Park Plaza, and will require attendees to provide proof of vaccination (details will be available soon). Virtual participation via Airmeet will also be available; look for updated information about that option on the POPL web site. For more information about this edition and the CPP series, please visit https://urldefense.com/v3/__https://popl23.sigplan.org/home/CPP-2023__;!!IBzWLUs!VE2zpt_aQX8dkbQUsJdFuhk5Qqou96y_iWz0kNvBKCRg_b850AdKkxPcnJ1JBhQhx8efA8QwNPtEfMLzgRCb2EH-tUZEj6u3gMg$ ### Invited Speakers * Sandrine Blazy, University of Rennes and IRISA * Cezary Kaliszyk, University of Innsbruck ### Accepted papers The list of accepted papers is available at https://urldefense.com/v3/__https://popl23.sigplan.org/home/CPP-2023*event-overview__;Iw!!IBzWLUs!VE2zpt_aQX8dkbQUsJdFuhk5Qqou96y_iWz0kNvBKCRg_b850AdKkxPcnJ1JBhQhx8efA8QwNPtEfMLzgRCb2EH-tUZEiSOAxks$ ### Subsidized student registration To facilitate in-person participation, CPP 2023 offers the opportunity to waive the registration fees for those that are in need of financial support to attend the conference. This support is particularly aimed at undergraduate and graduate students, postdocs, and those from marginalized groups. If you wish to apply for support you may do so by sending an email to the CPP conference co-chairs (Dmitriy Traytel and Robbert Krebbers, see below for their email addresses), with a brief description of your situation. The deadline for applications is 11 December 2022, 23:59 AoE. Notifications will be sent out at most two days later; hence, those who cannot be supported will still have the opportunity to register with the regular early registration fee before 16 December. Applications arriving after 11 December will be considered only if additional budget is remaining. CPP's student support is made possible by our generous industrial supporters: https://urldefense.com/v3/__https://popl23.sigplan.org/home/CPP-2023*About__;Iw!!IBzWLUs!VE2zpt_aQX8dkbQUsJdFuhk5Qqou96y_iWz0kNvBKCRg_b850AdKkxPcnJ1JBhQhx8efA8QwNPtEfMLzgRCb2EH-tUZEZqMDBQ0$ ### Contact For any questions please contact the chairs: Steve Zdancewic (PC co-chair) Brigitte Pientka (PC co-chair) Robbert Krebbers (conference co-chair) Dmitriy Traytel (conference co-chair) From peter.mueller at inf.ethz.ch Tue Dec 6 07:49:56 2022 From: peter.mueller at inf.ethz.ch (Mueller Peter) Date: Tue, 6 Dec 2022 12:49:56 +0000 Subject: [TYPES/announce] Rust Verification Workshop at ETAPS 2023: Call for Talk and Demo Proposals Message-ID: Call for Talk and Demo Proposals 3rd Rust Verification Workshop Co-located with ETAPS 2023 Paris, France Sunday, April 23, 2023 https://urldefense.com/v3/__https://sites.google.com/view/rustverify2023/home__;!!IBzWLUs!WvjSkEvaJwWW-00m5MDND8mwv4QX1kSLQH1NoxnBuQo9q_U90qHogB_iZu2NLX8yIy9kr0w7Kov1S_ft7QaeenmG23DeZb42ewX9IBtfTAI$ Rust is a recently introduced programming language for writing performant code with strong type and memory safety guarantees. It is considered a serious alternative to C and C++ for systems programming, because it provides high-level abstractions but without the cost of garbage collection. Given the growing popularity of Rust, and given that bugs in systems programs can be costly, there is growing interest in the program verification community for building program verifiers for Rust. In this workshop, we aim to bring together language designers, application developers and formal verification tool builders, to exchange ideas and build collaborations around developing verified Rust programs. The goal of this workshop is to bring researchers from a variety of different backgrounds and perspectives together to exchange new and exciting ideas concerning the verification of Rust programs and exploring avenues for collaboration. We want the workshop to be as informal and interactive as possible. The program will thus involve a combination of invited talks, contributed talks about work in progress, tool demos, and open discussion sessions. There will be no published proceedings, but participants will be invited to submit working documents, talk slides, etc. to be posted on this website. Call for Talk and Demo Proposals --------------------------------------------- We solicit proposals for contributed talks and tool demos. Proposals should be at most 2 pages, in either plain text or PDF format, and should specify how long a talk/demo the speaker wishes to give. By default, contributed talks will be 30 minutes long, but proposals for shorter or longer talks will also be considered. We are interested in talks/demos on all topics related to the verification of Rust programs (including, for instance, program specification, deductive verification, model checking, symbolic execution, runtime monitoring, the semantics and formalization of Rust, and tool support). Talks about work in progress as well as proposals for challenge problems in Rust are particularly encouraged. Please submit by email to peter.mueller at inf.ethz.ch. Important Dates --------------------- Deadline for talk/demo proposals: January 20, 2023 (Friday) Notification of acceptance: February 10, 2023 (Friday) Workshop: April 23, 2023 (Sunday) Organizers ---------------- Rajeev Joshi, Amazon Web Services > Nicholas Matsakis, Amazon Web Services Peter M?ller, ETH Zurich -------------- next part -------------- An HTML attachment was scrubbed... URL: From kaposi.ambrus at gmail.com Wed Dec 7 04:11:08 2022 From: kaposi.ambrus at gmail.com (Ambrus Kaposi) Date: Wed, 7 Dec 2022 10:11:08 +0100 Subject: [TYPES/announce] Call for STSMs, deadline 1 January 2023 In-Reply-To: References: Message-ID: COST Action CA20111 EuroProofNet Open call for Short-Term Scientific Missions (STSMs) Dear Action members, The next STSM deadline is: 1st January 2023 *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 research collaborations. Find all the details concerning application on https:// europroofnet.github.io/grants/ Do not hesitate to contact us if you have any questions. Best wishes, Danijela Simic and Ambrus Kaposi EuroProofNet STSM Coordinators > -------------- next part -------------- An HTML attachment was scrubbed... URL: From Sam.Lindley at ed.ac.uk Thu Dec 8 05:53:09 2022 From: Sam.Lindley at ed.ac.uk (Sam Lindley) Date: Thu, 8 Dec 2022 23:53:09 +1300 Subject: [TYPES/announce] postdoctoral research positions in effect handler oriented programming at Edinburgh Message-ID: I have funding for up to two postdoctoral researchers to work with me and my group on the theoretical foundations and practical design and implementation of effect handlers at The University of Edinburgh. https://urldefense.com/v3/__https://elxw.fa.em3.oraclecloud.com/hcmUI/CandidateExperience/en/sites/CX_1001/job/5903/__;!!IBzWLUs!XDiwYbtmbd2d5dhMuffzdw_YqVSyvKvgwOSkjCHZ_JX4prX_shxc0A-wcPAThVeJs3fYaPT5r9roR5fCO56rPSFXDm8BOHGHmWR5$ Feel free to get in touch with me if you're interested. Sam The University of Edinburgh is a charitable body, registered in Scotland, with registration number SC005336. Is e buidheann carthannais a th? ann an Oilthigh Dh?n ?ideann, cl?raichte an Alba, ?ireamh cl?raidh SC005336. From lutz at lix.polytechnique.fr Fri Dec 9 05:30:44 2022 From: lutz at lix.polytechnique.fr (Lutz Strassburger) Date: Fri, 9 Dec 2022 11:30:44 +0100 (CET) Subject: [TYPES/announce] ESSLLI 2023: Second Call for Course and Workshop Proposals Message-ID: <787dc91-72e3-c6fd-d373-c7672b9f10c0@lix.polytechnique.fr> Call for Course and Workshop Proposals ? 34th European Summer School in Logic, Language and Information ? ESSLLI 2023 31 July?11 August, 2023, Ljubljana, Slovenia https://urldefense.com/v3/__https://2023.esslli.eu/__;!!IBzWLUs!SxPKSwl6S4uXRnHXzbt_bzqB8wYnVmp9jTOIlF__BxxKEWuV5D0mCigmgOOAiYa4y1Uv-vVJa3alB6Kzd9mpfOwuia-Zl3n4rxPPBRk$ Important Dates 13 January 2023: Course Title submission deadline (mandatory) 20 January 2023: Final submission 3 March 2023: Notification Introduction Under the auspices of the Association for Logic, Language, and Information (FoLLI), the European Summer School in Logic, Language, and Information (ESSLLI) runs every year. Except for 2021, where the school was virtual, it runs in a different European country each year. It takes place over two weeks in the summer, hosts approximately 50 different courses at both introductory and advanced levels, and attracts around 400 participants from all over the world. ? Since 1989, ESSLLI has been providing outstanding interdisciplinary educational opportunities in the fields of Computer Science, Cognitive Science, Linguistics, Logic, Philosophy, and beyond. It comes from a community which recognizes that advances in our common areas require the contributions of multiple interrelated disciplines. ? The main focus of ESSLLI is the interface between linguistics, logic and computation, with special emphasis in human linguistic and cognitive ability. Courses, both introductory and advanced, cover a wide variety of topics within the combined areas of interest: Logic and Computation, Computation and Language, and Language and Logic. Workshops are also organized, providing opportunities for in-depth discussion of issues at the forefront of research, as well as a series of invited evening lectures. Topics and Format Proposals for courses and workshops at ESSLLI 2023 are invited in all areas of Logic, Linguistics and Computer Sciences. Cross-disciplinary and innovative topics are particularly encouraged. ? Each course and workshop will consist of five 90 minute sessions, offered daily (Monday-Friday) in a single week. Proposals for two-week courses should be structured and submitted as two independent one-week courses, e.g. as an introductory course followed by an advanced one. In such cases, the ESSLLI program committee reserves the right to accept just one of the two proposals. ? All instructional and organizational work at ESSLLI is performed completely on a voluntary basis, so as to keep participation fees to a minimum. However, organizers and instructors have their registration fees waived, and are reimbursed for travel and accommodation expenses up to a level to be determined and communicated with the proposal notification. ESSLLI can only guarantee reimbursement for at most one course/workshop organizer, and cannot guarantee full reimbursement of travel costs for lecturers or organizers from outside of Europe. The ESSLLI organizers would appreciate any help in controlling the School's expenses by seeking partial or complete coverage of travel and accommodation expenses from other sources.??? ??? ???? Categories Each proposal should fall under one of the following categories. FOUNDATIONAL COURSES Such courses are designed to present the basics of a research area, to people with no prior knowledge in that area. They should be of elementary level, without prerequisites in the course's topic, though possibly assuming a level of general scientific maturity in the relevant discipline. They should enable researchers from related disciplines to develop a level of comfort with the fundamental concepts and techniques of the course's topic, thereby contributing to the interdisciplinary nature of our research community.??? ???? INTRODUCTORY COURSES Introductory courses are central to ESSLLI's mission. They are intended to introduce a research field to students, young researchers, and other non-specialists, and to foster a sound understanding of its basic methods and techniques. Such courses should enable researchers from related disciplines to develop some comfort and competence in the topic considered. Introductory courses in a cross-disciplinary area may presuppose general knowledge of the related disciplines.??? ??? ??? ??? ??? ???? ADVANCED COURSES Advanced courses are targeted primarily to graduate students who wish to acquire a level of comfort and understanding in the current research of a field. WORKSHOPS Workshops focus on specialized topics, usually of current interest. Workshop organizers are responsible for soliciting papers and selecting the workshop program. They are also responsible for publishing proceedings if they decide to have proceedings. Proposal Guidelines??? ??? ??? ??? ??? ???? Course and workshop proposals should closely follow these guidelines to ensure full consideration. ??? ??? ??? ??? ??? ???? Course and Workshop proposals can be submitted by no more than two lecturers/organizers and they are presented by no more than these two lecturers/organizers. All instructors and organizers must possess a PhD or equivalent degree by the submission deadline. ??? ??? ??? ??? ??? ???? Course proposals should mention explicitly the intended course category. Proposals for introductory courses should indicate the intended level, for example as it relates to standard textbooks and monographs in the area. Proposals for advanced courses should specify the prerequisites in detail. ??? ??? ??? ??? ??? ???? Proposals of Courses given at ESSLLI the previous year will have a lower priority of being accepted in the current year. ? Proposals must be in PDF format include all of the following: ??? ??? ??? ??? ??? ???? 1. Personal information for each proposer: Name, affiliation, contact address, email, homepage (optional) 2. General proposal information: Title, category 3. Contents information: a. Abstract of up to 150 words b. Motivation and description (up to two pages) c. Tentative outline d. Expected level and prerequisites e. Appropriate references (e.g. textbooks, monographs, proceedings, surveys) 4. Information on the proposer and course: a. Will your course appeal to students outside of the main discipline of the course? b. Include information on your experience in the intensive one-week interdisciplinary setting c. Include evidence that the course proposer is an excellent lecturer 5. Information from workshop organizers: a. Include information on relevant preceding meetings and events, if applicable b. Include information about potential external funding for participants Submission Information By January 13, 2023:?You are asked to submit in EasyChair at least the name(s) of the instructor(s), the ESSLLI area+course level and a short abstract. ? By January 20:?Your submission must be completed by uploading a PDF with the actual proposal as detailed above. Submission Portal ? Please submit your proposals to https://urldefense.com/v3/__https://easychair.org/conferences/?conf=esslli2023__;!!IBzWLUs!SxPKSwl6S4uXRnHXzbt_bzqB8wYnVmp9jTOIlF__BxxKEWuV5D0mCigmgOOAiYa4y1Uv-vVJa3alB6Kzd9mpfOwuia-Zl3n4PVcPD5Q$ Childcare If there is enough interest, ESSLLI will provide information on private child care services available during the summer school.???? EACSL Sponsorship The EACSL will support one Logic and Computation course or workshop addressing topics of interest to Computer Science Logic (CSL) conferences. The selected course or workshop will be designated an EACSL course/workshop in the programme. If you wish to be considered for this, please indicate so in your proposal. Organizing Committee Slavko ?itnik (University of Ljubljana) (chair) ?pela Vintar (University of Ljubljana) Timotej Knez (University of Ljubljana) Mojca Brglez (University of Ljubljana) Matej Klemen (University of Ljubljana) Ale? ?agar (University of Ljubljana)??? ??? ???? Program Committee Juha Kontinen (University of Helsinki) (chair) Kaja Dobrovoljc (University of Ljubljana) (local co-chair) AREA CHAIRS LANGUAGE AND COMPUTATION (LACO) Kilian Evang (Heinrich Heine University D?sseldorf) Miryam de Lhoneux (KU Leuven) Shane Steinert-Threlkeld (University of Washington) AREA CHAIRS LANGUAGE AND LOGIC (LALO) Ivano Ciardelli (University of Padua) Agata Renans (Ruhr-Universit?t Bochum) Jacopo Romoli (Heinrich Heine University D?sseldorf) AREA CHAIRS LOGIC AND COMPUTATION (LOCO) Natasha Alechina (Utrecht University) Alessandra Palmigiano (Vrije Universiteit Amsterdam) Lutz Stra?burger (Inria Saclay & ?cole Polytechnique) ESSLLI Steering Committee Darja Fiser (University of Ljubljana) (chair) Phokion Kolaitis (University of California, Santa Cruz) (vice-chair)? Roman Kuznets (TU Wien) Petya Osenova (Bulgarian Academy of Sciences and Sofia University) (secretary)? Jakub Szymanik (University of Trento) ??? ??? ??? ??? ???? ? From guilhem.jaber at inria.fr Fri Dec 9 10:59:03 2022 From: guilhem.jaber at inria.fr (Guilhem Jaber) Date: Fri, 9 Dec 2022 16:59:03 +0100 Subject: [TYPES/announce] Post-doc position in the Inria Gallinette team in Nantes Message-ID: <24930117-4882-407E-9ADF-35DFDBF3B7E7@inria.fr> This is an announcement for a postdoctoral position in the CANofGAS project (Cost ANalysis of GAme Semantics), led by Beniamino Accattoli (Inria Saclay, PARTOUT team) and Guilhem Jaber (Nantes Universit?, Gallinette team). We seek candidates holding a PhD in Computer Science or Mathematics, and with expertise in programming language semantics, ?-calculi, type theory, functional programming, rewriting systems, category theory, or program logic. The successful candidate will be employed by Inria and work in the Gallinette team (https://urldefense.com/v3/__https://gallinette.inria.fr__;!!IBzWLUs!RnxFfPiuykqGSx5_LedGB9U2A9QyZhmSJnkImc_DnLg7GT5mYBUK-5ko0wfn0r8K0GmB-YjpQx6WLFAMHtHnZWaxcXapz7C2nwpJ-t4$ ), at Nantes University. The position is for one year, renewable for a second year. The salary is ~2200?/month after taxes. The working language can either be English or French. Application process: - Deadline for applications is on December 30th 2022, with a starting date in March of 2022, to be negotiated. - Candidates can send their application to Beniamino Accattoli (beniamino.accattoli at inria.fr ) and Guilhem Jaber (guilhem.jaber at inria.fr ) with a subject containing ?[CANofGAS post-doc application]?. Do not hesitate to send an email with any questions relevant to this position before the deadline. - The application should contain a CV, a brief research statement (1-2 pages) & at least two contacts of reference persons. Project summary The CANofGAS project is funded by the Inria Exploratory Action, started in September 2022 and running until the end of 2025. It aims at capturing the time and space cost of the evaluation of higher-order programs at the semantic level. The directions we plan to explore are using the advances in reasonable cost models to develop a cost-based understanding of game semantics. In particular, we aim at modelling the efficient call-by-need evaluation scheme, at work for instance in the Haskell language and in the Coq proof assistant. -------------- next part -------------- An HTML attachment was scrubbed... URL: From kyrozier at iastate.edu Fri Dec 9 22:33:03 2022 From: kyrozier at iastate.edu (Rozier, Kristin-Yvonne [AER E]) Date: Sat, 10 Dec 2022 03:33:03 +0000 Subject: [TYPES/announce] NFM 2023: Deadline extension & final CFP Message-ID: Due to numerous requests, we have extended the submission deadline. ***************************************************** ???? The Fifteenth NASA Formal Methods Symposium https://urldefense.com/v3/__https://conf.researchr.org/home/nfm-2023__;!!IBzWLUs!U7Di2ZFaaP6ZgPiAiBcTszXTXV5PwERR3IZMv_UVba9i748-qcATGKPMuHo96dfKdvjZ8BbeePg5nF0qfEe1rr59-c6ph5tKm8I$ ?????????????????? 16 - 18 May 2023 University of Houston Clear Lake, Houston, Texas, USA ***************************************************** Theme of the Symposium: ----------------------- The widespread use and increasing complexity of mission-critical and safety-critical systems at NASA and in the aerospace industry require advanced techniques that address these systems' specification, design, verification, validation, and certification requirements. The NASA Formal Methods Symposium (NFM) is an annual forum to foster collaboration between theoreticians and practitioners from NASA, academia, and industry. NFM's goals are to identify challenges and to provide solutions for achieving assurance for such critical systems. New developments and emerging applications like autonomous software for uncrewed deep space human habitats, caretaker robotics, Unmanned Aerial Systems (UAS), UAS Traffic Management (UTM), and the need for system-wide fault detection, diagnosis, and prognostics provide new challenges for system specification, development, and verification approaches. The focus of these symposiums are on formal techniques and other approaches for software assurance, including their theory, current capabilities and limitations, as well as their potential application to aerospace, robotics, and other NASA-relevant safety-critical systems during all stages of the software life-cycle. Topics of Interest: ------------------- We encourage submissions on cross-cutting approaches that bring together formal methods and techniques from other domains such as probabilistic reasoning, machine learning, control theory, robotics, and quantum computing among others. ??? * Formal verification, including theorem proving, model checking, and static analysis ??? * Advances in automated theorem proving including SAT and SMT solving ??? * Use of formal methods in software and system testing ??? * Run-time verification ??? * Techniques and algorithms for scaling formal methods, such as abstraction and symbolic methods, compositional techniques, as well as parallel and/or distributed techniques ??? * Code generation from formally verified models ??? * Safety cases and system safety ??? * Formal approaches to fault tolerance ??? * Theoretical advances and empirical evaluations of formal methods techniques for safety-critical systems, including hybrid and embedded systems ??? * Formal methods in systems engineering and model-based development ??? * Correct-by-design controller synthesis ??? * Formal assurance methods to handle adaptive systems Important Dates: ---------------- Abstract Submission:? 6 Jan 2023 (firm) Paper Submission:???? 6 Jan 2023 (firm) Paper Notifications:? 6 Mar 2023 Camera-ready Papers: 27 Mar 2023 Symposium:??????? 16-18 May 2023 Location & Cost: ---------------- The symposium will take place in the STEM Building at University of Houston Clear Lake, Houston, Texas, USA, 16-18 May 2023. There will be no registration fee for participants. All interested individuals, including non-US citizens, are welcome to attend, to listen to the talks, and to participate in discussions; however, all attendees must register. Submission Details: ------------------- There are two categories of submissions: ?? 1. Regular papers describing fully developed work and complete results (15 pages + references) ?? 2. Two categories of short papers: (6 pages + references) ?? (a) Tool Papers describing novel, publicly-available tools ?? (b) Case Studies detailing complete applications of formal methods to real systems with publicly-available artifacts All papers should be in English and describe original work that has not been published or submitted elsewhere. All submissions will be fully reviewed by members of the Programme Committee. Papers will appear in the Formal Methods subline of Springer's Lecture Notes in Computer Science (LNCS) and must use LNCS style formatting (https://urldefense.com/v3/__https://www.springer.com/gp/computer-science/lncs/conference-proceedings-guidelines__;!!IBzWLUs!U7Di2ZFaaP6ZgPiAiBcTszXTXV5PwERR3IZMv_UVba9i748-qcATGKPMuHo96dfKdvjZ8BbeePg5nF0qfEe1rr59-c6ptZg8Z_E$ ). Papers must be submitted in PDF format at the EasyChair submission site: https://urldefense.com/v3/__https://easychair.org/conferences/?conf=nfm2023__;!!IBzWLUs!U7Di2ZFaaP6ZgPiAiBcTszXTXV5PwERR3IZMv_UVba9i748-qcATGKPMuHo96dfKdvjZ8BbeePg5nF0qfEe1rr59-c6p1bqxtwc$ Keynote Speakers: ----------------- Julia Badger, NASA Johnson Space Center Ken McMillan, UT Austin Sanjit Seshia, UC Berkeley Organizers: ----------- Swarat Chaudhuri (UT Austin) Jim Dabney (University of Houston Clear Lake/NASA JSC) Kristin Yvonne Rozier (Iowa State University/NASA JSC) Programme Committee: -------------------- Julia Badger, NASA Johnson Space Center Stanley Bak, Stony Brook University Suguman Bansal, University of Pennsylvania Dirk Beyer, LMU Munich Nikolaj Bj?rner, Microsoft Research Sylvie Boldo, Inria and Universit? Paris-Saclay Georgiana Caltais, University of Twente Swarat Chaudhuri, UT Austin Darren Cofer, Rockwell Collins Jennifer Davis, Collins Aerospace Ewen Denney, NASA Ames Research Center Catherine Dubois, ENSIIE-Samovar Rohit Dureja, IBM Corporation Alexandre Duret-Lutz, LRDE/EPITA Bruno Dutertre, Amazon Aaron Dutle, NASA Langley Research Center Souradeep Dutta, University of Pennsylvania R?diger Ehlers, Clausthal University of Technology Chuchu Fan, MIT Marie Farrell, The University of Manchester Bernd Finkbeiner, CISPA Helmholtz Center for Information Security Alwyn Goodloe, NASA Langley Research Center Arie Gurfinkel, University of Waterloo Klaus Havelund, NASA Jet Propulsion Laboratory Constance Heitmeyer, Naval Research Laboratory Marijn Heule, Carnegie Mellon University Kerianne Hobbs, Air Force Research Laboratory Bardh Hoxha, Toyota Research Institute North America Susmit Jha, SRI International Rajeev Joshi, Amazon Web Services Panagiotis Manolios, Northeastern University Anastasia Mavridou, SGT Inc. / NASA Ames Research Center Stefan Mitsch, Carnegie Mellon University Cesar Munoz, Amazon Natasha Neogi, NASA Langley Research Center Corina Pasareanu, CMU NASA, KBR Ivan Perez, KBR / NASA Ames Research Center Zvonimir Rakamaric, University of Utah Giles Reger, Amazon Web Services and The University of Manchester Kristin Yvonne Rozier, Iowa State University Johann Schumann, NASA Ames Research Center Cristina Seceleanu, M?lardalen University Yasser Shoukry, University of California Irvine Laura Titolo, National Institute of Aerospace Oksana Tkachuk, Amazon Web Services Aaron Tomb, Amazon Stefano Tonetta, FBK Nestan Tsiskaridze, Stanford University Caterina Urban, INRIA Cristian-Ioan Vasile, Lehigh University Virginie Wiels, ONERA / DTIS Huan Xu, University of Maryland Huafeng Yu, Boeing Research & Technology USA -- ____________________________________________________________ __ /\ \ \_____ / \ ###[==_____> / \ /_/ __ / __ \ \ \_____ | ( ) | ###[==_____> /| /\/\ |\ /_/ / | | | | \ / |=|==|=| \ Kristin Yvonne Rozier, Ph.D. / | | | | \ Black&Veatch Associate Prof, Iowa State Univ / USA | ~||~ |NASA \ |______| ~~ |______| Fall, 2022: at Carnegie Mellon (__||__) Office: GHC 7211 /_\ /_\ !!! !!! laboratory.temporallogic.org From cposkitt at smu.edu.sg Thu Dec 8 10:43:02 2022 From: cposkitt at smu.edu.sg (Christopher Michael POSKITT) Date: Thu, 8 Dec 2022 15:43:02 +0000 Subject: [TYPES/announce] CfP ICGT 2023 :: 16th International Conference on Graph Transformation Message-ID: SMU Classification: Restricted [apologies for cross-posting] ***** 1st CALL FOR PAPERS ***** ================================================================= 16th International Conference on Graph Transformation (ICGT 2023) web: https://urldefense.com/v3/__https://conf.researchr.org/home/icgt-2023__;!!IBzWLUs!XDKrxQFn6V5GkA6nDb4PtrIHmokyLrKsSdGMKg8r0mU_JA0tqyQtNlac5aRU0r8jr7OTyN-FsFHO8DfIcR2OCqjZnL_tQa0fnYg$ Part of STAF 2023, 17-21st July in Leicester, UK web: https://urldefense.com/v3/__https://conf.researchr.org/home/staf-2023__;!!IBzWLUs!XDKrxQFn6V5GkA6nDb4PtrIHmokyLrKsSdGMKg8r0mU_JA0tqyQtNlac5aRU0r8jr7OTyN-FsFHO8DfIcR2OCqjZnL_tHzR_x_0$ ================================================================= ** AIMS AND SCOPE ** The use of graphs and graph-like structures as a formalism for specification and modelling is widespread in all areas of computer science as well as in many fields of computational research and engineering. Relevant examples include software architectures, pointer structures, state space and control/data flow graphs, UML and other domain-specific models, network layouts, topologies of cyber-physical environments, quantum computing and molecular structures. Often, these graphs undergo dynamic change, ranging from reconfiguration and evolution to various kinds of behaviour, all of which may be captured by rule-based graph manipulation. Thus, graphs and graph transformation form a fundamental universal modelling paradigm that serves as a means for formal reasoning and analysis, ranging from the verification of certain properties of interest to the discovery of fundamentally new insights. The International Conference on Graph Transformation aims at fostering exchange and collaboration of researchers from different backgrounds working with graphs and graph transformation, either in contributing to their theoretical foundations or by applying established formalisms to classical or novel areas. The conference not only serves as a well-established scientific publication outlet, but also as a platform to boost inter- and intra-disciplinary research and to leeway for new ideas. The 16th International Conference on Graph Transformation (ICGT 2023) will be held in Leicester, UK, as part of STAF 2023 (Software Technologies: Applications and Foundations). The conference takes place under the auspices of EATCS and IFIP WG 1.3. Proceedings will be published by Springer in the Lecture Notes in Computer Science (LNCS) series. --------------------------------------- ** IMPORTANT DATES ** Abstracts: 28 Feb 2023 Paper Submission: 07 Mar 2023 Notification: 21 Apr 2023 Final version due: 07 May 2023 Conference: within 17-21 Jul 2023 All deadlines are by end-of-day, AoE --------------------------------------- ** TOPICS ** In order to foster a lively exchange of perspectives on the subject of the conference, the programme committee of ICGT 2023 encourages all kinds of contributions related to graphs and graph transformation, either from a theoretical point of view or a practical one. Topics of interest include, but are not limited to the following subjects: - General models of graph transformation (e.g. adhesive categories and hyperedge replacement systems) - Analysis and verification of graph transformation systems - Graph-based machine learning, including graph neural networks and models of rule inference - Graph theoretical properties of graph languages - Automata on graphs and parsing of graph languages - Logical aspects of graph transformation - Computational models based on graphs - Structuring and modularisation of graph transformation - Hierarchical graphs and decomposition of graphs - Parallel, concurrent, and distributed graph transformation - Term graph and string diagram rewriting - Petri nets and other models of concurrency - Business process models and notations - Bigraphs and bigraphical reactive systems - Graph databases and graph queries - Model-driven development and model transformation - Model checking, program analysis and verification, simulation and animation - Syntax, semantics and implementation of programming languages, including domain-specific and visual languages - Graph transformation languages and tool support - Efficient algorithms (e.g. pattern matching, graph traversal, network analysis) - Applications and case studies in software engineering (e.g. software architectures, refactoring, access control, and service-orientation) - Applications to computing paradigms (e.g. bio-inspired, quantum, ubiquitous, and visual) - Graph transformation and artificial intelligence (e.g., AI for graph transformations, applying graph transformations in AI engineering and search-based software engineering) --------------------------------------- ** SUBMISSION TYPES ** Authors are invited to submit papers in four possible categories, which must be prepared using Springer's LNCS format. (1) Regular research papers (up to 16 pages, excluding references and appendices), including papers describing applications and case studies. Papers will be evaluated with respect to their originality, significance, and technical soundness. Additional material intended for reviewers (but not publication) may be included in a clearly marked appendix. (2) Tool presentation papers (up to 8 pages, excluding references and appendices), which demonstrate the main features and functionality of graph-based tools. A tool presentation may have an appendix with a detailed demo description (up to 4 pages) which will be reviewed but not included in the proceedings. (3) "Blue Skies" (up to 8 pages), reporting on new research directions or ideas which are not yet sufficiently developed to fit in other categories. Furthermore, there will also be a "Journal-First" track allowing for previously published work (in book chapters, journals, or other conferences since 2019) to be presented at ICGT 2023. The submission deadline for the Journal-First track will be later and announced separately. Please refer to the ICGT 2023 website for further information as well as the Easychair submission link: https://urldefense.com/v3/__https://conf.researchr.org/home/icgt-2023__;!!IBzWLUs!XDKrxQFn6V5GkA6nDb4PtrIHmokyLrKsSdGMKg8r0mU_JA0tqyQtNlac5aRU0r8jr7OTyN-FsFHO8DfIcR2OCqjZnL_tQa0fnYg$ --------------------------------------- ** SPECIAL ISSUE ** Authors of the best papers at the conference will be invited to prepare and submit extended journal versions to be considered for publication in a special issue after an independent round of peer review (details TBA). --------------------------------------- ** ORGANISATION ** Programme Chairs * Maribel Fernandez (King's College London, UK) * Chris Poskitt (Singapore Management University, Singapore) Programme Committee * Nicolas Behr (Universit? Paris Cit?, CNRS, IRIF, France) * Paolo Bottoni (Sapienza University of Rome, Italy) * Andrea Corradini (Universit? di Pisa, Italy) * Juan De Lara (Universidad Autonoma de Madrid, Spain) * Rachid Echahed (CNRS and University of Grenoble, France) * Holger Giese (Hasso Plattner Institute at the University of Potsdam, Germany) * Russ Harmer (CNRS & ENS Lyon, France) * Reiko Heckel (University of Leicester, UK) * Wolfram Kahl (McMaster University, Canada) * Barbara K?nig (University of Duisburg-Essen, Germany) * Leen Lambers (BTU Cottbus - Senftenberg, Germany) * Yngve Lamo (Western Norway University of Applied Sciences, Norway) * Fernando Orejas (Technical University of Catalonia, Spain) * Detlef Plump (University of York, UK) * Arend Rensink (University of Twente, Netherlands) * Leila Ribeiro (Universidade Federal do Rio Grande do Sul, Brazil) * Andy Sch?rr (TU Darmstadt, Germany) * Pawel Sobocinski (Tallinn University of Technology, Estonia) * Gabriele Taentzer (Philipps-Universit?t Marburg, Germany) * Kazunori Ueda (Waseda University, Japan) * Jens Weber (University of Victoria, Canada) --------------------------------------- ** CONTACT ** All questions about submissions should be emailed to both PC Chairs via cposkitt at smu.edu.sg and maribel.fernandez at kcl.ac.uk --------------------------------------- -------------- next part -------------- An HTML attachment was scrubbed... URL: From musard.balliu at gmail.com Fri Dec 9 09:31:45 2022 From: musard.balliu at gmail.com (Musard Balliu) Date: Fri, 9 Dec 2022 15:31:45 +0100 Subject: [TYPES/announce] PLAS 2022: Monday, December 12, 2022 (free, online, excellent programme) Message-ID: Dear all, We are happy to invite you to the 17th Workshop on Programming Languages and Analysis for Security (PLAS 2022) on Monday, *December 12th. 2022.* https://urldefense.com/v3/__https://plas2022.github.io/__;!!IBzWLUs!WcWEJ_M_0_efmIbKQ_w3aVIi69m8eAwJ5HcE8lGJkrklYQGSPn__1YswVsGtPHbzsPM_DGSZfi4liczX8PeFkr1AkHRbywfWDswaBg$ The workshop will be held *virtually over Zoom and does not require any registration*. We offer an excellent programme featuring *a keynote by Elaine Shi (Associate Professor at Carnegie Mellon University)* and *state of the art research presentations* at the intersection of programming languages and security. All welcome. Best regards, Musard Balliu and Sunjay Cauligi -------------- next part -------------- An HTML attachment was scrubbed... URL: From kkmicins at syr.edu Sun Dec 11 22:25:28 2022 From: kkmicins at syr.edu (Kristopher K Micinski) Date: Mon, 12 Dec 2022 03:25:28 +0000 Subject: [TYPES/announce] POPL '23 Early Bird Registration ending Friday, Dec 16 Message-ID: Call for Participation: POPL'23 January 15--21, 2023, Boston Registration now open: https://urldefense.com/v3/__https://cvent.me/kV4ZYZ__;!!IBzWLUs!Xx9qDtXLoGu6BDBYf8Om0JnuNvd6O72wrfsISSo_AIj7GqwsJVskG8tzOGimrRnCI-PJwHl3wozRJucTC-CibhkuYVXG1nBQ$ (Early registration ends Fri, Dec 16!) POPL'23 --- The 50th ACM Symposium on Principles of Programming Languages, will be held in Boston, MA, from January 15 to January 21, 2023. The annual POPL meeting is a forum for the discussion of all aspects of programming languages and programming systems. This year marks POPL's 50th anniversary, and will bring POPL back to the site of its first occurrence: Boston, Massachusetts. The symposium is sponsored by ACM SIGPLAN, in cooperation with ACM SIGACT and ACM SIGLOG. This year's program consists of 74 research papers on a wide variety of topics. The registration is now open, see POPL'23 website for details. Location: POPL?23 will be held in person in Boston from Sunday, January 15 to Saturday, January 21, 2023. The conference will be held at the Boston Park Plaza hotel, just steps away from the beautiful Boston Common. POPL'23 will feature a keynote lectures by Viktor Vafeiadis. TutorialFest at POPL will host a wide variety of exciting tutorials, including: "Deductive Verification of Probabilistic Programs" by Benjamin Lucien Kaminski, Joost-Pieter Katoen, and Christoph Matheja "Incorrectness Logic and Under-approximation: Foundations of Bug Catching" by Quang Loc Le, Peter O'Hearn, and Azalea Raad "Isabelle/HOL: Foundations, Induction, and Coinduction" by Andrei Popescu, and Dmitriy Traytel "Neurosymbolic Programming" by Swarat Chaudhuri, Atharva Sehgal, Jennifer Sun, and Yisong Yue "QuickChick: Combining Random Testing and Verification in Coq" by Leonidas Lampropoulos "RUST: Regions, Uniqueness, Ownership & Types" by James Noble and Tobias Wrigstad "Using a Proof Assistant to Teach PL Theory, Without the Overhead" by Jonathan Aldrich and John Boyland "Z3 Internals -- A guide to principles, art and empirics of programming SMT solvers" by Nikolaj Bj?rner Mentoring: POPL'23 will include the following events for helping attendees with research and career opportunities in programming languages: Programming Languages and Mentoring Workshop (PLMW) Junior Faculty Mentoring Breakfast Mentoring Breakfast for Graduating PhDs and Postdocs Diversity, Equity, and Inclusion: POPL is committed to welcoming and fostering participation by diverse members of PL community. DEI events at POPL'23 include Women at POPL Lunch LGBTQ+ at POPL Lunch Co-located meetings: Certified Programs and Proofs (CPP) 2023 24th International Symposium on Practical Aspects of Declarative Languages (PADL) 2023 23rd International Conference on Verification, Model Checking, and Abstract Interpretation (VMCAI) 2023 Co-located workshops: Eighth International Workshop on Coq for Programming Languages (CoqPL) Seventh International Workshop on Languages for Inference (LAFI) ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation (PEPM) Workshop on Principles of Secure Compilation (PriSC) Programming Languages and the Law (ProLaLa) First Workshop on the Implementation of Type Systems (WITS) Organizing Committee: Andrew C. Myers (General Chair) Amal Ahmed (PC Chair) Ilya Sergey (Industrial Relations) Kristopher Micinski (Publicity) William Bowman and Anders Miltner (Workshops) Jeehoon Kang and Danfeng Zhang (Student Research Competition) Leonidas Lampropoulos and Mukund Raghothaman (Artifact Evaluation) Kostas Ferles and Yuepeng Wang (Web) Shraddha Barke and Konstantinos Kallas (Student Volunteer) Benjamin Delaware (Accessibility, Diversity, and Inclusion) Guilherme Espada (Video) Apoorv Ingle (Virtualization) Neringa Young (Treasury and Conference Manager) Industry Sponsors: POPL'23 gratefully acknowledges financial support from industry sponsors: Platinum: Jane Street, ahrefs, Epic Games, and Input | Output Silver: JetBrains Bronze: Certik, Certora, and Google PLMW Gold: Jane Street PLMW Silver: Galois Early stage: Veridise Women at POPL: Tarides From wjb at williamjbowman.com Mon Dec 12 17:15:57 2022 From: wjb at williamjbowman.com (PLDI 2023 Publicity Chairs) Date: Mon, 12 Dec 2022 14:15:57 -0800 Subject: [TYPES/announce] PLDI 2023 Student Research Competition (SRC) Message-ID: Please distribute widely. # Call for Student Research Competition Submissions 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. Over the past three years, we have explored various ways to make the Student Research Competition (SRC) accessible to a wider audience. Every format comes with its own set of pros and cons. In fully virtual conferences, we miss seeing our friends and colleagues in person; on the other hand, we also enjoy seeing more participation globally. At the same time, many have found that a hybrid format inhibits engagement from all participants (remote and in-person). Last year, we introduced the two-track format where we incorporated the positive components of a hybrid event (increased accessibility) while mitigating the negative components (limited engagement). This year, we will again use the same format and hope that it will continue to increase participation! ## 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 are strongly encouraged to select one of the tracks at submission time. We will do our best to accommodate any changes after 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. When you?re ready, submit your extended abstract at the submission site: https://urldefense.com/v3/__https://pldi23src.hotcrp.com/__;!!IBzWLUs!Q0kCW72vxYXywRkyN2F1TVoZsGzki7LJiCPCfJHE6UTCkz7Yo7TK2jkyfcdN4vq1ImOy-g_zhGUBDfzLA8SOMXxKgQ8svs9U$ . 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! ## SRC Chairs: - Chandrakana Nandi, Certora, inc. - Jubi Taneja, Microsoft Research -- PLDI 2023 Publicity Chairs William J. Bowman Anders Miltner From michael.grossniklaus at uni-konstanz.de Mon Dec 12 06:01:23 2022 From: michael.grossniklaus at uni-konstanz.de (Michael Grossniklaus) Date: Mon, 12 Dec 2022 12:01:23 +0100 Subject: [TYPES/announce] Tenure-Track Assistant Professor in Software Engineering at the University of Konstanz, Germany Message-ID: The University of Konstanz (Germany) seeks to fill the position of a Tenure-Track Assistant Professor in Software Engineering The University of Konstanz is one of eleven Universities of Excellence in Germany. The Department of Computer and Information Science welcomes applications from researchers from all areas of Software Engineering. More information and access to the online application portal are available via https://stellen.uni-konstanz.de/jobposting/1c7bd15ad5ee9dab77029b35a2ec852cb4916a640 Please notice that while the Tenure-Track Professor position starts at the W1 salary level ("junior professor"), the successful candidate will be directly promoted to a Full Professor position at the W3 salary level if tenure is granted. Applications are due by January 31, 2023 (extended deadline), exclusively via the online application portal. I am happy to answer questions or forward them appropriately if necessary. We are looking forward to your application! Best regards, Michael Grossniklaus --- Prof. Dr. Michael Grossniklaus (he/him/his) Department of Computer and Information Science University of Konstanz -------------- next part -------------- A non-text attachment was scrubbed... Name: smime.p7s Type: application/pkcs7-signature Size: 5777 bytes Desc: not available URL: From noam.zeilberger at gmail.com Tue Dec 13 08:32:44 2022 From: noam.zeilberger at gmail.com (Noam Zeilberger) Date: Tue, 13 Dec 2022 14:32:44 +0100 Subject: [TYPES/announce] 16th workshop on Computational Logic and Applications: Call for Participation Message-ID: *** Call for Participation *** *** 16th workshop on Computational Logic and Applications (CLA), at Ecole Polytechnique (south of Paris) and online. *** The previsional program is here: https://urldefense.com/v3/__https://cla.tcs.uj.edu.pl/*program__;Iw!!IBzWLUs!U1lh34IWTRV1bcWi9EpPjpvSFyLeX7VkG0N3yjEKLliKfPRWUNeFAnKuZSYQMfwubeaBPqk8vNlB3sjJILNXYRhx9c13bsldhCoWgp8i$ Registration ============ Fill in the form ( https://urldefense.com/v3/__https://docs.google.com/forms/d/1oAqKLZ5xkDjvXhrHZM3lofKYXxjUhv1muRVmjRgEJhY/__;!!IBzWLUs!U1lh34IWTRV1bcWi9EpPjpvSFyLeX7VkG0N3yjEKLliKfPRWUNeFAnKuZSYQMfwubeaBPqk8vNlB3sjJILNXYRhx9c13bsldhHirJg24$ ) to register your intention to participate. Whether in person or online, attendance is free. Please remember, however, to meet the registration deadlines. Important dates =============== - Registration deadline for in-person attendance: December 16, 2022 - Registration deadline for online attendance: January 9, 2023 - Workshop: January 12-13, 2023 Overview and scope ================== Started in 2002, the CLA workshops (https://urldefense.com/v3/__https://cla.tcs.uj.edu.pl/__;!!IBzWLUs!U1lh34IWTRV1bcWi9EpPjpvSFyLeX7VkG0N3yjEKLliKfPRWUNeFAnKuZSYQMfwubeaBPqk8vNlB3sjJILNXYRhx9c13bsldhNmdDJ7m$ ) provide an open, free access forum for interdisciplinary research concentrated around combinatorial and quantitative aspects of mathematical logic and their applications in computer science. Topics within the scope of CLA include: - combinatorics of lambda calculus, sequent calculi, and related logical formalisms, as well as their interactions with the combinatorics of maps and related objects; - combinatorics of lattices derived from logic or rewriting; - asymptotic enumeration and statistical properties of formulae, types, proofs, programs, etc.; - quantitative aspects of program evaluation and normalisation; - random generation with applications to logic and programming; - randomness in software testing and counter-example generation. Organizing and Programme Committee ================================== - Olivier Bodini - Alain Giorgetti - Noam Zeilberger -------------- next part -------------- An HTML attachment was scrubbed... URL: From bove at chalmers.se Tue Dec 13 08:59:00 2022 From: bove at chalmers.se (Ana Bove) Date: Tue, 13 Dec 2022 14:59:00 +0100 Subject: [TYPES/announce] 2 Associate professor positions at CSE, Chalmers Message-ID: <9c0cf808-a263-fa13-bd55-6adcf11f042f@chalmers.se> Dear All, The department of Computer science and engineering at Chalmers is opening 2 associate professors positions . The positions are open for qualified applicants with research and teaching experience in any area broadly covered by the department. As you probably know, the CSE department has a strong group working with programming languages, functional programming, dependent types and homotopy theory. We actively work to improve the?gender balance and diversity in our faculty, therefore we particularly welcome a diversity of applicants with?different backgrounds and experiences. Best -- -- Ana Bove, Docent Phone: (46)(31) 772 1020 https://urldefense.com/v3/__http://www.cse.chalmers.se/*bove__;fg!!IBzWLUs!S7_4CB8cm6S8I4EQL39vY4Rs-LwNThYQSMOZLmAhBBItrAhSeLoJQI5EXiINbR476fqXostVo2hL9u-ELPQjNKsVdw-H2w$ Department of Computer Science and Engineering Chalmers Univ. of Technology and Univ. of Gothenburg -------------- next part -------------- An HTML attachment was scrubbed... URL: From erikpoll at cs.ru.nl Tue Dec 13 15:51:28 2022 From: erikpoll at cs.ru.nl (Erik Poll) Date: Tue, 13 Dec 2022 21:51:28 +0100 (CET) Subject: [TYPES/announce] LangSec 2023 - Call for Papers, Work-in-Progress reports, and Panels Message-ID: The 9th Workshop on Language-theoretic Security and Applications (LangSec), affiliated with IEEE Symposium on Security and Privacy. solicits contributions of research papers, work-in-progress reports, and ideas for panel discussions related to the growing area of language-theoretic security. Important Dates Research paper submissions due: 15 Jan 2023, AOE Work-in-progress reports and panels submissions due: 5 Feb 2023, AOE Notification to authors: 27 Feb 2023 Submission page: https://urldefense.com/v3/__https://easychair.org/conferences/?conf=langsec2023__;!!IBzWLUs!Vk0c9l5hmwHho3bWUbqH9k4WVWXd32kwTEvNaozuFFOIrI5g2tjcmeFXc3k3tFV2-GnP-V_wElHBzVaazS2iq6BbGpIGzjI-$ Workshop Website: https://urldefense.com/v3/__https://langsec.org/spw23__;!!IBzWLUs!Vk0c9l5hmwHho3bWUbqH9k4WVWXd32kwTEvNaozuFFOIrI5g2tjcmeFXc3k3tFV2-GnP-V_wElHBzVaazS2iq6BbGpVYeTyM$ 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. problems. A non-exhaustive list of topics 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: Sergey Bratus (Dartmouth College) PC co-chair: Erik Poll (Radboud University) From j.a.perez at rug.nl Thu Dec 15 15:30:13 2022 From: j.a.perez at rug.nl (=?UTF-8?B?Sm9yZ2UgQS4gUMOpcmV6?=) Date: Thu, 15 Dec 2022 21:30:13 +0100 Subject: [TYPES/announce] Assistant professor position in Theoretical Computer Science - University of Groningen. Message-ID: Dear colleagues, Here is a reminder that the University of Groningen invites applications for one assistant professor position (tenure-track) in Theoretical Computer Science. The application deadline is January 8, 2023. The successful candidate will join the Fundamental Computing group of the Bernoulli Institute for Mathematics, Computer Science and AI. The group already has research expertise on concurrency theory, modal logic, coalgebra, and proof theory (see https://urldefense.com/v3/__http://www.rug.nl/fse/fc__;!!IBzWLUs!Wo7NytdoxUcmCDW7m2JSX3yPD1ZRaNgloVB4cvYpR7-0ONqyYArx5k5d2HdFpfNTyxtGsxq-QOEkzY4jXDKnRrfbyzPTYi3I$ ); we seek to reinforce our profile in Theoretical Computer Science, very broadly construed. This is a tenure-track position with 60% education - 30% research - 10% organizational tasks. Our tenure-track system offers well-defined perspectives for career and personal development. In particular, after five years of appointment, assistant professors are assessed for tenure and promotion to associate professor. For further details about this position, our tenure-track system, and the link to the application form see https://urldefense.com/v3/__https://www.rug.nl/about-ug/work-with-us/job-opportunities/?details=00347-02S0009PCP&cat=wp__;!!IBzWLUs!Wo7NytdoxUcmCDW7m2JSX3yPD1ZRaNgloVB4cvYpR7-0ONqyYArx5k5d2HdFpfNTyxtGsxq-QOEkzY4jXDKnRrfby_URuTj7$ Please disseminate widely among potential candidates. If you have any questions, please feel free to contact me . Best wishes, Jorge -- Jorge A. P?rez Associate Professor Leader, Fundamental Computing group Bernoulli Institute for Math, CS and AI University of Groningen, The Netherlands / From elenatalita at gmail.com Fri Dec 16 05:29:54 2022 From: elenatalita at gmail.com (Elena Di Lavore) Date: Fri, 16 Dec 2022 12:29:54 +0200 Subject: [TYPES/announce] Call for applications: Applied Category Theory Adjoint School 2023 Message-ID: CALL FOR APPLICATIONS THE ADJOINT SCHOOL 2023 February - July, 2023. Learning Seminar July 24 - 28, 2023. In-person Research Week at University of Maryland, College Park, USA Application Due: January 9, 2023 https://urldefense.com/v3/__https://adjointschool.com__;!!IBzWLUs!UKuFi8OY_asf827W3lydqvI0DkOuPrXjFHyzYG4maKS6l25fpmNmu-liG7c9x3meZ2g5KFec6PrRMTnndN8rrfY1Q2pt1P96zKU$ -------------------------------------------------------------------------------------------------------------------------- Are you interested in applying category-theoretic methods to problems outside of pure mathematics? Apply to The Adjoint School! Participants are divided into four-person project teams. Each project is guided by a mentor and a TA. The Adjoint School has two main components: an online learning seminar that meets regularly between February and June, and an in-person research week held in the summer adjacent to the Applied Category Theory Conference. During the learning seminar, we will read, discuss, and respond to papers chosen by the project mentors. Every other week a pair of participants will present a paper which will be followed by a group discussion. After the learning seminar each pair of participants will also write a blog post, based on the paper they presented, for The n-Category Cafe . Projects and Mentors: Message Passing Logic for Categorical Quantum Mechanics - Mentor: Priyaa SrinivasanBehavioural Metrics, Quantitative Logics and Coalgebras - Mentor: Barbara K?nigConcurrency in monoidal categories - Mentor: Chris HeunenGame Comonads and Finite Model Theory - Mentor: Dan Marsden Check more information about research projects in https://urldefense.com/v3/__https://adjointschool.com/2023.html__;!!IBzWLUs!UKuFi8OY_asf827W3lydqvI0DkOuPrXjFHyzYG4maKS6l25fpmNmu-liG7c9x3meZ2g5KFec6PrRMTnndN8rrfY1Q2pt48R6VgE$ Organizers Ana Luiza Tenorio Angeline Aguinaldo Elena Di Lavore Nathan Haydon -------------- next part -------------- An HTML attachment was scrubbed... URL: From luigi.santocanale at lis-lab.fr Fri Dec 16 14:41:14 2022 From: luigi.santocanale at lis-lab.fr (Luigi Santocanale) Date: Fri, 16 Dec 2022 20:41:14 +0100 Subject: [TYPES/announce] RAMiCS 2023 - Call for short contributions/posters Message-ID: (Apologies for multiple posting) CALL FOR SHORT CONTRIBUTIONS/POSTERS ???????????????????? 20th International Conference on ??????????? Relational and Algebraic Methods in Computer Science ??????????????????????????????? RAMiCS 2023 ??????????? 3 to 6 April 2023, Technologiezentrum Augsburg, Germany ??????????????????????? https://urldefense.com/v3/__https://ramics20.lis-lab.fr/__;!!IBzWLUs!SX2EE0L7PVt75r2rF719s5YoHShwv0eiHDycyWKVoM-JqRjtl1tMbCbTtGv9YADOMmdFnLIIwHXh8twyObQhO9W-iiwgkLyOaLCtd1MJ3jca$ Additionally to the standard CfP, RAMiCS is also calling for short contributions and posters.? We are hence calling for presentations of original, unfinished, already published, or otherwise interesting work within the topics of the RAMiCS conferences.? The submission can be in the form of a poster, an abstract, a paper submitted to or published at another conference, etc.? Short contributions will *not* be published in the conference proceedings. IMPORTANT DATES: ?? Submission:????????? January 27, 2023 ?? Notification:??????? February 03, 2023 ?? RAMiCS 2023:???????? April 03-06, 2023 INVITED SPEAKERS: ?? Alexander Knapp, Augsburg University, Germany ?? John Stell, University of Leeds, UK ?? Valeria Vignudelli, CNRS/ENS Lyon, France GENERAL INFORMATION: Since 1994, the RAMICS conference series has been the main venue for research on relation algebras, Kleene algebras and similar algebraic formalisms, and their applications as conceptual and methodological tools in computer science and beyond. TOPICS: We invite short submissions in the general fields of algebras relevant to computer science and applications of such algebras. Topics include but are not limited to: * Theory ?? - algebras such as semigroups, residuated lattices, semirings, ????? Kleene algebras, relation algebras and quantales ?? - their connections with program logics and other logics ?? - their use in the theories of automata, concurrency, formal languages, ????? games, networks and programming languages ?? - the development of algebraic, algorithmic, category-theoretic, ????? coalgebraic and proof-theoretic methods for these theories ?? - their formalisation with theorem provers * Applications ? - tools and techniques for program correctness, specification and ??? verification ? - quantitative and qualitative models and semantics of computing ???? systems and processes ? - algorithm design, automated reasoning, network protocol analysis, ???? social choice, optimisation and control ? - industrial applications SUBMISSION INSTRUCTIONS: Please send your short submission as a single pdf file to ?? ramics2023 at easychair.org by January 27, 2023. ORGANIZERS: Roland Gl?ck, Deutsches Zentrum f?r Luft- und Raumfahrt, Germany Luigi Santocanale, LIS, Aix-Marseille University, France Michael Winter, Brock University, Canada -- Luigi Santocanale, professeur, LIS/AMU From vincent.rahli at gmail.com Fri Dec 16 17:28:13 2022 From: vincent.rahli at gmail.com (vincent rahli) Date: Fri, 16 Dec 2022 22:28:13 +0000 Subject: [TYPES/announce] Assistant/Associate Professor positions in Computer Science at the University of Birmingham, UK Message-ID: Dear colleagues, The University of Birmingham is recruiting a number of academics at assistant/associate professor level in the School of Computer Science: https://urldefense.com/v3/__https://www.jobs.ac.uk/job/CVR578/assistant-professor-research-and-education__;!!IBzWLUs!TZzb9my6Qth4_j_ER9xUvJQdSeNjIe7sRVZ_eieMlOz64sVjDPymEplx9T9sDU1CmPeLTMAFUn3E9CSVuaQ43gTlD3SjWBpo3wlHUg$ https://urldefense.com/v3/__https://www.jobs.ac.uk/job/CVL993/associate-professor-research-and-education__;!!IBzWLUs!TZzb9my6Qth4_j_ER9xUvJQdSeNjIe7sRVZ_eieMlOz64sVjDPymEplx9T9sDU1CmPeLTMAFUn3E9CSVuaQ43gTlD3SjWBroyYxlPQ$ The Theory of Computation group at Birmingham is world-renowned, and we have been actively recruiting new researchers for some years now. More information about the group is here: https://urldefense.com/v3/__https://www.birmingham.ac.uk/research/activity/computer-science/theory-of-computation/index.aspx__;!!IBzWLUs!TZzb9my6Qth4_j_ER9xUvJQdSeNjIe7sRVZ_eieMlOz64sVjDPymEplx9T9sDU1CmPeLTMAFUn3E9CSVuaQ43gTlD3SjWBp4CUJZLg$ Please encourage interested postdocs and students to apply! For informal enquiries, please contact Dr Anupam Das and/or any other member of the group if you intend to make an application. Best, On behalf of the Theory group, Vincent -- https://urldefense.com/v3/__https://vrahli.github.io/__;!!IBzWLUs!TZzb9my6Qth4_j_ER9xUvJQdSeNjIe7sRVZ_eieMlOz64sVjDPymEplx9T9sDU1CmPeLTMAFUn3E9CSVuaQ43gTlD3SjWBp2VXU58Q$ -------------- next part -------------- An HTML attachment was scrubbed... URL: From aplatzer at cs.cmu.edu Sat Dec 17 16:22:58 2022 From: aplatzer at cs.cmu.edu (Andre Platzer) Date: Sat, 17 Dec 2022 22:22:58 +0100 Subject: [TYPES/announce] Recruiting: Doctoral Researchers / PhD Students Message-ID: <0163CEFA-CC15-40BC-8CAE-1A562D544CAE@cs.cmu.edu> The group of Andr? Platzer, the Alexander von Humboldt Professor for Logic of Autonomous Dynamical Systems, in the Department of Informatics at KIT, Karlsruhe, is recruiting a PhD Student or Doctoral Researcher (full-time, about ?4200-4800 gross by TVL E13 depending on experience). Exceptionally qualified applicants for postdoc positions may be considered as well. Our research develops the logical foundations for cyber-physical systems and practical theorem proving tools for analyzing and correctly building such systems, including the theorem prover KeYmaera X, verified runtime monitoring ModelPlex, verified compilation, and provably safe AI techniques. Our techniques are used to analyze the safety of autonomous cars, airplanes and collision avoidance protocols in aerospace applications, robotics, and train control. Key requirements for successful applications: ? Excellent M.Sc. degree in computer science, mathematics or related subjects. ? Strong demonstrable commitment to research. ? Strong background in logic, theorem proving, formal methods, or programming language theory. ? Strong background in mathematics, physics, or engineering. ? Proficiency in English, excellent speaking and writing skills. ? Experience in software development projects is a plus. The successful candidate is able to quickly get into new research areas and will be responsible for actively engaging in novel research questions, publishing and communicating research results, advising junior students, assisting in research grants, implementation of research results in formal methods or theorem proving tools, and demonstrating their applicability in cyber-physical systems applications. Faculty / Division: Alexander von Humboldt Professor group on Logic of Autonomous Dynamical Systems, KIT Department of Informatics Group: The Alexander von Humboldt Professorship, Germany's most highly endowed international research award, is endowed with up to five million euros. With this award, the Alexander von Humboldt Foundation honors internationally leading researchers of all disciplines. Institute: Institute of Information Security and Dependability (KASTEL) Institute for Reliability of Autonomous Dynamical Systems (VADS) of the Karlsruhe Institute of Technology (KIT) Starting Date: Immediately Application Material: Usual material as PDF, including letter, curriculum vitae with references, statement of purpose (a concise two-page essay describing your primary research interests and experience), publications, academic transcripts, etc. Contact Person: Andr? Platzer https://urldefense.com/v3/__https://logic.kastel.kit.edu/pub/job-ad.html__;!!IBzWLUs!RdfvSQMxVLBumFB9tdU1WuK-saFGdrgo0NGeqJ4i5piOlnmO3EZXIcdLYbv_p4eANLU73wbrKJywsYMw7wfIoakHFwSSSSERBOM$ From serge.autexier at dfki.de Sat Dec 17 03:48:31 2022 From: serge.autexier at dfki.de (Serge Autexier) Date: Sat, 17 Dec 2022 09:48:31 +0100 (CET) Subject: [TYPES/announce] Call for Workshops: Conference on Intelligent Computer Mathematics (CICM 2023) Message-ID: <20221217084831.92F6CC23741B@gigondas.localdomain> Call for Workshop and Tutorial Proposals 16th Conference on Intelligent Computer Mathematics - CICM 2023 - September 4-8, 2023 Cambridge, United Kingdom https://urldefense.com/v3/__https://www.cicm-conference.org/2023__;!!IBzWLUs!Xk1P7o5T8Pdl5_X2Te7VZTuEWe2y7kMG_Kpe915DAGS4YSiS6BrJWsYrEpDslIGG3rVG7XtzTtyp6pKd-Y4ZWXfOsV8EAInC_fj1O4w9$ ---------------------------------------------------------------------- The CICM conference brings together the many separate communities that have developed theoretical and practical solutions for mathematical applications. CICM will be held as a hybrid event (in person and online) and will provide associated events with appropriate infrastructure for supporting both kinds of participants. CICM covers * all aspects of mathematics such as formalization, computation, deduction, mathematical databases, and mathematical documents, * all kinds of tool support such as theorem provers, computer algebra systems, knowledge management tools, and user interfaces * the whole spectrum from theoretical foundations to practical tools and from challenge problems to case studies. Workshops typically feature presentations of ongoing research that is not ready yet for formal publication, and tutorials present extended demos of a particular software. However, the CICM organizers strongly encourage a broad interpretation of these concepts and welcome proposals for any kind of event that benefits the CICM community. A proposal should include the following information: * title of the event * names and affiliations of the organizers * brief description of the event (e.g., 1-2 paragraphs) * proposed workshop duration (typically half a day up to two days) * style (online-only, in person-only, hybrid) * previous instances of the event (if any) * preferred or excluded dates within the CICM dates (if any) CICM will take care of publishing and distributing informal proceedings of the workshop/tutorial events (if the respective organizers so wish) via open access online proceedings with CEUR-WS.org. Important Dates =============== Proposal submission: January 13, 2023 Notication: January 20, 2023 Conference: September 4-8, 2023 Earlier submissions are encouraged and will receive notifications on a rolling basis. All proposals should be submitted via https://urldefense.com/v3/__https://easychair.org/conferences/?conf=cicm2023__;!!IBzWLUs!Xk1P7o5T8Pdl5_X2Te7VZTuEWe2y7kMG_Kpe915DAGS4YSiS6BrJWsYrEpDslIGG3rVG7XtzTtyp6pKd-Y4ZWXfOsV8EAInC_cfMUnp4$ More details on the conference are available from https://urldefense.com/v3/__https://www.cicm-conference.org/2023__;!!IBzWLUs!Xk1P7o5T8Pdl5_X2Te7VZTuEWe2y7kMG_Kpe915DAGS4YSiS6BrJWsYrEpDslIGG3rVG7XtzTtyp6pKd-Y4ZWXfOsV8EAInC_fj1O4w9$ From dezani at di.unito.it Sun Dec 18 16:41:03 2022 From: dezani at di.unito.it (Mariangiola Dezani) Date: Sun, 18 Dec 2022 22:41:03 +0100 Subject: [TYPES/announce] 2023 Alonzo Church Award: Call for Nominations Message-ID: <2B04715B-CFD2-4DA7-BEA7-725A2D32003A@di.unito.it> CALL FOR NOMINATIONS The 2023 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!Wc3coHUkDSU5l7pGANnEeYKxxwH2KVHCF9nrmQlvUMKQcxzS7rjkIoKGcCKN-Y95iClNWXvhmq9lDNJUJ4IAMVFZD8TgdW93$ , https://urldefense.com/v3/__https://www.eatcs.org/index.php/church-award/__;!!IBzWLUs!Wc3coHUkDSU5l7pGANnEeYKxxwH2KVHCF9nrmQlvUMKQcxzS7rjkIoKGcCKN-Y95iClNWXvhmq9lDNJUJ4IAMVFZD5wY1ixB$ , and https://urldefense.com/v3/__https://www.eacsl.org/alonzo-church-award/__;!!IBzWLUs!Wc3coHUkDSU5l7pGANnEeYKxxwH2KVHCF9nrmQlvUMKQcxzS7rjkIoKGcCKN-Y95iClNWXvhmq9lDNJUJ4IAMVFZDwWJkK2F$ . The 2022 Alonzo Church Award was given to Dexter Kozen for his ground- breaking work on the theory and applications of Kleene Algebra with Tests. 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 2023 award, the cut-off date is January 1, 1998. 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 2023 award are now being solicited. The nominating letter must summarise 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 for the 2023 award are automatically considered for all future editions of the award, until they receive the award or the nominated papers are no longer eligible. Nominations should be submitted to dezani at di.unito.it and to mariangiola.dezani at gmail.com by February 1, 2023. PRESENTATION OF THE AWARD The 2023 award will be presented at the 50th EATCS International Colloquium on Automata, Languages and Programming, which is scheduled to take place in Paderborn - Germany on July 10-14, 2023. 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 2023 Alonzo Church Award Committee consists of the following five members: Thomas Colcombet, Mariangiola Dezani (chair), Marcelo Fiore, Radha Jagadeesan, and Igor Walukiewicz. @@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@ Mariangiola Dezani-Ciancaglini Dipartimento di Informatica Universita' di Torino c.Svizzera 185, 10149 Torino (Italy) -------------- next part -------------- An HTML attachment was scrubbed... URL: From alcsc at dtu.dk Mon Dec 19 07:32:11 2022 From: alcsc at dtu.dk (Alceste Scalas) Date: Mon, 19 Dec 2022 13:32:11 +0100 Subject: [TYPES/announce] PLACES 2023 - Call for Papers Message-ID: <3db5d805-d3d7-43e8-f72b-68164e2a087d@dtu.dk> ** PLACES 2023 ** 14th Workshop on Programming Language Approaches to Concurrency- and Communication-cEntric Software 22 April 2023, Paris, France Satellite workshop of ETAPS 2023 https://urldefense.com/v3/__https://places-workshop.github.io/2023__;!!IBzWLUs!RCyfTazZxIVxJNtw9jqdtDNXyI3AqjnnaSxLxT-RT59H-fclGe-pfHc3ykxVikEB6cxTr7EDiPkBqWHk7U-Wf0rOAF92$ 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. ## IMPORTANT DATES * Abstract registration deadline: 12 February 2023, AoE * Submission deadline: 15 February 2023, AoE * Author notification: 17 March 2023, AoE * Workshop: 22 April 2023 in Paris, France ## INVITED SPEAKER * Marieke Huisman, University of Twente, NL ## SUBMISSION INSTRUCTIONS Submission site: https://urldefense.com/v3/__https://easychair.org/conferences/?conf=places2023__;!!IBzWLUs!RCyfTazZxIVxJNtw9jqdtDNXyI3AqjnnaSxLxT-RT59H-fclGe-pfHc3ykxVikEB6cxTr7EDiPkBqWHk7U-Wf8Az2XtS$ 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 are peer-reviewed by a minimum of three reviewers, with the aim of allocating at least one expert reviewer. Submissions must be formatted with the EPTCS style. We welcome the following types of submission: * Research papers with a maximum length of 8 pages (with no restriction on bibliography or appendices, which the reviewers are not required to read). Submitted research papers are reviewed based on their novelty, clarity, and technical soundness. They must not be submitted for publication elsewhere, and if accepted, they will appear in the PLACES proceedings. * Talk proposals with a maximum length of 2 pages (with no restriction on bibliography or appendices, which the reviewers are not required to read). Talk proposals may present ongoing work, as well as work already published elsewhere. Accepted talk proposals will be presented at the workshop, but will not appear in the PLACES proceedings. ## 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 ## PROCEEDINGS AND JOURNAL SPECIAL ISSUE The proceedings of PLACES 2023 with accepted research papers will be published as a volume of EPTCS - https://urldefense.com/v3/__https://eptcs.org/__;!!IBzWLUs!RCyfTazZxIVxJNtw9jqdtDNXyI3AqjnnaSxLxT-RT59H-fclGe-pfHc3ykxVikEB6cxTr7EDiPkBqWHk7U-Wf4r30m6T$ Authors of selected papers from PLACES 2023 will be later invited to submit extended versions of their papers to a special issue of Information and Computation or JLAMP or FAC. ## PROGRAMME CHAIRS * Ilaria Castellani, INRIA Sophia Antipolis M?diterran?e, FR * Alceste Scalas, Technical University of Denmark, DK ## PROGRAMME COMMITTEE * Marco Carbone, IT University of Copenhagen, DK * Elias Castegren, Uppsala University, SE * Silvia Crafa, Universit? di Padova, IT * Francisco Ferreira, Royal Holloway, University of London, UK * Jos? Fragoso Santos, Universidade de Lisboa and INESC-ID, PT * Paola Giannini, Universit? del Piemonte Orientale, IT * Andrew K. Hirsch, State University of New York at Buffalo, US * Sung-Shik Jongmans, Open University of the Netherlands, NL * Luc Maranget, INRIA Paris, FR * Andreia Mordido, Universidade de Lisboa and LASIGE, PT * Violet Ka I Pun, Western Norway University of Applied Sciences, NO * Emilio Tuosto, Gran Sasso Science Institute, IT * Laura Voinea, University of Glasgow, UK ## ORGANISING COMMITTEE * Simon Gay, University of Glasgow, UK * Luca Padovani, Universit? di Camerino, IT * Vasco T. Vasconcelos, Universidade de Lisboa, PT * Nobuko Yoshida, University of Oxford and Imperial College London, UK To contact the PLACES 2023 programme chairs: places23 at googlegroups.com -- Alceste Scalas - https://urldefense.com/v3/__https://people.compute.dtu.dk/alcsc__;!!IBzWLUs!RCyfTazZxIVxJNtw9jqdtDNXyI3AqjnnaSxLxT-RT59H-fclGe-pfHc3ykxVikEB6cxTr7EDiPkBqWHk7U-Wf6lsbEGk$ Associate Professor @ DTU Compute - Section for Software Systems Engineering Technical University of Denmark Building 321, Room 010 2800 Kgs. Lyngby From josef.morales at imdea.org Mon Dec 19 07:08:12 2022 From: josef.morales at imdea.org (Jose F. Morales) Date: Mon, 19 Dec 2022 13:08:12 +0100 Subject: [TYPES/announce] HCVS 2023 - First Call for Papers Message-ID: 10th Workshop on Horn Clauses for Verification and Synthesis (HCVS) Co-located with ETAPS 2023 23rd April 2023 - Paris, France https://urldefense.com/v3/__https://www.sci.unich.it/hcvs23/__;!!IBzWLUs!V1xR-cgNLBZoYduxaAcXOVKHUQKr-CPwfkQ_wfQeTkv9VtfKqTjnE5unaUeddnT5IK0K1hTLgf1FIdqyL5tpHPtw5kqQXLxljkGmcQ$ Important dates: - Paper submission deadline: Feb 22, 2023 - Paper notification: Mar 22, 2023 - Workshop: Apr 23, 2023 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 2022 in Munich, Germany (ETAPS 2022), HCVS 2021, online (ETAPS 2021), HCVS 2020, online (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, extended abstracts of doctoral theses, and overviews of research projects that are of interest to the workshop. At least one author of each accepted paper will be required to attend the workshop to present the contribution. CHC Competition: HCVS 2023 will host the 6th competition on constraint Horn clauses (CHC-COMP https://urldefense.com/v3/__https://chc-comp.github.io/__;!!IBzWLUs!V1xR-cgNLBZoYduxaAcXOVKHUQKr-CPwfkQ_wfQeTkv9VtfKqTjnE5unaUeddnT5IK0K1hTLgf1FIdqyL5tpHPtw5kqQXLxgqgzoqA$ ), 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 CHC-COMP will be part of the workshop's proceedings. The report also contains tool descriptions of the participating solvers. Program Chairs: David Monniaux, VERIMAG, CNRS, Grenoble, France Jos? F. Morales, IMDEA Software, Madrid, Spain Program Committee: TBA 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!V1xR-cgNLBZoYduxaAcXOVKHUQKr-CPwfkQ_wfQeTkv9VtfKqTjnE5unaUeddnT5IK0K1hTLgf1FIdqyL5tpHPtw5kqQXLwvGxeuuA$ ) 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!V1xR-cgNLBZoYduxaAcXOVKHUQKr-CPwfkQ_wfQeTkv9VtfKqTjnE5unaUeddnT5IK0K1hTLgf1FIdqyL5tpHPtw5kqQXLwvGxeuuA$ (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=hcvs2023__;!!IBzWLUs!V1xR-cgNLBZoYduxaAcXOVKHUQKr-CPwfkQ_wfQeTkv9VtfKqTjnE5unaUeddnT5IK0K1hTLgf1FIdqyL5tpHPtw5kqQXLw67o5G6g$ -------------- next part -------------- An HTML attachment was scrubbed... URL: From yegor256 at gmail.com Mon Dec 19 00:05:34 2022 From: yegor256 at gmail.com (Yegor Bugayenko) Date: Mon, 19 Dec 2022 08:05:34 +0300 Subject: [TYPES/announce] Extended CFP: ICCQ'23, the 3rd IEEE International Conference on Code Quality Message-ID: The deadline was extended until the 28th of December! Name: 3nd International Conference on Code Quality (ICCQ) Date: April 22, 2023 Venue: St. Petersburg State University, Russia Website: https://urldefense.com/v3/__https://www.iccq.ru/2023.html__;!!IBzWLUs!VOn3MqJ0I_Mt9qudHts_qXWgFBQiukfKBaGWlPe09MoRbCa4bjTeBY5QAlgCQB4TjUIqniZJjah8LgbteJxjnSTedzTEKQ0$ Published by: IEEE Xplore (in cooperation with IEEE Computer Society) We believe that the quality of the source code that millions of programmers write every day could be much higher than it is now. We believe that the contribution computer science can make to improve this situation is greatly undervalued. We aim to solve this problem by gathering together cutting-edge researchers and letting them share their most recent ideas on static analysis, program verification, bug detection, and software maintenance. Due to the pandemic situation, the conference will be held in online mode: all speakers will present their work remotely over Zoom. IMPORTANT DATES Paper/abstract submission: 28 Dec 2022 (anywhere on Earth) Author notification: 1 Mar 2023 Camera-ready submissions: 25 Mar 2023 Conference: 22 Apr 2023 PROGRAM COMMITTEE Andrey Terekhov (Chair), SPbU Alexandre Bergel, University of Chile Laura M. Castro, Universidade da Coru?a Stephen Chang, UMass Boston Daniele Cono D'Elia, Sapienza University of Rome Pierre Donat-Bouillud, Czech Technical University Bernhard Egger, Seoul National University Samir Genaim, Universidad Complutense de Madrid Shachar Itzhaky, Technion Yusuke Izawa, Tokyo Institute of Technology Ranjit Jhala, University of California, San Diego Tetsuo Kamina, Oita University Christoph Kirsch, University of Salzburg Yu David Liu, Binghamton University Wolfgang de Meuter, Vrije Universiteit Brussel Antoine Min?, Sorbonne Universit? Guillermo Polito, CRIStAL Xuehai Qian, University of Southern California Junqiao Qiu, Michigan Technological University Yudai Tanabe, Tokyo Institute of Technology Tachio Terauchi, Waseda University Didier Verna, EPITA David West, New Mexico Highlands University Guannan Wei, Purdue University Vadim Zaytsev, University of Twente PUBLICATIONS We consider the following criteria when evaluating papers. Novelty: The paper presents new ideas and results and places them appropriately within the context established by previous research. Importance: The paper contributes to the advancement of knowledge in the field. We also welcome papers that diverge from the dominant trajectory of the field. Evidence: The paper presents sufficient evidence supporting its claims, such as proofs, implemented systems, experimental results, statistical analyses, case studies, and anecdotes. Clarity: The paper presents its contributions, methodology, and results clearly. Papers will be reviewed by three PC members using a double-blind review process. Submissions must be in PDF, printable in black and white on US Letter sized paper. All submissions must adhere to the ACM Small template (sigplan, two columns, 11pt font size). Submitted papers must be at least 4 and at most 16 pages long, including bibliographical references and appendices. Please, submit via EasyChair: https://urldefense.com/v3/__https://easychair.org/cfp/iccq23__;!!IBzWLUs!VOn3MqJ0I_Mt9qudHts_qXWgFBQiukfKBaGWlPe09MoRbCa4bjTeBY5QAlgCQB4TjUIqniZJjah8LgbteJxjnSTeMJVhy7g$ SPONSORS ICCQ is sponsored by St. Petersburg University, Innopolis University, HSE, MIPT, MSU, Yandex, Kaspersky, SberCloud, Huawei and others. QUESTIONS? If any questions, please email to team at iccq.ru -------------- next part -------------- An HTML attachment was scrubbed... URL: From anca at labri.fr Mon Dec 19 09:19:43 2022 From: anca at labri.fr (Anca Muscholl) Date: Mon, 19 Dec 2022 15:19:43 +0100 Subject: [TYPES/announce] ICALP 2023 - 2nd CFP Message-ID: <9A87E6E3-360D-4857-9A07-5B02BBFA6BBF@labri.fr> [Sorry for multiple postings] ======================================================== ICALP 2023 - Second Call for papers ======================================================== The 50th EATCS International Colloquium on Automata, Languages, and Programming (ICALP) will take place in: Paderborn, Germany, on 10-14 July 2023. ICALP is the main conference and annual meeting of the European Association for Theoretical Computer Science (EATCS). As usual, ICALP will be preceded by a series of workshops, which will take place on July 10. The 2023 edition has the following features: - Submissions are anonymous, and there is a rebuttal phase. - The conference is planned as a physical, in-person event. - This will be the 50th ICALP conference and some special events are planned. ======================================================== Important dates and information ======================================================== Submissions: February 11, 2023 at 11am CET Rebuttal: March 22-25, 2023 Author notification: April 21, 2023 Camera-ready version: May 5, 2023 Early registration: TBA Conference: July 10-14, 2023 (Workshops on July 10, 2023) Deadlines are firm; late submissions will not be considered. Conference website: https://urldefense.com/v3/__https://icalp2023.cs.upb.de/__;!!IBzWLUs!QSMAKRN8iguQcjQetunfGx9oN363AJTLB5EiCM8-E_lthy59IliMohElaRw6HjssAO-XMhcsFo6cK50rW6zi_-mAzjs$ Twitter: @ICALPconf Submission (tracks A and B): https://urldefense.com/v3/__https://easychair.org/conferences/?conf=icalp2023__;!!IBzWLUs!QSMAKRN8iguQcjQetunfGx9oN363AJTLB5EiCM8-E_lthy59IliMohElaRw6HjssAO-XMhcsFo6cK50rW6zi4xXOmiE$ ======================================================== Invited Speakers ======================================================== Anna Karlin - University of Washington, USA Rasmus Kyng - ETH Zurich, Switzerland Rupak Majumdar - Max Planck Institute for Software Systems, Germany Thomas Vidick - California Institute of Technology, USA, and Weizmann Institute of Science, Israel James Worrell - University of Oxford, UK ======================================================== Submission guidelines ======================================================== 1) Papers must present original research on the theory of computer science. No prior publication and no simultaneous submission to other publication outlets (either a conference or a journal) is allowed. Authors are encouraged to also make full versions of their submissions freely accessible in an on-line repository such as ArXiv, HAL, ECCC. 2) Submissions take the form of an extended abstract of no more than 15 pages, excluding references and a clearly labelled appendix. The appendix may consist either of omitted proofs or of a full version of the submission, and it will be read at the discretion of program committee members. The extended abstract has to present the merits of the paper and its main contributions clearly, and describe the key concepts and technical ideas used to obtain the results. Submissions must provide the proofs which can enable the main mathematical claims of the paper to be fully verified. 3) Submissions are anonymous. The conference will employ a fairly lightweight double-blind reviewing process. Submissions should not reveal the identity of the authors in any way. In particular, authors? names, affiliations, and email addresses should not appear at the beginning or in the body of the submission. Authors should ensure that any references to their own related work are 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 double-blind process is to help PC members and external reviewers come to an initial judgment about the paper without bias, and not to make it impossible for them to discover who the authors are 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. In particular, important references should not be omitted or anonymized. In addition, authors should feel free to disseminate their ideas or draft versions of their paper as they normally would. For example, authors may post drafts of their papers on the web, submit them to arXiv, and give talks on their research ideas. 4) The submissions are done via Easychair to the appropriate track of the conference (see topics below). The use of pdflatex and the LIPIcs style are mandatory: papers that deviate significantly from the required format risk rejection without consideration of merit. 5) During the rebuttal phase, authors will have from March 22-25 to view and respond to initial reviews. Further instructions will be sent to authors of submitted papers before that time. 6) At least one author of each accepted paper is required to register for the conference, and all talks are in-person. In exceptional cases, there may be support for remotely presenting a talk. 7) Papers authored only by students should be marked as such upon submission in order to be eligible for the best student paper awards of the track. ======================================================== Awards ======================================================== During the conference, the following awards will be given: ? the EATCS award, - the Church prize, ? the Presburger award, ? the EATCS distinguished dissertation award, ? the best papers for Track A and Track B, ? the best student papers for Track A and Track B (see submission guidelines). ======================================================== Proceedings ======================================================== ICALP proceedings are published in the Leibniz International Proceedings in Informatics (LIPIcs) series. This is a series of high-quality conference proceedings across all fields in informatics established in cooperation with Schloss Dagstuhl ? Leibniz Center for Informatics. LIPIcs volumes are published according to the principle of Open Access, i.e., they are available online and free of charge. ======================================================== Topics ======================================================== Papers presenting original research on all aspects of theoretical computer science are sought. Typical but not exclusive topics of interest are: Track A: Algorithms, Complexity and Games ----------------------------------------------------------- Algorithmic and Complexity Aspects of Network Economics Algorithmic Aspects of Biological and Physical Systems Algorithmic Aspects of Networks and Networking Algorithmic Aspects of Security and Privacy Algorithmic Game Theory and Mechanism Design Approximation and Online Algorithms Combinatorial Optimization Combinatorics in Computer Science Computational Complexity Computational Geometry Computational Learning Theory Cryptography Data Structures Design and Analysis of Algorithms Distributed and Mobile Computing Foundations of Machine Learning Graph Mining and Network Analysis Parallel and External Memory Computing Parameterized Complexity Quantum Computing Randomness in Computation Sublinear Time and Streaming Algorithms Theoretical Foundations of Algorithmic Fairness Track B: Automata, Logic, Semantics, and Theory of Programming ---------------------------------------------------------------------------------------- Algebraic and Categorical Models of Computation Automata, Logic, and Games Database Theory, Constraint Satisfaction Problems, and Finite Model Theory Formal and Logical Aspects of Learning Formal and Logical Aspects of Security and Privacy Logic in Computer Science and Theorem Proving Models of Computation: Complexity and Computability Models of Concurrent, Distributed, and Mobile Systems Models of Reactive, Hybrid, and Stochastic Systems Principles and Semantics of Programming Languages Program Analysis, Verification, and Synthesis Type Systems and Typed Calculi ======================================================== ICALP 2023 Programme Committee ======================================================== Track A: Algorithms, Complexity and Games Amir Abboud (Weizmann Institute, Israel) Mikkel Abrahamsen (University of Copenhagen, Denmark) Sepehr Assadi (Rutgers University, USA) Aditya Bhaskara (University of Utah, USA) Arnab Bhattacharyya (National University of Singapore, Singapore) Greg Bodwin (University of Michigan, USA) Karl Bringmann (Saarland University, Germany) Cl?ment Canonne (University of Sydney, Australia) Vincent Cohen Addad (Google Research, Zurich) Amin Coja Oghlan (TU Dortmund, Germany) Michael (Mike) Dinitz (Johns Hopkins University, USA) Uriel Feige (Chair) (Weizmann Institute and MSR, Israel) Moran Feldman (University of Haifa, Israel) Sebastian Forster (University of Salzburg, Austria) Sumegha Garg (Harvard University, USA) Parikshit Gopalan (Apple, USA) Russell Impagliazzo (University of California, San Diego, USA) Karthik C.S.(Rutgers University, USA) Yin Tat Lee (University of Washington, USA) Stefano Leonardi (Sapienza Universita di Roma, Italy) Sepideh Mahabadi (MSR Redmond, USA) Giulio Malavolta (Max Planck Institute for Security and Privacy, Germany) Jesper Nederlof (Utrecht University, Netherlands) Vianney Perchet (Ensae and Criteo AI Lab, France) Will Perkins (Georgia Institute of Technology, USA) Marcin Pilipczuk (University of Warsaw, Poland, and IT University of Copenhagen, Denmark) Aviad Rubinstein (Stanford University, USA) Barna Saha (University of California San Diego, USA) Rahul Santhanam (University of Oxford, UK) Thatchaphol Saranurak (University of Michigan, USA) Igor Shinkar (Simon Fraser University, Canada) Mohit Singh (Georgia Institute of Technology, USA) David Steurer (ETH Zurich, Swizerland) Ola Svensson (EPFL, Switzerland) Inbal Talgam-Cohen (Technion, Israel) Kavitha Telikepalli (Tata Institute of Fundamental Research, Mumbai, India) Vera Traub (University of Bonn, Germany) Salil Vadhan (Harvard University, USA) David Wajc (Google Research, USA) Henry Yuen (Columbia University, USA) Meirav Zehavi (Ben-Gurion University, Israel) Track B: Automata, Logic, Semantics, and Theory of Programming Shaull Almagor (Technion, Israel) Albert Atserias (Universitat Politecnica de Catalunya, Barcelona, Spain) Christel Baier (TU Dresden, Germany) V?ronique Bruy?re (University of Mons, Belgium) Thomas Colcombet (IRIF / CNRS / Universit? Paris Cit?, France) Andrei Bulatov (Simon Fraser University, Canada) Wojciech Czerwi?ski (University of Warsaw, Poland) Kousha Etessami (Chair) (University of Edinburgh, UK) John Fearnley (University of Liverpool, UK) Dana Fisman (Ben-Gurion University, Israel) Rob van Glabbeek (University of New South Wales, Australia) Chris Heunen (University of Edinburgh, UK) Justin Hsu (Cornell University, USA) Stefan Kiefer (University of Oxford, UK) Kohei Kishida (University of Illinois Urbana-Champaign, USA) Jan Kretinsky (Technical University of Munich, Germany) Karoliina Lehtinen (CNRS, Universit? Aix Marseille et Universit? de Toulon, LIS, France) Anthony Widjaja Lin (TU Kaiserslautern & MPI-SWS, Germany) Wim Martens (University of Bayreuth, Germany) Joanna Ochremiak (CNRS, University of Bordeaux, France and University of Warsaw, Poland) Daniela Petrisan (Universit? Paris Cit?, IRIF, France) Sam Staton (University of Oxford, UK) Ashutosh Trivedi (University of Colorado - Boulder, USA) Takeshi Tsukada (Chiba University, Japan) Mahesh Viswanathan (University of Illinois Urbana-Champaign, USA) ======================================================== ICALP 2023 Workshop Chair ======================================================== Track A and B: Matthias Fischer Selection Committee: Johannes Bl?mer Christian Scheideler Friedhelm Meyer auf der Heide See more details on the Call for Workshops webpage: https://urldefense.com/v3/__https://icalp2023.cs.upb.de/workshops/__;!!IBzWLUs!QSMAKRN8iguQcjQetunfGx9oN363AJTLB5EiCM8-E_lthy59IliMohElaRw6HjssAO-XMhcsFo6cK50rW6ziRo4WRj4$ ======================================================== ICALP 2023 Proceedings Chair ======================================================== Gabriele Puppis (University of Udine, Italy) ======================================================== ICALP 2023 Organizing Committee ======================================================== Ulrich Ahlers Bernard Bauer Johannes Bl?mer Tanja B?rger Nadija Carter Fabian Eidens Rainer Feldmann Matthias Fischer Sevag Gharibian (Chair) Marion Hucke Claudia Jahn Friedhelm Meyer auf der Heide Franziska Reichelt Petra Sch?fermeyer Christian Scheideler Ulf-Peter Schroeder Christian Soltenborn Anna Steinig Thomas Thissen Heinz Georg Wassing From elaine.pimentel at gmail.com Mon Dec 19 09:26:37 2022 From: elaine.pimentel at gmail.com (Elaine Pimentel) Date: Mon, 19 Dec 2022 14:26:37 +0000 Subject: [TYPES/announce] Call for Participation: CSL'23 Message-ID: Call for Participation: CSL'23 February 13-16, 2023 -- Warsaw, Poland Registration now open: https://urldefense.com/v3/__https://csl2023.mimuw.edu.pl/?page_id=696__;!!IBzWLUs!S9sn9GBvgjv0ZFknQYh_vuknUo8ld-4G3DO13duTm6mjNVN69uZ56pWE0MeSWlo-xwhN5czSQCBo28rwpLbjl6C9c_L6ynPW6YyK-tmw$ (Early registration ends 20/01/2023) ****** CSL is the annual conference of the European Association for Computer Science Logic (EACSL). It is an interdisciplinary conference, spanning across both basic and application oriented research in mathematical logic and computer science. In its 36th edition, CSL'23 will bring 34 research papers, including the Rasiowa award paper, and the special presentation of the Ackermann award. It will also feature keynote presentations by Claudia Faggian, Nina Gierasimczuk, Dale Miller, Micha? Pilipczuk and Davide Sangiorgi. The registration is now open, see CSL'23 website for details -- https://urldefense.com/v3/__https://csl2023.mimuw.edu.pl__;!!IBzWLUs!S9sn9GBvgjv0ZFknQYh_vuknUo8ld-4G3DO13duTm6mjNVN69uZ56pWE0MeSWlo-xwhN5czSQCBo28rwpLbjl6C9c_L6ynPW6cAdIFhP$ . Location: CSL?23 will be held in person in Warsaw, Poland, from February 13 to February 16, 2023. The conference is hosted by the University of Warsaw. Co-located workshops (February 17, 2023): - Logic mentoring workshop (LMW) - Fixpoints in computer science (FICS) - SchwentickFest Organizing Committee: Bartek Klin (PC co-chair) Elaine Pimentel (PC co-chair) Lorenzo Clemente (Organization chair) Wojciech Czerwi?ski (Local organization) Rados?aw Pi?rkowski (Local organization) -- Elaine. ----------------------------------- Elaine Pimentel Associate Professor in Programming Principles, Logic, and Verification Department of Computer Science University College London https://urldefense.com/v3/__https://sites.google.com/site/elainepimentel/__;!!IBzWLUs!S9sn9GBvgjv0ZFknQYh_vuknUo8ld-4G3DO13duTm6mjNVN69uZ56pWE0MeSWlo-xwhN5czSQCBo28rwpLbjl6C9c_L6ynPW6Ut-4uob$ ----------------------------------- -------------- next part -------------- An HTML attachment was scrubbed... URL: From Ralph.Matthes at irit.fr Mon Dec 19 14:12:21 2022 From: Ralph.Matthes at irit.fr (Ralph Matthes) Date: Mon, 19 Dec 2022 20:12:21 +0100 Subject: [TYPES/announce] =?utf-8?q?2nd_Call_for_Contributions_FICS_2023?= =?utf-8?q?=3A_Workshop_on_Fixed_Points_in_Computer_Science?= Message-ID: <4d737-63a0b780-d5-9d652b0@197210064> Dear all, This is the second call for contributions for FICS 2023, registration is now open on the CSL 2023 webpage: https://urldefense.com/v3/__https://csl2023.mimuw.edu.pl/?page_id=696__;!!IBzWLUs!V1I-LnR5uU6AkOnKEA5r1nsAHgB8XOD2vxOAPL29aILqJjsT3Cu4hydlf3gdZI2L6HdBIlYcfSOjEOQAkhzBskhY0L16zQEu68OfrQ$ The 11th International Workshop on Fixed Points in Computer Science will take place in Warsaw on 17 February 2023 as a satellite of the International Conference CSL 2023 (Computer Science Logic). FICS webpage: https://urldefense.com/v3/__https://perso.ens-lyon.fr/denis.kuperberg/FICS2023.htm__;!!IBzWLUs!V1I-LnR5uU6AkOnKEA5r1nsAHgB8XOD2vxOAPL29aILqJjsT3Cu4hydlf3gdZI2L6HdBIlYcfSOjEOQAkhzBskhY0L16zQHA3GOUGw$ The goal of the workshop is to bring together people from different fields such as algebra/coalgebra, verification, logic, around the thematic of fixed points. This workshop will be without proceedings. In particular you can present work that is already published elsewhere, or in progress. Depending on the nature of contributions, a pre-approved special issue of Fundamenta Informaticae might be published with selected contributions. Fixed points play a fundamental role in several areas of computer science. They are used to justify (co)recursive definitions and associated reasoning techniques. The construction and properties of fixed points have been investigated in many different settings such as: design and implementation of programming languages, logic, verification, databases. Topics include, but are not restricted to: -fixed points in algebra and coalgebra -fixed points in formal languages and automata -fixed points in game theory -fixed points in programming language semantics -fixed points in the mu-calculus and modal logics -fixed points in process algebras and process calculi -fixed points in functional programming and type theory -fixed points in relation to dataflow and circuits -fixed points in logic programming and theorem proving -fixed points in finite model theory, descriptive complexity theory, and databases -fixed points in category theory for logic in computer science Invited Speakers --------------------------------- Graham Leigh: TBA Dana Scott: Seventy Years Using Fixed Points (video lecture) ===================================== Submission Instructions ===================================== Abstracts presenting your communication should be sent via https://urldefense.com/v3/__https://easychair.org/conferences/?conf=fics2023__;!!IBzWLUs!V1I-LnR5uU6AkOnKEA5r1nsAHgB8XOD2vxOAPL29aILqJjsT3Cu4hydlf3gdZI2L6HdBIlYcfSOjEOQAkhzBskhY0L16zQHQdCsStg$ . Submissions should be from 1 to 3 pages long, excluding bibliography. An effort will be made to enable online participation for those who cannot attend in person. Important dates --------------------------------- Submission deadline: 06/01/2023 AoE Notification: 27/01/2023 Workshop: 17/02/2023 ===================================== Committees ===================================== Program Committee --------------------------------- -Henning Basold (LIACS, Univ. Leiden) -Anupam Das (Univ. Birmingham) -Karoliina Lehtinen (CNRS & LIS Marseille) -Denis Kuperberg, chair (CNRS & ENS Lyon) -Ralph Matthes (IRIT, CNRS & Univ. Toulouse) -Matteo Mio (CNRS & ENS Lyon) -Damian Niwinski (University of Warsaw) -Fredrik Nordvall Forsberg (Univ. of Strathclyde) -Luigi Santocanale (LIS, Univ. Aix-Marseille I) -Tarmo Uustalu (Reykjavik Univ., Tallinn Institute of Cybernetics) Steering Committee --------------------------------- -Peter Dybjer (Chalmers University of Technology) -Ralph Matthes (IRIT, CNRS & Univ. Toulouse) -Damian Niwinski (University of Warsaw) -Luigi Santocanale (LIS, Universit? Aix-Marseille I) -Denis Kuperberg, chair (CNRS & ENS Lyon) -Tarmo Uustalu (Reykjavik Univ., Tallinn Institute of Cybernetics) -Igor Walukiewicz (LaBRI, Bordeaux) From s-dgq at thorsten-wissmann.de Mon Dec 19 12:53:58 2022 From: s-dgq at thorsten-wissmann.de (Thorsten Wissmann) Date: Mon, 19 Dec 2022 18:53:58 +0100 Subject: [TYPES/announce] CALCO 2023: First Call for Papers Message-ID: ========================================================= CALL FOR PAPERS: CALCO 2023 10th International Conference on Algebra and Coalgebra in Computer Science June 19-22, 2023 Bloomington, Indiana (USA) and online Co-located with MFPS XXXIX https://urldefense.com/v3/__https://coalg.org/calco-mfps-2023/__;!!IBzWLUs!W0LhccrvUj4FDzKcPwic5qiXL8ZCeNIAyNjpZjUdHkCGmy727mFcEtPwZShLPp1o6KgLwXQPXrzDObIp4hGpFG2YDKqAYoPiSWvsV6A$ ========================================================== Paper submission: March 8, 2023 (AoE) Author notification: Apr 28, 2023 (AoE) Final version due: May 19, 2023 ========================================================== Scope ----- Algebraic and coalgebraic methods and tools are a mainstay of computer science. From data types to development techniques and specification formalisms, both theoreticians and practitioners have benefited from the large body of research proposed and implemented since the pioneering works of the 1960s. CALCO aims to bring together researchers with interests in both foundational and applicative uses of algebra and coalgebra in computer science, traditional as well as emerging ones CALCO is a high-level, bi-annual conference formed by joining the forces and reputations of CMCS (the International Workshop on Coalgebraic Methods in Computer Science) and WADT (the Workshop on Algebraic Development Techniques). Previous CALCO editions took place in Salzburg (Austria, 2021), London (UK, 2019), Ljubljana (Slovenia,2017), Nijmegen (the Netherlands, 2015), Warsaw (Poland, 2013), Winchester (UK, 2011), Udine (Italy, 2009), Bergen (Norway, 2007), Swansea (Wales, 2005). The 10th edition will be held in Bloomington, Indiana, co-located with MFPS XXXIX. It is planned as a physical, in-person event, with support for remote presence, both for speakers and for other participants who are unable or unwilling to travel. Submission Categories --------------------- CALCO invites papers relating to all aspects of algebraic and coalgebraic theory and applications, and distinguishes between four categories of submissions. 1. Regular papers that report * results on theoretical foundations * novel methods and techniques for software development * experiences with technology transfer to industry. 2. (Co)Algebraic Pearls papers that * present possibly known material in a novel and enlightening way. 3. Early ideas abstracts that lead to * presentations of work in progress * proposals for original venues of research. 4. Tool presentation papers that * report on the features and uses of algebraic/coalgebraic tools. Topics of Interests ------------------- All topics relating to algebraic and coalgebraic theory and applications are of interest for CALCO, and among them * Models and logics - Automata and languages - Graph transformations and term rewriting - Modal logics - Proof systems - Relational systems * Algebraic and coalgebraic semantics - Abstract data types - Re-engineering techniques (program transformations) - Semantics of conceptual modelling methods and techniques - Semantics of programming languages * Methodologies in software and systems engineering - Development processes - Method integration - Usage guidelines * Specialised models and calculi - Hybrid, probabilistic, and timed systems - Concurrent, distributed, mobile, cyber-physical, and context-aware computational paradigms - Systems theory and computational models (chemical, biological, etc.) * System specification and verification - Formal testing and quality assurance - Generative programming and model-driven development - Integration of formal specification techniques - Model-driven development - Specification languages, methods, and environments * Tools supporting algebraic and coalgebraic methods for - Advances in automated verification - Model checking - Theorem proving - Testing * String diagrams and network theory - Theory of PROPs and operads - Rewriting problems and higher-dimensional approaches - Automated reasoning with string diagrams - Applications of string diagrams * Quantum computing - Categorical semantics for quantum computing - Quantum calculi and programming languages - Foundational structures for quantum computing - Applications of quantum algebra Submissions Guidelines ---------------------- All submissions will be handled via EasyChair: https://urldefense.com/v3/__https://easychair.org/conferences/?conf=calco2023__;!!IBzWLUs!W0LhccrvUj4FDzKcPwic5qiXL8ZCeNIAyNjpZjUdHkCGmy727mFcEtPwZShLPp1o6KgLwXQPXrzDObIp4hGpFG2YDKqAYoPi5zUB6Hg$ The format for all submissions is specified by LIPIcs. Please use the latest version of the style: https://urldefense.com/v3/__http://www.dagstuhl.de/en/publications/lipics/instructions-for-authors/__;!!IBzWLUs!W0LhccrvUj4FDzKcPwic5qiXL8ZCeNIAyNjpZjUdHkCGmy727mFcEtPwZShLPp1o6KgLwXQPXrzDObIp4hGpFG2YDKqAYoPijAzvDWA$ It is recommended that submissions adhere to that format and length. Submissions that are clearly too long may be rejected immediately. Regular papers -------------- Prospective authors are invited to submit full papers in English presenting original research. Submitted papers must be unpublished and not submitted for publication elsewhere. Regular papers should be maximum 15 pages long, excluding references. Proofs omitted due to space limitations may be included in a clearly marked appendix. Proceedings will be published in the Dagstuhl LIPIcs Leibniz International Proceedings in Informatics series. A special issue of the open access journal Logical Methods in Computer Science (https://urldefense.com/v3/__http://www.lmcs-online.org__;!!IBzWLUs!W0LhccrvUj4FDzKcPwic5qiXL8ZCeNIAyNjpZjUdHkCGmy727mFcEtPwZShLPp1o6KgLwXQPXrzDObIp4hGpFG2YDKqAYoPieRu2ZJA$ ), containing extended versions of selected papers, is planned. (Co)algebraic pearls -------------------- This is a recent submission category. Explaining a known idea in a new way may make as strong a contribution as inventing a new idea. We encourage the submission of pearls: elegant essays that illustrate an idea in a beautiful or didactically clever way, perhaps by developing an application. Pearls are typically short and concise and so should not be longer than regular papers in the format specified by LIPIcs. Authors who feel they need a bit more space should consult with the PC co-chairs. The accepted papers will be included in the final proceedings of the conference. Each submission will be evaluated by at least two reviewers. Early ideas abstracts --------------------- Submissions should not exceed 2 pages in the format specified by LIPIcs. The volume of selected abstracts will be made available on arXiv and on the CALCO pages. Authors will retain copyright, and are also encouraged to disseminate the results by subsequent publication elsewhere. Each submission will be evaluated by at least two reviewers. Tool papers ----------- Submissions should not exceed 5 pages in the format specified by LIPIcs. The accepted tool papers will be included in the final proceedings of the conference. The tools should be made available on the web at the time of submission for download and evaluation. Each submission will be evaluated by at least three reviewers, and one or more of the reviewers will be asked to download and use the tool. Best Paper and Best Presentation Awards --------------------------------------- This edition of CALCO will feature two awards: a Best Paper Award whose recipients will be selected by the PC before the conference and a Best Presentation Award, elected by the participants. Programme Committee ------------------- * Carlos Gustavo Lopez Pombo (University of Buenos Aires) * Andreas Abel (Gothenburg University) * Vincenzo Ciancia (Consiglio Nazionale delle Ricerche, Pisa) * Patricia Johann (Appalachian State University) * Ionut Tutu (Simion Stoilow Institute of Mathematics of the Romanian Academy) * Martin Escardo (University of Birmingham) * Tarmo Uustalu (Reykjavik University) * Giorgio Bacci (Aalborg University) * Thorsten Wi?mann (Radboud University Nijmegen) * Fabio Gadducci (University of Pisa) * Shin-Ya Katsumata (National Institute of Informatics, Tokyo) * Holger Giese (Hasso Plattner Institute at the University of Potsdam) * Peter ?lveczky (University of Oslo) * Michael Johnson (Macquarie University) * Nicolas Behr (CNRS Universit? Paris Cit?) * Henning Urbat (FAU Erlangen-N?rnberg) * Valentina Castiglioni (Reykjavik University) * Fernando Orejas (Universitat Polit?cnica de Catalunya) * Mehrnoosh Sadrzadeh (University College London) * Georgiana Caltais (University of Twente) * S?awomir Lasota (University of Warsaw) * Aleks Kissinger (University of Oxford) * Thomas Colcombet (CNRS, IRIF, Universit? de Paris) * Sandra Kiefer (Max Planck Institute for Software Systems) * Peter Selinger (Dalhousie University) * Natasha Alechina (Utrecht University) * Sara Kalvala (University of Warwick) Chairs ------ Paolo Baldan (University of Padua) Valeria de Paiva (Topos Institute, Berkeley) Organiser --------- * Larry Moss (local) (Indiana University) From ralf.kuesters at sec.uni-stuttgart.de Wed Dec 21 03:35:49 2022 From: ralf.kuesters at sec.uni-stuttgart.de (Ralf Kuesters) Date: Wed, 21 Dec 2022 09:35:49 +0100 Subject: [TYPES/announce] CFP: IEEE CSF 2023 - Winter Cycle (Submission Deadline: February 3, 2023) Message-ID: <12219581-d556-e857-0c67-513702b389b9@sec.uni-stuttgart.de> ------------------------------------------------------------------------ 36th IEEE COMPUTER SECURITY FOUNDATIONS SYMPOSIUM (CSF) 2023 July 10 - 14, 2023 - Dubrovnik, Croatia https://urldefense.com/v3/__https://www.ieee-security.org/TC/CSF2023/__;!!IBzWLUs!V6fyDijM3j7UYOrui5EvJawWWsDOFIo0XWoh4c8FNT-PRC1Oa1aSUvSyoMw66uP1S5SjzQmeQcj9MD5clPxnCTHCpfhRyEXJ4TXQOINJiihYI4_z5A$ ------------------------------------------------------------------------ ===================================================================== ============ New CSF Mailing List (please subscribe) ================ ===================================================================== https://urldefense.com/v3/__http://lists.ieee-security.org/listinfo.cgi/csf-announcements-ieee-security.org__;!!IBzWLUs!V6fyDijM3j7UYOrui5EvJawWWsDOFIo0XWoh4c8FNT-PRC1Oa1aSUvSyoMw66uP1S5SjzQmeQcj9MD5clPxnCTHCpfhRyEXJ4TXQOINJiiiq1oX-lw$ This is the new CSF mailing list, which replaces the former list csf-attendees at mail-infsec.cs.uni-saarland.de. Please subscribe to the new list to not miss out on important information in the field of computer security foundations. ===================================================================== The Computer Security Foundations Symposium (CSF) is an annual conference for researchers in computer security. CSF seeks papers on foundational aspects of computer security, such as formal security models, relationships between security properties and defenses, principled techniques and tools for design and rigorous analysis of security mechanisms, as well as their application to practice. While CSF welcomes submissions beyond the topics listed below, the main focus of CSF is foundational security and privacy. Papers lacking foundational aspects risk desk rejection without further evaluation of their merits; contact the PC chairs when in doubt. Important Dates: Spring cycle paper submission May 13, 2022 Spring cycle author notification July 15, 2022 Fall cycle paper submission September 30, 2022 Fall cycle author notification December 2, 2022 *Winter cycle paper submission February 3, 2023* Winter cycle author notification April 7, 2023 CSF Symposium July 10-14, 2023 TOPICS New results in security and privacy are welcome. We also encourage challenge/vision papers, which may describe open questions and raise fundamental concerns about security and privacy. Possible topics for all papers include, but are not limited to: - access control - accountability - anonymity - attack models - authentication - blockchains and smart contracts - cloud security - cryptography - data provenance - data and system integrity - database security - decidability and complexity - decision theory - distributed systems security - electronic voting - embedded systems security - forensics - formal methods and verification - hardware-based security - information flow control - intrusion detection - language-based security - mobile security - network security - privacy - security and privacy aspects of machine learning - security and privacy for the Internet of Things - security architecture - security metrics - security policies - security protocols - software security - socio-technical security - trust management - usable security - web security SYSTEMATIZATION OF KNOWLEDGE PAPERS CSF'23 solicits systematization of knowledge (SoK) papers in foundational security and privacy research. These papers systematize, re-formulate, or evaluate existing work in one established and significant research topic. Such papers must provide new insights. Survey papers without new insights are not appropriate. Papers trying to identify robust foundations of research areas still lacking them are particularly welcome. Submissions will be distinguished by the prefix ?SoK:? in the title and a checkbox on the submission form. SPECIAL SESSIONS This year, we strongly encourage papers in three foundational areas of research we would like to promote at CSF by means of special sessions. Special sessions serve to identify selected research topics of particular interest to the community. Papers submitted to special sessions are expected to comply with the same requirements as other papers. This year, we have the following special sessions: BLOCKCHAIN AND SMART CONTRACTS (Session Chairs: Matteo Maffei and Andrea Marin). Many challenges arise with the rapid development of the blockchain technology and its main application: smart contract. The need for formal foundations for the security and privacy of blockchains and smart contracts. We invite submissions on foundational work in this area. Topics include security and privacy issues, analysis and verification of existing solutions, design of new systems, broader foundational issues such as how blockchain mechanisms fit into larger distributed ecosystems and foundational security aspects of applications built on top of blockchain mechanisms, new programming languages for smart contracts, and formal analysis of smart contracts. QUANTITATIVE METHODS FOR SECURITY (Session Chairs: Mario Alvim and Catuscia Palamidessi). Security and privacy systems often present aspects that can be better understood and formalized by means of quantitative notions. For example, several protocols for controlling the information leakage use randomized techniques to protect the secret, and their properties can be elegantly captured using information theory. Similarly, mechanisms for differential privacy protect individual data by adding random noise to the result of a query, and the properties are expressed in terms of likelihoods. We invite submission in this area. Topics include, but are not limited to, quantitative information flow, metrics for security, trust and privacy, differential privacy, and methods for the analysis and verification of quantitative properties. This special session is dedicated to the memory of our colleague Geoffrey Smith, whose scientific contributions to the field of quantitative methods for security are numerous and fundamental. Geoffrey passed away in 2021, but his brilliant mind, his intellectual honesty, and his gentleness remain an inspiration to us all. CRYPTOGRAPHY (Session Chairs: Pascal Reisert and Peter Schwabe). Cryptography is at the heart of many security- and privacy-critical systems. As such it is an integral part of the field of security and privacy. While modern cryptography is built on firm theoretical foundations, new applications frequently need new cryptographic solutions, new security definitions, models, and proof techniques and tools. We invite submissions in this area. Topics include, but are not limited to, the design and analysis of cryptographic protocols, new cryptographic frameworks and proof techniques, including composability as well as automated, tool-supported analysis and verification of cryptographic primitives and protocols. These papers will be reviewed under the supervision of the special session chairs. They will be presented at the conference, and will appear in the CSF proceedings, without any distinction from the other papers. See the conference website https://urldefense.com/v3/__https://www.ieee-security.org/TC/CSF2023/__;!!IBzWLUs!V6fyDijM3j7UYOrui5EvJawWWsDOFIo0XWoh4c8FNT-PRC1Oa1aSUvSyoMw66uP1S5SjzQmeQcj9MD5clPxnCTHCpfhRyEXJ4TXQOINJiihYI4_z5A$ for further information. From aravara at fct.unl.pt Wed Dec 21 13:08:09 2022 From: aravara at fct.unl.pt (Antonio Ravara) Date: Wed, 21 Dec 2022 18:08:09 +0000 Subject: [TYPES/announce] FORTE'23 first CfP Message-ID: <716869fb-4183-0d9e-a8db-3377daf176e5@fct.unl.pt> FORTE 2023 - 43nd International Conference on Formal Techniques for Distributed Objects, Components, and Systems June 19-23, 2023. Lisbon, Portugal Website: https://urldefense.com/v3/__http://www.discotec.org/2023/forte.html__;!!IBzWLUs!RCjQTTq-A6eK_UaztrJSrcwV4dDCYgpDYZzoXrSHpIJ6wgOFHWt4reUNToSYjbvevvgGZyJYqJzp_jytO_mEVbxqlE4tjJfRgw$ FORTE 2023 is one of the three conferences of DisCoTec 2023, the 18th International Federated Conference on Distributed Computing Techniques. https://urldefense.com/v3/__http://www.discotec.org/2023/__;!!IBzWLUs!RCjQTTq-A6eK_UaztrJSrcwV4dDCYgpDYZzoXrSHpIJ6wgOFHWt4reUNToSYjbvevvgGZyJYqJzp_jytO_mEVbxqlE5czmfndg$ Highlights ---------- * Main focus: fundamental research on developing distributed software systems, with emphasis on approaches to formally model, soundly implement, and rigorously validate such systems and applications. * Invited speaker: Azalea Raad (Imperial College London, UK) * Special issue in top journal with selected papers * Constructive and thorough reviews (at least 3) Submission Link: easychair.org/conferences/?conf=forte2023 ----------------------------------------------------------- We invite submissions focused on foundational aspects of distributed software systems, presenting approaches or tools to formally model, soundly implement, and rigorously validate these demanding but ever more necessary systems and applications. As our dependency on such software systems grow, also our responsibility as researchers grows to provide both trustworthy and usable solutions. The main topics of interest include: * Language concepts for concurrency and distribution, supported by rigorous semantics, well-supported pragmatics, and/or expressive illustrative use-cases. * Analyses techniques, methodologies, and/or algorithms, using testing and/or verification, to validate (aspects of) the soundness of various types of concurrent and distributed systems, including communication and network protocols, service-oriented systems, adaptive distributed systems, cyber-physical systems and sensor networks. * Principles for qualitative and quantitative security analysis of distributed systems. * Applications of formal methods and techniques for studying the quality, reliability, availability, and safety of concrete distributed systems. We are specially interested in "real-life" case studies and industrial applications involving real distributed systems. * Emerging challenges and hot topics in distributed systems (broadly construed), such as software-defined networks, distributed ledgers, smart contracts, and blockchain technologies, etc. Categories of papers -------------------- All papers should be submitted in LNCS format. We solicit papers in the following categories: * Regular papers (7-15 pages, not counting references): describing thorough and complete research results and experience reports. Regular papers may be combined with an artefact submission. Companion artefacts to regular submissions will be reviewed by the Artefact Evaluation Committee, but the acceptance of the paper is decoupled from the acceptance of the artefact (does not depend on it). The acceptance of the artefact, however, is conditional to the acceptance of the paper. * Tool papers (7-15 pages, not counting references): describing technological artefacts in the scope of the research topics of FORTE. The paper should present the underlying theory of the tool, a clear account of the tool?s functionality and limitations, and include case studies (with rigorous experimental evaluation). In addition, the tool artefact must be submitted separately for evaluation. Acceptance of the tool artefact is mandatory for tool papers to be accepted. The artefact will be evaluated by a dedicated committee. The paper must contain a link to a publicly downloadable MPEG-4 demo video of at most 10 minutes, to be submitted until a week after the paper submission deadline. * Short papers (4-6 pages, not counting references): describing innovative and promising ideas, possibly in an early form, or demonstrating new tools (components), or presenting (i) calls to action, or (ii) substantiated reflections on current and/or future research perspectives related to FORTE, or a summary of a published journal paper clarifying why the presentation would enrich the program of FORTE. Partial Rebuttal ------------ Some papers that raised doubts the reviewers would like to clarify to consider acceptance, will have 48h to respond to concrete questions. The responses will be taken into account during the PC discussions. Important dates (AoE) --------------------- * Abstract submission: February 11, 2023 * Paper submission: February 18, 2023 * Artefact and video submission: February 25, 2023 * Rebuttal period: March 23 and 24 * Paper and artefact notification: March 31, 2023 * Camera-ready: April 30, 2023 Proceedings ----------- The conference proceedings, formed by accepted submissions from *any* category, will be published by Springer as an LNCS-IFIP volume. Program Committee chairs ------------------------ Marieke Huisman (University of Twente, Netherlands) Ant?nio Ravara (NOVA University Lisbon, Portugal) Program Committee ----------------- Elvira Albert (Universidad Complutense de Madrid, Spain) Jiri Barnat (Masaryk University, Czech Republic) Georgiana Caltais (University of Twente, Netherlands) Silvia Crafa (Universit? di Padova, Italy) Mariangiola Dezani-Ciancaglini (Universit? di Torino, Italy) Adrian Francalanza (University of Malta, Malta) Hongfei Fu (Shanghai Jiao Tong University, China) Fatemeh Ghassemi (University of Tehran, Iran) Helle Hvid Hansen (University of Groningen, Netherlands) Sung-Shik Jongmans (Open University of the Netherlands; Centrum Wiskunde & Informatica, Netherlands) Jan Kofron (Charles University, Czech Republic) Alfons Laarman (Leiden University, Netherlands) Claudio Antares Mezzina (Universit? di Urbino, Italy) Mohammadreza Mousavi (King's College London, UK) Daniele Nantes-Sobrinho (Universidade de Bras?lia, Brasil) Luca Padovani (Universit? di Camerino, Italy) Kirstin Peters (Universit?t Augsburg, Germany) Anna Philippou (University of Cyprus, Cyprus) Anne Remke (WWU M?nster, Germany) Vasco T. Vasconcelos (LaSiGE and Dept. of Informatics, Faculty of Sciences, University of Lisbon, Portugal) Rob van Glabbeek (Data61 - CSIRO, Australia) Yuting Wang (Shanghai Jiao Tong University, China) Artefact Evaluation Committee chairs ------------------------------------ M?rio Pereira (NOVA University Lisbon, Portugal) Tom van Dijk (University of Twente) Artefact Evaluation Committee ----------------------------- TBA From bennovdberg at gmail.com Wed Dec 21 13:48:41 2022 From: bennovdberg at gmail.com (Benno van den Berg) Date: Wed, 21 Dec 2022 19:48:41 +0100 Subject: [TYPES/announce] Two open position at the ILLC, University of Amsterdam Message-ID: [APOLOGIES FOR MULTIPLE POSTING] Dear all, Please find below a vacancy that might be of interest to you. Best wishes, Benno ======= *Two Assistant Professors in Mathematical and Computational Logic* The *Institute for Logic, Language and Computation * (ILLC) at the University of Amsterdam (UvA) is seeking to hire two new faculty members in the area of *Mathematical and Computational Logic*. These appointments are envisaged at the assistant professor level, but, in the case of an exceptionally strong candidate, one of the appointments could be made at the associate professor level. The closing date for applications is January 22, 2023. For more information, see https://urldefense.com/v3/__https://vacatures.uva.nl/UvA/job/Two-Assistant-Professors-in-Mathematical-and-Computational-Logic/761212602/__;!!IBzWLUs!VXbodyhRpeErdukq5Pfs7rOIVA_ItIpgWzoW7udXpM3jbc7FCjyHlUH-ZIoeu9l61tiC3KBxL2lQdIkl48EsFDL-JuI4Mhy6FRc$ -------------- next part -------------- An HTML attachment was scrubbed... URL: From bcpierce at cis.upenn.edu Mon Dec 26 17:00:00 2022 From: bcpierce at cis.upenn.edu (Benjamin Pierce) Date: Mon, 26 Dec 2022 17:00:00 -0500 Subject: [TYPES/announce] CoqPL 2023, final program Message-ID: CoqPL 2023 9th International Workshop on Coq for Programming Languages Saturday, January 21, 2023, co-located with POPL The final CoqPL'23 program is now available . This year's edition of CoqPL will consist of seven contributed talks and one invited talk. *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 Talk* - *Omnisemantics: Smooth Handling of Nondeterminism* (Samuel Gruetter, MIT) *Contributed Talks* - *Pyrosome: A Framework for Modular, Extensible, Equivalence-Preserving Compilation* (Dustin Jamner, Gabriel Kammer, and Adam Chlipala MIT) - *Verified Differential Privacy for Finite Computers* (Vivien Rindisbacher, Arthur Azevedo de Amorim, and Marco Gaboardi, Boston University) - *Integrating graphical proofs in Coq* (Pablo Donato, Ecole polytechnique, Benjamin Werner LIX, IPP, and Kaustuv Chaudhuri, INRIA & LIX, IPP) - *Interactive Theorem Proving in Logic Education?A Coq Formalization of ZFC Set Theory for Discrete Mathematics Teaching* (Xinyi Wan Shanghai and Qinxiang Cao, Shanghai Jiao Tong University) - *Formalizing Monoidal Categories and Actions for Syntax with Binders* (Benedikt Ahrens, TU Delft, Ralph Matthes IRIT, CNRS, and Univ. of Toulouse, and Kobe Wullaert, TU Delft) - *Certifying Complexity Analysis* (Cl?ment Aubert, Augusta University, Thomas Rubiano LIPN, and Thomas Seiller, CNRS) - *Towards Formally Verified Path ORAM in Coq* (Hannah Leung, Talia Ringer, and Christopher W. Fletcher, University of Illinois Urbana-Champaign) *Program Committee* - Danil Annenkov, Aarhus University, Denmark - Qinxiang Cao, Shanghai Jiao Tong University, China - Tej Chajed, VMware Research and University of Wisconsin, USA (co-chair) - Maxime Denes, INRIA, France - Hugo Herbelin, INRIA, France - Benjamin C. Pierce, University of Pennsylvania, USA (co-chair) - Clement Pit-Claudel, EPFL, Switzerland - Talia Ringer, University of Illinois, USA - Christine Rizkallah, University of Melbourne, Australia - Zoe Paraskevopoulou, Northeastern University, USA -------------- next part -------------- An HTML attachment was scrubbed... URL: From paolo.pistone at uniroma3.it Tue Dec 27 05:17:55 2022 From: paolo.pistone at uniroma3.it (Paolo Pistone) Date: Tue, 27 Dec 2022 10:17:55 +0000 Subject: [TYPES/announce] Final CfPart: FoPSS 2023 (February 2023, Bertinoro, Italy) In-Reply-To: References: Message-ID: *Apologies for cross postings* Final Call For Participation: 4th edition of the School on Foundations of Programming and Software Systems (FoPSS 2023) February 13-17, 2023, Bertinoro, Italy. https://urldefense.com/v3/__https://site.unibo.it/fopss2023/en__;!!IBzWLUs!QU0qA15XoP7_8RfR7O57imgNbK2j9a449PDZFEBAF4Pw6mDeRBas6j8W6gc9L5h9ApwetGB-lgXCp38R0p3lcWDv49P96ZQNAn8ASlB8zA$ The 4th edition of the School on Foundations of Programming and Software Systems will be held in Bertinoro on February 13-17, 2023. This will be the first edition of the school after the beginning of the COVID pandemic. The previous editions of the school took place in Porto [1], Oxford [2], and Warsaw [3]. The school is oriented to Master and PhD students, and to young scholars. It will be held at CEUB [4], which can be reached from Bologna in about 90 minutes. (We are considering to organize bus transfers to and from Bologna Airport on February 12 and 18, 2023). The main theme of this edition of FoPSS are the quantitative aspects of program semantics, verification, and transformation. The following researchers have accepted to give short courses or seminars as part of the school: Deepak Garg (MPI-SWS), on "Resource Analysis Using Types" Marco Gaboardi (Boston University), on "Relational Reasoning for Security and Privacy" Benjamin Kaminski (Saarland University), on "Quantitative Verification, Transformer-style" Delia Kesner (Universit? de Paris), on "Quantitative Types for Higher-Order Programming Languages" Aleks Kissinger (Oxford), on "Picturing Quantum Software" Damiano Mazza (CNRS), on "Introduction to Differentiable Programming" Prakash Panangaden (McGill), on "Bisimulation Metrics and Variations with Applications to Representation Learning" Christin Tasson (Sorbonne Universit?), on "Probabilistic Program Semantics" Valeria Vignudelli (CNRS), on "Equational Theories for Probabilistic Effects" A limited number of places is still available and we encourage those interested in participating to the school to register at the link https://urldefense.com/v3/__https://www.ceub.it/events/event/fopss-2023/__;!!IBzWLUs!QU0qA15XoP7_8RfR7O57imgNbK2j9a449PDZFEBAF4Pw6mDeRBas6j8W6gc9L5h9ApwetGB-lgXCp38R0p3lcWDv49P96ZQNAn93be_EhQ$ *by January 20, 2023*. Registration will cover participation to the school and accommodation at CEUB with half board. We would be happy to answer any question about the organization of the school. Just send us an email! Looking forward to seeing you in Bertinoro. Best Regards, Ugo Dal Lago, Francesco Gavazzo, Paolo Pistone. [1] https://urldefense.com/v3/__https://probprogschool2017.di.uminho.pt/__;!!IBzWLUs!QU0qA15XoP7_8RfR7O57imgNbK2j9a449PDZFEBAF4Pw6mDeRBas6j8W6gc9L5h9ApwetGB-lgXCp38R0p3lcWDv49P96ZQNAn_JjWOAAA$ [2] https://urldefense.com/v3/__https://www.floc2018.org/fopss/__;!!IBzWLUs!QU0qA15XoP7_8RfR7O57imgNbK2j9a449PDZFEBAF4Pw6mDeRBas6j8W6gc9L5h9ApwetGB-lgXCp38R0p3lcWDv49P96ZQNAn_n9zhkDg$ [3] https://urldefense.com/v3/__https://www.mimuw.edu.pl/*fopss19/__;fg!!IBzWLUs!QU0qA15XoP7_8RfR7O57imgNbK2j9a449PDZFEBAF4Pw6mDeRBas6j8W6gc9L5h9ApwetGB-lgXCp38R0p3lcWDv49P96ZQNAn8zXY-mhQ$ [4] https://urldefense.com/v3/__https://www.ceub.it/?lang=en__;!!IBzWLUs!QU0qA15XoP7_8RfR7O57imgNbK2j9a449PDZFEBAF4Pw6mDeRBas6j8W6gc9L5h9ApwetGB-lgXCp38R0p3lcWDv49P96ZQNAn9EoqqTgw$ ________________________________ Da: Paolo Pistone Inviato: luned? 24 ottobre 2022 10:37 Oggetto: CfPart: FoPSS 2023 (February 2023, Bertinoro, Italy) *Apologies for cross postings* Call For Participation: 4th edition of the School on Foundations of Programming and Software Systems (FoPSS 2023) February 13-17, 2023, Bertinoro, Italy. https://urldefense.com/v3/__https://site.unibo.it/fopss2023/en__;!!IBzWLUs!QU0qA15XoP7_8RfR7O57imgNbK2j9a449PDZFEBAF4Pw6mDeRBas6j8W6gc9L5h9ApwetGB-lgXCp38R0p3lcWDv49P96ZQNAn8ASlB8zA$ We are very pleased to announce the 4th edition of the School on Foundations of Programming and Software Systems, to be held in Bertinoro on February 13-17, 2023. This will be the first edition of the school after the beginning of the COVID pandemic. The previous editions of the school took place in Porto [1], Oxford [2], and Warsaw [3]. The school is oriented to Master and PhD students, and to young scholars. It will be held at CEUB [4], which can be reached from Bologna in about 90 minutes. (We are considering, depending on the number of participants, to organize bus transfers to and from Bologna Airport on February 12 and 18, 2023). The main theme of this edition of FoPSS are the quantitative aspects of program semantics, verification, and transformation. The following researchers have accepted to give short courses or seminars as part of the school: Deepak Garg (MPI-SWS), on "Resource Analysis Using Types" Marco Gaboardi (Boston University), on "Relational Reasoning for Security and Privacy" Benjamin Kaminski (Saarland University), on "Quantitative Verification, Transformer-style" Delia Kesner (Universit? de Paris), on "Quantitative Types for Higher-Order Programming Languages" Aleks Kissinger (Oxford), on "Picturing Quantum Software" Damiano Mazza (CNRS), on "Introduction to Differentiable Programming" Prakash Panangaden (McGill), on "Bisimulation Metrics and Variations with Applications to Representation Learning" Christin Tasson (Sorbonne Universit?), on "Probabilistic Program Semantics" Valeria Vignudelli (CNRS), on "Equational Theories for Probabilistic Effects" Registration will cover participation to the school and accommodation at CEUB with half board. Thanks to the help of sponsors (including ETAPS, SIGLOG, SIGPLAN, the University of Bologna, and the DIAPASoN Project), we plan to keep the registration fee as low as possible. The reception capacity of the CEUB is big, but subject to limits. We therefore encourage those interested in participating to the school to pre-register by following the link below [5] and fill the form *by October 31, 2022*. This we will help us keep track of the numbers. We would be happy to answer any questions about the organization of the school. Just send us an email! Looking forward to seeing you in Bertinoro. Best Regards, Ugo Dal Lago, Francesco Gavazzo, Paolo Pistone. [1] https://urldefense.com/v3/__https://probprogschool2017.di.uminho.pt/__;!!IBzWLUs!QU0qA15XoP7_8RfR7O57imgNbK2j9a449PDZFEBAF4Pw6mDeRBas6j8W6gc9L5h9ApwetGB-lgXCp38R0p3lcWDv49P96ZQNAn_JjWOAAA$ [2] https://urldefense.com/v3/__https://www.floc2018.org/fopss/__;!!IBzWLUs!QU0qA15XoP7_8RfR7O57imgNbK2j9a449PDZFEBAF4Pw6mDeRBas6j8W6gc9L5h9ApwetGB-lgXCp38R0p3lcWDv49P96ZQNAn_n9zhkDg$ [3] https://urldefense.com/v3/__https://www.mimuw.edu.pl/*fopss19/__;fg!!IBzWLUs!QU0qA15XoP7_8RfR7O57imgNbK2j9a449PDZFEBAF4Pw6mDeRBas6j8W6gc9L5h9ApwetGB-lgXCp38R0p3lcWDv49P96ZQNAn8zXY-mhQ$ [4] https://urldefense.com/v3/__https://www.ceub.it/?lang=en__;!!IBzWLUs!QU0qA15XoP7_8RfR7O57imgNbK2j9a449PDZFEBAF4Pw6mDeRBas6j8W6gc9L5h9ApwetGB-lgXCp38R0p3lcWDv49P96ZQNAn9EoqqTgw$ [5] https://urldefense.com/v3/__https://forms.gle/Z5sinvogkApZrgqaA__;!!IBzWLUs!QU0qA15XoP7_8RfR7O57imgNbK2j9a449PDZFEBAF4Pw6mDeRBas6j8W6gc9L5h9ApwetGB-lgXCp38R0p3lcWDv49P96ZQNAn9PbOcobg$ -------------- next part -------------- An HTML attachment was scrubbed... URL: From sproston at di.unito.it Fri Dec 23 17:00:44 2022 From: sproston at di.unito.it (Jeremy Sproston) Date: Fri, 23 Dec 2022 23:00:44 +0100 Subject: [TYPES/announce] FORMATS 2023 first call for papers Message-ID: FORMATS 2023: call for papers 21st International Conference on Formal Modeling and Analysis of Timed Systems https://urldefense.com/v3/__https://www.uantwerpen.be/en/conferences/confest-2023/formats/__;!!IBzWLUs!XFQLseC7K1Ej2OYHIDjyEmEEw1Qryqndqemk08-lS8PSJCeAV08u8KqGNDI5Xu6bEIITJiiwPN6LQQkpGTCrbiCDFGww0-V5pp8$ 19-21 September 2023, Antwerp, Belgium co-located with CONCUR, FMICS and QEST as part of CONFEST 2023 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). This year, FORMATS will incorporate a special track on: - Monitoring of cyber-physical systems. We encourage the submission of papers on all approaches related to the monitoring of cyber-physical systems, including monitoring methods, monitoring applications (such as robustness-guided falsification), and related techniques (such as validation of a formal specification for monitoring). INVITED SPEAKERS FORMATS 2023 will feature the following invited speakers: - Joost-Pieter Katoen, RWTH Aachen University, Germany (joint with all CONFEST conferences) - Nicolas Markey, CNRS & University of Rennes, France (joint with CONCUR) - David Parker, Oxford University, UK (joint with QEST, CONCUR) - Jaco van de Pol, Aarhus University, Denmark (joint with CONCUR, FMICS) PAPER SUBMISSION FORMATS 2023 solicits high-quality papers describing 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. FORMATS 2023 has two categories of papers: - 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=formats2023__;!!IBzWLUs!XFQLseC7K1Ej2OYHIDjyEmEEw1Qryqndqemk08-lS8PSJCeAV08u8KqGNDI5Xu6bEIITJiiwPN6LQQkpGTCrbiCDFGwwJycvNl0$ ARTIFACT EVALUATION FORMATS encourages 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 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 paper. PUBLICATION AND BEST PAPER AWARD The proceedings of FORMATS 2023 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: 21 April 2023 - Paper submission: 28 April 2023 - Acceptance notification: 16 June 2023 - Camera-ready deadline: 14 July 2023 - Conference: 19-21 September 2023 ??For any questions, feel free to contact the program chairs Laure Petrucci (Laure.Petrucci at lipn.univ-paris13.fr) and Jeremy Sproston (sproston at di.unito.it). ORGANISATION Program Chairs - Laure Petrucci (France) - Jeremy Sproston (Italy) Artifact Evaluation Chairs - Arnd Hartmanns (The Netherlands) - Paolo Zuliani (UK) Special Track Chair - Masaki Waga (Japan) Program Committee - Parosh Aziz Abdulla, Uppsala University, Sweden - Marcello M. Bersani, Politecnico di Milano, Italy - Patricia Bouyer-Decitre, CNRS & ENS Paris-Saclay, France - Pedro R. D'Argenio, National University of C?rdoba, Argentina - Jyotirmoy Deshmukh, University of Southern California, USA - Catalin Dima, University Paris-Est Cr?teil, France - Miriam Garc?a Soto, Complutense University of Madrid, Spain - Gilles Geeraerts, Universit? Libre de Bruxelles, Belgium - Taylor T. Johnson, Vanderbilt University, USA - Jan K?et?nsk?, Technical University of Munich, Germany - Engel Lefaucheux, INRIA Nancy & LORIA, Universit? de Lorraine, France - Jun Liu, University of Waterloo, Canada - Manuel Mazo Jr, Delft University of Technology, The Netherlands - Benjamin Monmege, Aix-Marseille Universit?, France - Dejan Ni?kovi?, Austrian Institute of Technology, Austria - Nicola Paoletti, King's College London, UK - Laure Petrucci, University Sorbonne Paris Nord & CNRS, France (chair) - Krishna S., IIT Bombay, India - Ocan Sankur, CNRS & Rennes University, France - Sadegh Soudjani, Newcastle University, UK - Jeremy Sproston, University of Turin, Italy (chair) - Jiri Srba, Aalborg University, Denmark - B. Srivathsan, Chennai Mathematical Institute, India - Natalie Sznajder, Sorbonne Universit? & CNRS, France - Patrick Totzke, University of Liverpool, UK - Stavros Tripakis, Northeastern University, USA - Enrico Vicario, University of Florence, Italy - Masaki Waga, Kyoto University, Japan - Naijun Zhan, Chinese Academy of Sciences, 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 harshbeohar at gmail.com Fri Dec 30 05:20:02 2022 From: harshbeohar at gmail.com (Harsh Beohar) Date: Fri, 30 Dec 2022 10:20:02 +0000 Subject: [TYPES/announce] A fully funded postdoc position in "Quantitative Verification of Software Families based on Coalgebraic Modal Logic and Games" Message-ID: Applications are invited for a fully funded postdoc/research associate post in Computer Science at the University of Sheffield. Job Reference Number: UOS035797 Job Title: Research Associate in Quantitative Verification Contract Type: Fixed term until 30.11.2024 Faculty: Faculty of Engineering Department: Department of Computer Science Salary: Grade 7 ?35,333 per annum Closing Date: 4th February 2023 The post is supported by the EPSRC funded project ?Quantitative verification of software families based on coalgebraic modal logic and games? (EP/X019373/1) headed by the PI Dr. Harsh Beohar. For any queries, please do not hesitate to contact me at h.beohar at sheffield.ac.uk; for a more detailed advertisement, please visit the department website (https://urldefense.com/v3/__https://www.sheffield.ac.uk/dcs/about/jobs__;!!IBzWLUs!Qe2HVMtT7HhGJuGFfSGln3uy2mZ0aUMbeiQ_MC-ZvUhFoOOKeqrC4dBGYUcWv4vxkL94ZvTw55v_Sj_MouN5j3Q6E2NijJ0Ez84$ ) and search using the reference number: UOS035797. -------------- next part -------------- An HTML attachment was scrubbed... URL: