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

Structure meets Power 2022: deadline soon
by Anuj Dawar 14 May '22

14 May '22

**************************************** * STRUCTURE MEETS POWER 2022 * * (an ICALP workshop) * * * * Call for Contributions * **************************************** Workshop dates: 4 July 2022 (Paris and online) https://www.cst.cam.ac.uk/conference/structure-meets-power-2022 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://easychair.org/conferences/?conf=smp2022 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://www.cst.cam.ac.uk/conference/structure-meets-power-2022/registratio… For on-site participation one must fill in the ICALP registration form: https://icalp2022.dakini-pco.com/ 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

1 0

ACKERMANN AWARD 2022: 2ND CALL FOR NOMINATIONS
by EACSL Mail-Account 13 May '22

13 May '22

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(a)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(a)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(a)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.

1 0

Third CFP: LogTeach-22 (plain text)
by Johann Makowsky 13 May '22

13 May '22

******************************************************************* LogTeach-22: Why and how to tech Logic for CS undergraduates? ******************************************************************* html version attached ===================== Third Call for papers ===================== https://www.cs.technion.ac.il/~janos/LogTeach-22/ https://easychair.org/cfp/LogTeach-22 NEW: This is an in-person meeting. People who want to contribute, but cannot attend, are encouraged to submit a short position paper. If accepted by the PC these papers will be integrated into the panel discussion planned for the workshop. If any form of post-workshop publication will be planned, their authors will be contacted in order to contribute. LogTeach-22: LICS 2022 Workshop (July 31 and August 1, 2022, Haifa) Why and how to tech Logic for CS undergraduates? Scientific justification ------------------------- Logic is one of the pillars of the foundation of Computer Science, together with Algorithmic Mathematics, Information Theory, and Electronics. Consequently various versions of Logic courses used to be part of the undergraduate syllabus of Computer Science. However, as witnessed by the variety of conferences related to Logic present at the FLoC event, the emphasis has moved from the foundation to applications of Logic in Computer Science. Each of these conferences deal with topics suitable for advanced undergraduate and graduate courses, which require some Logic based prerequisite. On the other hand, Logic courses in the undergraduate syllabus have been forced to make place for courses deemed more suitable for the education of future specialists and practitioners working in IT. Many of the top Universities worldwide have dropped foundational Logic courses for undergraduates for more practical oriented courses, turning undergraduate CS programs into programs more suitable for what used to be vocational colleges and professional schools. Time has come to critically reflect upon and reevaluate the role of Logic in the undergraduate syllabus. It seems clear that the classical Logic in CS courses have no place there anymore. They seem to teach and emphasize the wrong narrative of logic as taught by tradition. However, it seems also clear that eliminating Logic courses all together is counter productive. The purpose of the workshop is the prepare a proposal for a logic course Logic-2020 which is useful and acceptable for University undergraduates in CS, and which can serve as a prerequisite for the many diverse branches of applied logic. "Logic may be not very useful, if you know it, but very harmful, if you ignore it" (Georg Kreisel) Invited speakers ---------------- + confirmed, * tentative + Moshe Vardi (Rice University, Houston TA, USA) + Matthias Baaz (Technical University, Vienna, Austria) + Reinhold Kahle (Universität Tübingen, Tübingen, Germany) + Arnon Avron (TA University, Tel Aviv, Israel) + Martin Davis (Courant Institute, New York, USA) + Thomas Zeume (Ruhr Universität Bochum, Germany) + Edward Hirsch (Steklov Institute, St. Petersburg, visiting Technion, Haifa) ---------------------------------------------------------------------------------- * Georg Gottlob (Oxford University, Oxford, Great Britain) * Samson Abramsky (Oxford University, Oxford, Great Britain) * Jeremy Avigad (Carnegy Mellon University, Pittsburgh PA, USA) To be completed Organisation ------------- The purpose of the workshop is to prepare a joint position paper to be published possibly in the Communications of ACM, or a similar prominent place, with recommendations for the future of teaching Logic for undergraduate CS-students. We plan to have presentations of position papers (30 minutes, including discussion) and invited lectures (60 minutes including discussion), followed by a two hour panel discussion. Workshop organizers and Program Committee ------------------------------------------ J.A. Makowsky (Technion, Haifa, Israel) E.V. Ravve (ORT Braude, Karmiel, Israel) S.N. Artemov (CUNY, New York, USA) S. Szeider (Technical University, Vienna, Austria) Dates and Location ------------------ FLOC is planned to be a conference with physical presence in Haifa. People who cannot attend are encouraged to submit position papers, see at the beginning of this call for submissions. * Submission link https://easychair.org/conferences/?conf=logteach22 * Deadline for submission of contributions : 30. May, 2022 (NEW) * Notification of acceptance: 20. June, 2022

1 0

Third CFP LogTeach-22
by Johann Makowsky 13 May '22

13 May '22

<head> Why and how to tech Logic for CS undergraduates? </head> <title> LogTeach-22: Why and how to teach Logic for CS undergraduates? </title> <H2> Third Call for Papers </H2> <a href=" https://www.cs.technion.ac.il/~janos/LogTeach-22/ "> https://www.cs.technion.ac.il/~janos/LogTeach-22/ </a> <BR> <a href=" https://easychair.org/cfp/LogTeach-22 "> https://easychair.org/cfp/LogTeach-22 </a> <BR> Last updated: May 13, 2022 <H2> LogTeach-22: LICS 2022 Workshop (July 31 and August 1, 2022, Haifa) <P> Why and how to teach Logic for CS undergraduates? </H2> <h2> NEW </h2> This is an in-person meeting. <BR> People who want to contribue, but cannot attend, care <B>encouraged to submit a short position paper </B>. <BR> If accepted by the PC these papers will be integrated into the panel discussion planned for the workshop. <BR> If any form of post-workshop publication will be planned, their authors will be contacted in order to contribute. <H2> Scientific justification </H2> Logic is one of the pillars of the foundation of Computer Science, together with Algorithmic Mathematics, Information Theory, and Electronics. Consequently various versions of Logic courses used to be part of the undergraduate syllabus of Computer Science. However, as witnessed by the variety of conferences related to Logic present at the FLoC event, the emphasis has moved from the foundation to applications of Logic in Computer Science. Each of these conferences deal with topics suitable for advanced undergraduate and graduate courses, which require some Logic based prerequisite. On the other hand, Logic courses in the undergraduate syllabus have been forced to make place for courses deemed more suitable for the education of future specialists and practitioners working in IT. Many of the top Universities worldwide have dropped foundational Logic courses for undergraduates for more practical oriented courses, turning undergraduate CS programs into programs more suitable for what used to be vocational colleges and professional schools. <P> Time has come to critically reflect upon and reevaluate the role of Logic in the undergraduate syllabus.It seems clear that the classical Logic in CS courses have no place there anymore. They seem to teach and emphasize the wrong narrative of logic as taught by tradition. However, it seems also clear that eliminating Logic courses all together is counter productive. The purpose of the workshop is the prepare a proposal for a logic course Logic-2020 which is useful and acceptable for University undergraduates in CS, and which can serve as a prerequisite for the many diverse branches of applied logic. <P> "Logic may be not very useful, if you know it, but very harmful, if you ignore it" (Georg Kreisel) <H2> Organisation </H2> The purpose of the workshop is to prepare a joint position paper to be published possibly in the Communications of ACM, or a similar prominent place, with recommendations for the future of teaching Logic for undergraduate CS-students. We plan to have presentations of position papers (30 minutes, including discussion) and invited lectures (60 minutes including discussion), followed by a two hour panel discussion. <H2> Invited speakers </H2> + confirmed, * tentative <UL> <LI> + Moshe Vardi (Rice University, Houston TA, USA) <LI> + Matthias Baaz (Technical University, Vienna, Austria) <LI> + Reinhold Kahle (Universität Tübingen, Tübingen, Germany) <LI> + Arnon Avron (TA University, Tel Aviv, Israel) <LI> + Martin Davis (Courant Institute, New York, USA) <LI> + Thomas Zeume (Ruhr Universität Bochum, Germany) <LI> + Edward Hirsch (Steklov Institute, St. Petersburg, visiting Technion, Haifa) <HR> <LI> * Georg Gottlob (Oxford University, Oxford, Great Britain) <LI> * Samson Abramsky (Oxford University, Oxford, Great Britain) <LI> * Jeremy Avigad (Carnegy Mellon University, Pittsburgh PA, USA) </UL> To be completed <H2> Contributed talks </H2> We invite contributed talks, which can be 15 minute or 30 minutes (including discussion). <BR> This will serve as the basis for the planned panel discussion. <P> Contributers should submit a pdf-file of an abstract or summary of atmost 3 pages at <BR> <a href="https://easychair.org/cfp/LogTeach-22">https://easychair.org/cfp/LogTeach-22</a> till 30. May, 2022. <P> <B> Full papers may be additionally submitted only as a second submission besides the 3 page version. </B> <H2> Workshop organizers and Program Committee </H2> <UL> <LI> J.A. Makowsky (Technion, Haifa, Israel) <LI> E.V. Ravve (ORT Braude, Karmiel, Israel) <LI> S.N. Artemov (CUNY, New York, USA) <LI> S. Szeider (Technical University, Vienna, Austria) </UL> <H2> Dates and Location </H2> <B> FLOC is planned to be a conference with physical presence (possibly hybrid) in Haifa. </B> <BR> People who cannot attend are <B>encouraged</B> to submit position papers, see at the beginning of this call for submissions. <UL> <LI> Submission link: <a href=" https://easychair.org/conferences/?conf=logteach22 "> https://easychair.org/conferences/?conf=logteach22 </a> <LI> Deadline for submission of contributions : 30. May, 2022 (NEW) <LI> Notification of acceptance: 20. June, 2022 </UL>

1 0

ICALP 2022 - Call for Participation - Extended early registration
by Amaury Pouly (IRIF) 12 May '22

12 May '22

Highlights: - 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 conference programme is now available. The 49th 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://icalp2022.irif.fr/ Early Registration: May 18 Conference: July 4-8, 2022 Workshops: July 4 ============= Registration ============= For registration, follow this link: https://icalp2022.irif.fr/?page_id=50 ============= 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://icalp2022.irif.fr/?page_id=50 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://eatcs.org/index.php/eatcs-award), - the Gödel prize (https://eatcs.org/index.php/goedel-prize), - the Presburger award (https://eatcs.org/index.php/presburger), - the EATCS distinguished dissertation award (https://eatcs.org/index.php/dissertation-award), - the best papers for Track A and track B, - the best student papers for Track A and track B. ============= Accepted papers ============= See https://icalp2022.irif.fr/?page_id=85 ============= Workshops ============= See https://icalp2022.irif.fr/?page_id=46 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 ============= Programme ============= See https://icalp2022.irif.fr/wp-content/uploads/2022/05/icalp2022programme.pdf or below. # Tuesday 8h30-9h30. Invited speaker 1 * Santosh Vempala _The Manifold Joys of Sampling in High Dimension_ # Tuesday 10h00-12h05. Paper session 1 ## Graph algorithms * Sebastian Forster, and Tijn de Vos _Faster Cut Sparsification of Weighted Graphs_ * Tianyi Zhang _Faster Cut-Equivalent Trees in Simple Graphs_ * Mingyang Deng, Yael Kirkpatrick, Victor Rong, Virginia Vassilevska Williams, and Ziqian Zhong _New Additive Approximations for Shortest Paths and Cycles_ * Caroline Brosse, Vincent Limouzy, and Arnaud Mary _Polynomial Delay Algorithm for Minimal Chordal Completions_ * Konrad Majewski, Tomáš Masařík, Jana Novotná, Karolina Okrasa, Marcin Pilipczuk, Paweł Rzążewski, and Marek Sokołowski _Max Weight Independent Set in Fraphs with no Long Claws: An Analog of the Gyárfás' Path Argument_ ## Games and verification * Léonard Brice, Jean-Francois Raskin, and Marie Van Den Bogaard _The complexity of SPEs in Mean-payoff Games_ * Benjamin Bordais, Damien Busatto-Gaston, Shibashis Guha, and Jean-Francois Raskin _Strategy Synthesis for Global Window PCTL_ * Hugo Gimbert, Corto Mascle, Anca Muscholl, and Igor Walukiewicz _Distributed Controller Synthesis for Deadlock Avoidance_ * Xavier Allamigeon, Stephane Gaubert, Ricardo D. Katz, and Mateusz Skomra _Universal Complexity Bounds Based on Value Iteration and Application to Entropy Games_ * Nathalie Bertrand, Nicolas Markey, Ocan Sankur, and Nicolas Waldburger _Parameterized Safety Verification of Round-based Shared-memory Systems_ ## Sketching and streaming * Aviad Rubinstein, and Junyao Zhao _Maximizing Non-Monotone Submodular Functions over Small Subsets: Beyond 1/2- Approximation_ * Moran Feldman, Paul Liu, Ashkan Norouzi-Fard, Ola Svensson, and Rico Zenklusen _Streaming Submodular Maximization under Matroid Constraints_ * Artur Czumaj, Shaofeng H.-C. Jiang, Robert Krauthgamer, and Pavel Veselý _Streaming Algorithms for Geometric Steiner Forest_ * Moses Charikar, and Erik Waingarten _Polylogarithmic Sketches for Clustering_ * Amit Deshpande, and Rameshwar Pratap _One-pass Additive-error Subset Selection for $\ell_{p}$ Subspace approximation_ ## Coding theory * Tal Yankovitz, and Gil Cohen _LCC and LDC: Tailor-made Distance Amplification and a Refined Separation_ * Nicolas Resch, and Chen Yuan _Threshold Rates of Code Ensembles: Linear is Best_ * Dean Doron, and Mary Wootters _High-Probability List-Recovery, and Applications to Heavy Hitters_ * Ittai Rubinstein _Explicit and Efficient Construction of (nearly) Optimal Rate Codes for the Binary Deletion Channel and the Poisson Repeat Channel_ * Zhenjian Lu, Igor Oliveira, and Marius Zimand _Optimal Coding Theorems in Time-Bounded Kolmogorov Complexity_ # Tuesday 14h00-15h00. Invited speaker 2 * Leslie Ann Goldberg _Some new (and old) Results on Contention Resolution_ # Tuesday 15h30-17h10. Paper session 2 ## Quantum * Chi-Ning Chou, Peter Love, Jonathan Shi, and Juspreet Singh Sandhu _Limitations of Local Quantum Algorithms on Random MAX-k-XOR and Beyond_ * Penghui Yao, Yitong Yin, and Xinyuan Zhang _Polynomial-Time Approximation of Zero-Free Partition Functions_ * Jaikumar Radhakrishnan, Shyam Dhamapurkar, and Shubham Pawar _Set Membership with Two Classical and Quantum Bit Probes_ * Sourav Chakraborty, Chandrima Kayal, and Manaswi Paraashar _Separations between Combinatorial Measures for Transitive Functions_ ## Computability and dynamic systems * Djamel Eddine Amir, and Mathieu Hoyrup _Computability of Finite Simplicial Complexes_ * Donald Stull _The Dimension Spectrum Conjecture for Planar Lines_ * Ville Salo, and Ilkka Törmä _What can Oracles Teach us about the Ultimate Fate of Life?_ * Jakob Piribauer, Ocan Sankur, and Christel Baier _The Variance-penalized Stochastic Shortest Path Problem_ ## Reconstruction problems * Josep Diaz, Varsha Dani, Cristopher Moore, and Thomas Hayes _Improved Reconstruction of Random Geometric Graphs_ * Andrew McGregor, and Rik Sengupta _Graph Reconstruction from Random Subgraphs_ * Akash Kumar, Anand Louis, and Rameesh Paul _Exact Recovery Algorithm for Planted Bipartite Graph in Semi-random Graphs_ * Guy Blanc, Jane Lange, and Li-Yang Tan _Reconstructing Decision Trees_ ## Game theory, networks, and distributed * William Kuszmaul, and Shyam Narayanan _Optimal Time-Backlog Tradeoffs for the Variable-Processor Cup Game_ * Aaron Berger, William Kuszmaul, Adam Polak, Jonathan Tidor, and Nicole Wein _Memoryless Worker-Task Assignment with Polylogarithmic Switching Cost_ * Stavros Ioannidis, Bart de Keijzer, and Carmine Ventre _Strong Approximations and Irrationality in Financial Networks with Derivatives_ * Tobias Friedrich, Hans Gawendowicz, Pascal Lenzner, and Anna Melnichenko _Social Distancing Network Creation_ # Tuesday 18h00-21h00. Cocktail and vernissage of the exhibition for the 50 years of EATCS / ICALP # Wednesday 8h30-9h30. Invited speaker 3 * Constantinos Daskalakis _Equilibrium Computation, Deep Learning, and Multi-Agent (Reinforcement) Learning_ # Wednesday 10h00-12h05. Paper session 3 ## Counting and sampling * Charilaos Efthymiou _On Sampling Symmetric Gibbs Distributions on Sparse Random Graphs and Hypergraphs._ * Ivona Bezakova, Andreas Galanis, Leslie Goldberg, and Daniel Stefankovic _Fast sampling via Spectral Independence beyond Bounded-degree Graphs_ * Amin Coja-Oghlan, Andreas Galanis, Leslie Ann Goldberg, Jean Bernoulli Ravelomanana, Daniel Stefankovic, and Eric Vigoda _Metastability of the Potts Ferromagnet on Random Regular Graphs_ * Andreas Galanis, Daniel Stefankovic, and Eric Vigoda _Approximating Observables is as Hard as Counting_ * Guoliang Qiu, Yanheng Wang, and Chihao Zhang _A Perfect Sampler for Hypergraph Independent Sets_ ## Tranducers and automata * Mika Göös, Stefan Kiefer, and Weiqiang Yuan _Lower Bounds for Unambiguous Automata via Communication Complexity_ * Antonio Casares, Thomas Colcombet, and Karoliina Lehtinen _On the Size of Good-for-games Rabin Automata and its Link with the Memory in Muller Games_ * Léo Exibard, Emmanuel Filiot, and Ayrat Khalimov _A Generic Solution to Register-bounded Synthesis With an Application to Discrete Orders_ * Leon Bohn, and Christof Löding _Passive Learning of Deterministic Büchi Automata by Combinations of DFAs_ * Moses Ganardi, Rupak Majumdar, Andreas Pavlogiannis, Lia Schütze, and Georg Zetzsche _Reachability in Bidirected Pushdown VASS_ ## Property testing * Arijit Ghosh, Gopinath Mishra, Rahul Raychaudhury, and Sayantan Sen _Tolerant Bipartiteness Testing in Dense Graphs_ * Louis Esperet, and Sergey Norin _Testability and Local Certification of Monotone Properties in Minor-closed Classes_ * Omri Ben-Eliezer, Shoham Letzter, and Erik Waingarten _Finding Monotone Patterns in Sublinear Time, Adaptively_ * Talya Eden, Dana Ron, and Will Rosenbaum _Almost Optimal Bounds for Sublinear-Time Sampling of $k$-Cliques in Bounded Arboricity Graphs_ * Karl Bringmann, Alejandro Cassis, Nick Fischer, and Vasileios Nakos _Improved Sublinear-Time Edit Distance for Preprocessed Strings_ ## Dynamic algorithms and sensitivity oracles * Josh Alman, and Dean Hirsch _Parameterized Sensitivity Oracles and Dynamic Algorithms using Exterior Algebras_ * Surender Baswana, Koustav Bhanja, and Abhyuday Pandey _Minimum+1 (s,t)-cuts and Dual Edge Sensitivity Oracle_ * Davide Bilò, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, and Martin Schirneck _Deterministic Sensitivity Oracles for Diameter, Eccentricities and All Pairs Distances_ * Aaron Bernstein, Jan van den Brand, Maximilian Probst, Danupon Nanongkai, Thatchaphol Saranurak, Aaron Sidford, and He Sun _Fully-Dynamic Graph Sparsifiers Against an Adaptive Adversary_ * Aleksander B. G. Christiansen, and Eva Rotenberg _Fully-dynamic α + 2 Arboricity Decomposition and Implicit Colouring._ # Wednesday 14h00-16h05. Best papers session * Joakim Blikstad _Sublinear-round Parallel Matroid Intersection_ * Jakub Tětek _Approximate Triangle Counting via Sampling and Fast Matrix Multiplication_ * Gaëtan Douéneau-Tabot _Hiding Pebbles when the Output Alphabet is Unary_ * Ilan Newman, and Nithin Varma _Strongly Sublinear Algorithms for Testing Pattern Freeness_ * Jakub Gajarský, Michał Pilipczuk, Wojciech Przybyszewski, and Szymon Toruńczyk _Twin-width and Types_ # Wednesday 16h45-17h30. EATCS Award 2022 * TBA _TBA_ # Wednesday 17h30-19h30. EATCS general assembly * _EATCS general assembly:\\ EATCS fellows, EATCS distinguished dissertation Award, Best Icalp papers, Best Icalp Student Papers_ # Thursday 8h30-9h30. Invited speaker 4 * Albert Atserias _Towards a Theory of Algorithmic Proof Complexity: Motivation and Directions_ # Thursday 10h00-12h05. Paper session 4 ## Computational Geometry * Arindam Khan, Aditya Lonkar, Arnab Maiti, Amatya Sharma, and Andreas Wiese _Tight Approximation Algorithms for Two-dimensional Guillotine Strip Packing_ * Fedor Fomin, Petr Golovach, Tanmay Inamdar, and Meirav Zehavi _(Re)packing Equal Disks into Rectangle_ * Ziyun Huang, and Jinhui Xu _In-Range Farthest Point Queries and Related Problem in High Dimensions_ * Jacobus Conradi, and Anne Driemel _On Computing the k-Shortcut Fréchet Distance_ * Klaus Jansen, Arindam Khan, Marvin Lira, and K. V. N. Sreenivas _A PTAS for Packing Hypercubes into a Knapsack_ ## Parameterized complexity * Ramanujan M. Sridharan, Daniel Lokshtanov, and Fahad Panolan _Backdoor Sets on Nowhere Dense SAT_ * Bingkai Lin, Xuandi Ren, Yican Sun, and Xiuhan Wang _On Lower Bounds of Approximating Parameterized $k$-Clique_ * Ishay Haviv _A Fixed-Parameter Algorithm for the Kneser Problem_ * Clément Legrand-Duchesne, Ashutosh Rai, and Martin Tancer _Parameterized Complexity of Untangling Knots_ * Alexandra Lassota, Aleksander Łukasiewicz, and Adam Polak _Tight Vector Bin Packing with Few Small Items via Fast Exact Matching in Multigraphs_ ## Approximation algorithms * Lin Chen, Xiaoyu Wu, and Guochuan Zhang _Approximation Algorithms for Interdiction Problem with Packing Constraints_ * Karl Bringmann, and Alejandro Cassis _Faster Knapsack Algorithms via Bounded Monotone Min-Plus-Convolution_ * Amir Abboud, Vincent Cohen-Addad, Euiwoong Lee, and Pasin Manurangsi _Improved Approximation Algorithms and Lower Bounds for Search- Diversification Problems_ * Nikhil Ayyadevara, Rajni Dabas, Arindam Khan, and K. V. N. Sreenivas _Near-optimal Algorithms for Stochastic Online Bin Packing_ * Claire Mathieu, and Hang Zhou _A PTAS for Capacitated Vehicle Routing on Trees_ ## Optimization * Shunhua Jiang, Bento Natura, and Omri Weinstein _A Faster Interior-Point Method for Sum-of-Squares Optimization_ * Ming Ding, Rasmus Kyng, and Peng Zhang _Two-Commodity Flow is Equivalent to Linear Programming under Nearly-Linear Time Reductions_ * Marcin Briański, Martin Koutecký, Daniel Kráľ, Kristýna Pekárková, and Felix Schröder _Characterization of Matrices with Bounded Graver Bases and Depth Parameters and Applications to Anteger Programming_ * Ming Ding, Rasmus Kyng, Maximilian Probst Gutenberg, and Peng Zhang _Hardness Results for Laplacians of Simplicial Complexes via Sparse-Linear Equation Complete Gadgets_ * Mitchell Black, and Amir Nayyeri _Hodge Decomposition and General Laplacian Solvers for Embedded Simplicial Complexes_ # Wednesday 14h30-15h50. Presburger Award and Gödel Prize 2022 * TBA _TBA_ * TBA _TBA_ # Thursday 16h00-17h40. Paper session 5 ## Homomorphisms * Martin Grohe, Gaurav Rattan, and Tim Seppelt _Homomorphism Tensors and Linear Equations_ * Sandra Kiefer, and Daniel Neuen _A Study of Weisfeiler-Leman Colorings on Planar Graphs_ * Robert Ganian, Thekla Hamm, Viktoriia Korchemna, Karolina Okrasa, and Kirill Simonov _The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique- Width_ * Balagopal Komarath, Anurag Pandey, and C. S. Rahul _Monotone Arithmetic Complexity of Graph Homomorphism Polynomials_ ## Process calculi and types * David Barozzini, Paweł Parys, and Jan Wróblewski _Unboundedness for Recursion Schemes: A Simpler Type System_ * Enguerrand Prebet _Functions and References in the pi-Calculus: Full Abstraction and Proof Techniques_ * Todd Schmid, Wojciech Rozowski, Alexandra Silva, and Jurriaan Rot _Processes Parametrised by an Algebraic Theory_ ## Learning theory, fairness, and privacy * Jan Pich, and Rahul Santhanam _Learning Algorithms versus Automatability of Frege Systems_ * Nathaniel Harms, and Yuichi Yoshida _Downsampling for Testing and Learning in Product Distributions_ * Niclas Boehmer, and Tomohiro Koana _The Complexity of Finding Fair Many-to-One Matchings_ * Jeremiah Blocki, Elena Grigorescu, and Tamalika Mukherjee _Privately Estimating Graph Parameters in Sublinear time_ ## Randomness in computation * Omar Alrabiah, Eshan Chattopadhyay, Jesse Goodman, Xin Li, and João Ribeiro _Low-Degree Polynomials Extract from Local Sources_ * Shir Peleg, Gil Cohen, Dor Minzer, Aaron Potechin, and Amnon Ta-Shma _Expander Random Walks: The General Case and Limitations_ * Nikhil Bansal, Haotian Jiang, Raghu Meka, Sahil Singla, and Makrand Sinha _Smoothed Analysis of the Koml\'os Conjecture_ * Jakob Bæk Tejs Houen, and Mikkel Thorup _Understanding the Moments of Tabulation Hashing via Chaoses_ # Friday 8h30-9h30. Invited speaker 5 * Madhu Sudan _Streaming and Sketching Complexity of CSPs: A survey_ # Friday 10h00-12h05. Paper Session 6 ## Data structures, sorting, and string processing * Elahe Ghasemi, Vincent Jugé, and Ghazal Khalighinejad _Galloping in Fast-growth Natural Merge Sorts_ * Takaaki Nishimoto, Shunsuke Kanda, and Yasuo Tabei _An Optimal-Time RLBWT Construction in BWT-runs Bounded Space_ * Arnab Ganguly, Rahul Shah, and Sharma V. Thankachan _Fully Functional Parameterized Suffix Trees in Compact Space_ * Debarati Das, Tomasz Kociumaka, and Barna Saha _Improved Approximation Algorithms for Dyck Edit Distance and RNA Folding_ * Pawel Gawrychowski, and Karol Pokorski _Sublinear Dynamic Interval Scheduling (on one or multiple machines)_ ## Graphs and complexity * Samir Datta, Chetan Gupta, Rahul Jain, Anish Mukherjee, Vimal Raj Sharma, and Raghunath Tewari _Dynamic Meta-theorems for Distance and Matching_ * Amina Doumane _Regular Expressions for Tree-Width 2 Graphs_ * Tamio-Vesa Nakajima, and Stanislav Živný _Linearly Ordered Colourings of Hypergraphs_ * Niel De Beaudrap, Aleks Kissinger, and John van de Wetering _Circuit Extraction for ZX-diagrams can be \#P-hard_ * Pawel Idziak, Piotr Kawałek, Jacek Krzaczkowski, and Armin Weiß _Satisfiability Problems for Finite Groups_ ## Graph distances and fault tolerance * Diptarka Chakraborty, Kushagra Chatterjee, and Keerti Choudhary _Pairwise Reachability Oracles and Preservers under Failures_ * Michał Pilipczuk, Nicole Schirrmacher, Sebastian Siebertz, Szymon Toruńczyk, and Alexandre Vigny _Algorithms and Data Structures for First-order Logic with Connectivity under Vertex Failures_ * Chao Liao, Qingyun Chen, Bundit Laekhanukit, and Yuhao Zhang _Almost Tight Approximation Hardness for Single-Source Directed k-Edge- Connectivity_ * Parinya Chalermsook, Chien-Chung Huang, Danupon Nanongkai, Thatchaphol Saranurak, Pattara Sukprasert, and Sorrachai Yingchareonthawornchai _Approximating k-Edge-Connected Spanning Subgraphs via a Near-Linear Time LP Solver_ * Shimon Kogan, and Merav Parter _Beating Matrix Multiplication for $n^{1/3}$-Directed Shortcuts_ ## Complexity * Karl Bringmann, Alejandro Cassis, Nick Fischer, and Marvin Künnemann _A Structural Investigation of the Approximability of Polynomial-Time Problems_ * Theodoros Papamakarios, and Alexander Razborov _Space Characterizations of Complexity Measures and Size-space Trade-offs in Propositional Proof Systems_ * Amulya Musipatla, Ryan O'Donnell, Tselil Schramm, and Xinyu Wu _The SDP Value of Random 2CSPs_ * Luyining Gan, and Jie Han _The Decision Problem for Perfect Matchings in Dense Hypergraphs_ * David Caballero, Timothy Gomez, Robert Schweller, and Tim Wylie _Unique Assembly Verification in Two-Handed Self-Assembly_ # Thursday 19h30-22h30. Conference dinner # Friday 14h00-15h00. Invited speaker 6 * Stéphan Thomassé _TBA_ # Friday 15h30-16h45. Paper session 7 ## Online algorithms * Yossi Azar, Chay Machluf, Boaz Patt-Shamir, and Noam Touitou _Competitive Vertex Recoloring_ * Ryder Chen, Jahanvi Khatkar, and Seeun William Umboh _Online Weighted Cardinality Joint Replenishment Problem with Delay_ ## Decremental algorithms * Jakub Łącki, and Yasamin Nazari _Near-Optimal Decremental Hopsets with Applications_ * Arun Jambulapati, Yujia Jin, Aaron Sidford, and Kevin Tian _Regularized Box-Simplex Games and Dynamic Decremental Bipartite Matching_ * Sepehr Assadi, Aaron Bernstein, and Aditi Dudeja _Decremental Matching in General Graphs_ ## Cryptography * Zvika Brakerski, Nico Döttling, Sanjam Garg, and Giulio Malavolta _Factoring and Pairings are not Necessary for iO: Circular-Secure LWE Suffices_ * Shweta Agrawal, Damien Stehle, and Anshu Yadav _Round-Optimal Lattice-Based Threshold Signatures, Revisited_ * Justin Holmgren, Andrea Lincoln, and Ron Rothblum _Delegation for Search Problems_ ## Counting and complexity * Surya Mathialagan, Virginia Vassilevska Williams, and Yinzhan Xu _Listing, Verifying and Counting Lowest Common Ancestors in DAGs: Algorithms and Fine-Grained Lower Bounds_ * Calvin Beideman, Karthekeyan Chandrasekaran, and Weihang Wang _Counting and Enumerating Optimum Cut Sets for Hypergraph $k$-partitioning problems for fixed $k$_ * Pierre Bergé, Édouard Bonnet, and Hugues Déprés _Deciding Twin-width at most 4 is NP-complete_

1 0

WADT'22 - 26th International Workshop on Algebraic Development
by Alexandre Madeira 11 May '22

11 May '22

=================================================================================== WADT'22 - 26th International Workshop on Algebraic Development Techniques 2022 ****************** CALL FOR PARTICIPATION ****************** Early registration deadline: May 20, 2022 http://wadt2022.web.ua.pt 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 http://wadt2022.web.ua.pt ** 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 http://wadt2022.web.ua.pt. 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(a)ua.pt

1 0

Women in Logic 2022 - Call for Contributions
by Sandra Kiefer 09 May '22

09 May '22

------------------------------------------------------------------------------------------------ --> 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://sites.google.com/g.uporto.pt/wil2022 ------------------------------------------------------------------------------------------------ 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://easychair.org/publications/for_authors). The abstracts should be uploaded to the WiL 2022 Easychair page as a PDF file (https://easychair.org/conferences/?conf=wil2022) before the submission deadline on May 10, 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)

1 0

LAMAS & SR 2022 - 2nd Call for Contributions
by Fabio Mogavero 08 May '22

08 May '22

[Apologies for multiple cross-posting] -------------------------------------------------------------------------------- 2nd Call for Contributions 2nd International Workshop on Logical Aspects in Multi-Agent Systems and Strategic Reasoning (LAMAS&SR) 2022 25-26 August 2022, Rennes, France URL: https://lamassr.github.io/ -------------------------------------------------------------------------------- Objectives ---------- Logics and strategic reasoning play a central role in multi-agent systems. Logics can be used, for instance, to express the agents’ abilities, knowledge, and objectives. Strategic reasoning refers to algorithmic methods that allow for developing good behaviour for the agents of the system. At the intersection, we find logics that can express existence of strategies or equilibria, and can be used to reason about them. The LAMAS&SR workshop merges two international workshops: LAMAS (Logical Aspects of Multi-Agent Systems), which focuses on all kinds of logical aspects of multi-agent systems from the perspectives of artificial intelligence, computer science, and game theory, and SR (Strategic Reasoning), devoted to all aspects of strategic reasoning in formal methods and artificial intelligence. List of Topics -------------- The topics covered by the workshop include, but are not limited to: * Logical systems for specification, analysis, and reasoning about multi-agent systems * Logic-based modelling of multi-agent systems * Dynamical multi-agent systems * Deductive systems and decision procedures for logics for multi-agent systems * Development and implementation of methods for verification in multi-agent systems * Logic-based tools for multi-agent systems * Logics for reasoning about strategic abilities * Logics for multi-agent mechanism design, verification, and synthesis * Logical foundations of decision theory for multi-agent systems * Strategic reasoning in formal verification * Automata theory for strategy synthesis * Applications and tools for cooperative and adversarial reasoning * Robust planning and optimisation in multi-agent systems * Risk and uncertainty in multi-agent systems * Quantitative aspects in strategic reasoning Invited Speakers ---------------- * Rineke Verbrugge, University of Groningen Co-Located Event ---------------- LAMAS&SR 2022 will be an event co-located with the 14th International Conference on Advances In Modal Logic (AiML 2022, 22-25 August). About COVID-19 -------------- Local organizers are following closely the evolution of the pandemic situation. Our preference is for a full in-person event, but we will employ an online or hybrid format according to the situation. Important Dates --------------- * Paper submission: May 23 (AoE) * Author notification: June 30 (AoE) * Camera ready: July 15 (AoE) * Workshop: August 25-26, 2022 Contribution Submission ----------------------- Authors are invited to submit extended abstracts of 2 pages, plus 1 page for references only, in the AAMAS 2022 format. Both published and unpublished works are welcome. Submissions are subject to a single-blind review process, thus, submissions should not be anonymous, must be in PDF format, and will be handled via EasyChair at https://easychair.org/conferences/?conf=lamassr22 Although there will be no formal proceedings, accepted extended abstracts will be made available on the workshop website. Extensions of selected original contributions will be then invited to a special issue of Games, an MDPI open-access journal, with a special arrangement. Program Co-Chairs ----------------- * Fabio Mogavero, Università di Napoli Federico II * Sophie Pinchinat, Université de Rennes 1 Program Committee ----------------- * Thomas Agotnes, University of Bergen * Natasha Alechina, Utrecht University * Guy Avni, University of Haifa * Massimo Benerecetti, University of Naples Federico II * Hans van Ditmarsch, Open University of Netherlands * Valentin Goranko, Stockholm University * Wojtek Jamroga, University of Luxembourg and Polish Academy of Sciences * Dario Della Monica, University of Udine * Emiliano Lorini, Université Paul Sabatier * Nicolas Markey, Université de Rennes 1 * Bastien Maubert, University of Naples Federico II * John-Jules C. Meyer, Utrecht University * Aniello Murano, University of Naples Federico II * Rohit J. Parikh, City University of New York * Sasha Rubin, The University of Sydney, Australia * Chenwei Shi, Tsinghua University * Yanjing Wang, Peking University Organising Committee -------------------- * Sophie Pinchinat, Université de Rennes 1 * Dylan Bellier, Université de Rennes 1 * Pierre Le Scornet, Université de Rennes 1 * Sophie Maupile, Université de Rennes 1 * Alexandre Terefenko, Université de Rennes 1 * Fabio Mogavero, Università di Napoli Federico II

1 0

DaLí 2022 - Call for Papers - ** Extended Deadline **
by Carlos Areces 05 May '22

05 May '22

DaLí 2022 - Call for Papers - ** Extended Deadline ** http://dali2022.campus.ciencias.ulisboa.pt/ -- Online participation will be ensured. -- ***Important Dates*** - Abstract submission deadline: 18 May 2022 (Extended!) - Full paper submission deadline: 25 May 2022 (Extended!) - Author notifications: 15 June 2022 - Workshop final program online: 15 June 2022 ****Invited Speakers**** Marta Bílková (Institute of Computer Science, Czech Academy of Sciences, CZ) Nina Gierasimczuk (Technical University of Denmark, DK) Elaine Pimentel (University College London, UK) Fernando Velázquez Quesada (University of Bergen, NO) ****Overview**** Dynamic logic (DL), a generalization of the logic of Floyd-Hoare introduced in the 70s by Pratt, is a well-known and particularly powerful way of combining propositions, for capturing static properties of program states, and structured actions, responsible for transitions from a state to another (and typically combined through a Kleene algebra to express sequential, non-deterministic, iterative behavior of systems), into a formal framework to reason about, and verify, classic imperative programs. Over time Dynamic logic grew to encompass a family of logics increasingly popular in the verification of computational systems, and able to evolve and adapt to new, and complex validation challenges. In particular, the dynamic logic community is interested in the study of operators that can modify the structure in which they are being evaluated. Examples include dynamic logics tailored to specific programming problems or paradigms (e.g., separation logics to model the evolution of a program heap); languages to reason and represent evolving information (e.g., dynamic epistemic logics); and formalism that aim to model new computing domains, including probabilistic, continuous and quantum computation. Dynamic logic is not only theoretically relevant, but it also shows enormous practical potential and it is indeed a topic of interest in several scientific venues, from wide-scope software engineering conferences to modal logic specific events. That being said, DaLí is the only event exclusively dedicated to this topic. It is our aim to once again bring together in a single place the heterogeneous community of colleagues which share an interest in Dynamic logic - from Academia to Industry, from Mathematics to Computer Science, - to promote their works, to foster great discussions and new collaborations. Previous editions of DaLí took place in Brasília (2017) and Porto (2019), and an online edition (2020). ****List of Topics**** Submissions are invited on the general field of dynamic logic, its variants and applications, including, but not restricted to: - Dynamic logic, foundations and applications - Logics with regular modalities - Modal/temporal/epistemic logics - Kleene and action algebras and their variants - Quantum dynamic logic - Coalgebraic modal/dynamic logics - Graded and fuzzy dynamic logics - Dynamic logics for cyber-physical systems - Dynamic epistemic logic - Complexity and decidability of variants of dynamic logics and temporal logics - Model checking, model generation and theorem proving for dynamic logics ****Submission and Proceedings**** Submissions of original papers (unpublished and not submitted for publication elsewhere), up to 15 pages in LNCS style, are invited through https://easychair.org/conferences/?conf=dal2022 Papers will be published in a Lecture Notes in Computer Science Volume, Springer. We are planning a special issue of a journal for selected contributions. Extended abstracts with preliminary results and work in progress (2-5 pag) are also welcomed for short presentations. ****Program Committee Chairs**** Carlos Areces (FaMAF, Universidad Nacional de Córdoba, AR) Diana Costa (LASIGE, FCUL, University of Lisbon, PT) ****Program Commitee**** Thomas Ågotnes (U. Bergen, NO) Natasha Alechina (Utrecht U., NL) Carlos Areces (U. Córdoba, AR) Philippe Balbiani (IRIT, FR) Diana Costa (U. Lisbon, PT) Giovanna D'Agostino (U. Udine, IT) Stéphane Demri (CNRS, FR) Hans van Ditmarsch (Open University, NL) Raul Fervari (U. Córdoba, AR) Sabine Frittella (LIFO, FR) Nina Gierasimczuk (TU Denmark, DK) Rajeev Goré (Vienna U. of Technology, AU and Polish A. of Science, PO) Rolf Hennicker (LMU Munich, DE) Reiner Hähnle (TU Darmstadt, DE) Sophia Knight (U. Minnesota, USA) Clemens Kupke (U. Strathclyde, UK) Stepan Kuznetsov (Steklov Mathematical Institute, RU) Alexandre Madeira (U. Aveiro, PT) Sonia Marin (U. Birmingham, UK) Manuel A. Martins (U. Aveiro, PT) Larry Moss (Indiana University Bloomington, USA) Cláudia Nalon (U. Brasília, BR) Nicola Olivetti (Aix-Marseille U., FR) Eric Pacuit (U. Maryland, USA) Alessandra Palmigiano (Vrije Universiteit Amsterdam, NL) Vít Punčochář (Czech Academy of Sciences, CZ) Katsuhiko Sano (Hokkaido U., JP) Igor Sedlár (Czech Academy of Sciences, CZ) Rineke Verbrugge (U. Groningen, NL) Frank Wolter (U. Liverpool, UK) Serenella Cerrito (U. d'Evry Val d'Essonne, FR) ****Steering Committee**** Alexandru Baltag (U. Amsterdam, NL) Alexandre Madeira (U. Aveiro, PT) Andreas Herzig (IRIT, U. Paul Sabatier, FR) David Harel (The Weizmann Institute of Science, IL) Dexter Kozen (Cornell U., USA) Fenrong Liu (Tsinghua U., CH) Johan van Benthem (U. Amsterdam, NL) Hans van Ditmarsch (Open University, NL) Igor Sedlár (Czech Academy of Sciences, CZ) Luís Soares Barbosa (U. Minho, PT), Chair Manuel Martins (U. Aveiro, PT) Mário Benevides (Federal U. Rio de Janeiro, BR) Nina Gierasimczuk (U. Amsterdam, NL) Sonja Smets (U. Amsterdam, NL) Vaughan Pratt (Stanford U., USA)

1 0

Runtime Verification RV'22 deadline extension
by Thao Dang 05 May '22

05 May '22

We would like to inform you that the deadline of Runtime Verification RV'22 is extended as follows: - Paper submission deadline extended to 19 May 2022 - Please register paper title and abstract by Monday 16 May 2022 We would also like to note that RV'22 will go hybrid, which enables both physical and virtual attendance. More information about paper submission and the conference is included below. ==== The 22nd International Conference on Runtime Verification RV'22 [ https://rv22.gitlab.io/ | https://rv22.gitlab.io ] , which will take place as part of the Computational Logic Autumn Summit CLAS 2022 ( [ http://viam.science.tsu.ge/clas2022/ | http://viam.science.tsu.ge/clas2022/ ] ) in Tbilisi, Georgia, from September 28-30, 2022. Deadlines expire at 23:59 anywhere on earth on the dates displayed above. ### Submissions ### Submission: [ https://easychair.org/conferences/?conf=rv2022 | https://easychair.org/conferences/?conf=rv2022 ] .

1 0