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

ICALP 2022 - Errata

von Amaury Pouly (IRIF)

*** ICALP 2022 Errata *** The submission deadline in the previous call for paper was incorrect. The correct submission deadline is February 10, 2022 AoE as indicated on the conference website https://icalp2022.irif.fr/

2 Jahre, 5 Monate

1
0
0 0

ICALP 2022 - Final Call for Papers (errata)

von Amaury Pouly (IRIF)

***Errata: the submission deadline in the previous message was incorrect*** ================================== ICALP 2022 - Final Call for Papers ================================== 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: - Submissions are anonymous, and there is a rebuttal phase. - The conference is hybrid. - This will be the 50th birthday of the conference and some special events are planned. 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 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 ============= Submissions: February 10, 2022 AoE Rebuttal: March 21-23 Notification: April 11 Camera-ready version: April 25 Early registration: April 25 Conference: 4-8 July, 2022 Deadlines are firm; late submissions will not be considered. Conference website: https://icalp2022.irif.fr/ Submission (track A): https://easychair.org/my/conference?conf=icalp2022# Submission (track B): https://easychair.org/my/conference?conf=icalp2022# ============= 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 ============= 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 not include obvious references that reveal their own identity, and 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 (https://www.dagstuhl.de/en/publications/lipics/instructions-for-authors/) are mandatory: papers that deviate significantly from the required format risk rejection without consideration of merit. 5) During the rebuttal phase, authors will have three days, March 21-23, to view and respond to initial reviews. Further instructions will be sent to authors of submitted papers before that time. 6) One author per accepted paper is expected to present the work in Paris, unless there are strong reasons not to do so, including high environmental cost of travel or impossibility to travel. We will be monitoring the current situation and are aware of possible travel restrictions, but we aim to organize the conference as a hybrid event with a strong in-person attendance. If no speaker can attend, a remote presentation and participation to the discussion session are mandatory. 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 (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 (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 2022 Programme Committee ============= Track A: Algorithms, Complexity and Games ----------------------------- Petra Berenbrink - University of Hamburg Sergio Cabello - University of Ljubljana Yixin Cao - Hong Kong Polytechnic University Sitan Chen - University of California Berkeley Xi Chen - Columbia University Ilias Diakonikolas - University of Wisconsin-Madison David Doty - University of California Davis Yuval Filmus - Technion Cyril Gavoille - Université de Bordeaux Sevag Gharibian - Paderborn University Seth Gilbert - National University of Singapore Nick Gravin - Shanghai University of Finance and Economics Kasper Green Larsen - Aarhus University Abhradeep Guha Thakurta - Google Research Hamed Hatami - McGill University Sandy Irani - University of California Irvine Yuval Ishai - Technion Aayush Jain - NTT Research/CMU Ken-ichi Kawarabayashi - National Institute of Informatics Yuqing Kong - Peking University Michal Koucky - Charles University Stefano Leonardi - Sapienza Universita di Roma Nutan Limaye - IT University of Copenhagen Frederic Magniez - CNRS Audra Mcmillan - Apple Slobodan Mitrovic - MIT / University of California Davis Wolfgang Mulzer - Freie Universitat Berlin Cameron Musco - University of Massachusetts Amherst Anand Natarajan - MIT Jelani Nelson - University of California Berkeley Evdokia Nikolova - University of Texas at Austin Debmalya Panigrahi - Duke University Richard Peng - Georgia Tech Vijaya Ramachandran - University of Texas at Austin Saket Saurabh - Institute of Mathematical Sciences, Chennai Christian Sohler - University of Cologne Thomas Steinke - Google Research Vasilis Syrgkanis - Microsoft Research Emanuele Viola - Northeastern University Adrian Vladu - CNRS Jan Vondrak - Stanford Hoeteck Wee - NTT Research / ENS David Woodruff - CMU (chair) Christian Wulf-Nilsen - University of Copenhagen Track B: Automata, Logic, Semantics, and Theory of Programming --------------------------------- Luca Aceto - Reykjavik University Isolde Adler - University of Leeds Antoine Amarilli - Télécom Paris Pablo Barcelo - Catholic University of Chile Libor Barto - Charles University Mikołaj Bojańczyk - University of Warsaw (chair) Laura Ciobanu - Heriot-Watt University Erich Grädel - RWTH Aachen University Christoph Haase - University of Oxford Marcin Jurdziński - University of Warwick Benjamin Kaminski - University College London Joost-Pieter Katoen - RWTH Aachen University Bartek Klin - University of Oxford Naoki Kobayashi - University of Tokyo Dexter Kozen - Cornell University Orna Kupferman - Hebrew University Jérôme Leroux - CNRS / University of Bordeaux Nathan Lhote - Aix-Marseille University Markus Lohrey - University of Siegen Joël Ouaknine - Max Planck Institute Prakash Panangaden - McGill University Michael Pinsker - Vienna University of Technology Sven Schewe - University of Liverpool Jeffrey Shallit - University of Waterloo Mahsa Shirmohammadi - CNRS / University of Paris Sebastian Siebertz - University of Bremen Alex Simpson - University of Ljubljana Lidia Tendera - University of Opole ============= ICALP 2022 Workshop Chairs ============= Track A: Valia Mitsou Track B: Mahsa Shirmohammadi ============= ICALP 2022 Proceedings Chairs ============= Emanuela Merelli ============= ICALP 2022 Organizing Committee ============= Sandrine Cadet, Olivier Carton Thomas Colcombet Geoffroy Couteau Hugo Férée Irène Guessarian Natalia Hacquart Florian Horn Simon Mauras Valia Mitsou Sylvain Perifel Amaury Pouly Arnaud Sangnier Sylvain Schmitz Mahsa Shirmohammadi

2 Jahre, 5 Monate

1
0
0 0

ICALP 2022 - Final Call for Papers

von Amaury Pouly (IRIF)

================================== ICALP 2022 - Second Call for Papers ================================== 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: - Submissions are anonymous, and there is a rebuttal phase. - The conference is hybrid. - This will be the 50th birthday of the conference and some special events are planned. 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 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 ============= Submissions: February 9, 2022 AoE Rebuttal: March 21-23 Notification: April 11 Camera-ready version: April 25 Early registration: April 25 Conference: 4-8 July, 2022 Deadlines are firm; late submissions will not be considered. Conference website: https://icalp2022.irif.fr/ Submission (track A): https://easychair.org/my/conference?conf=icalp2022# Submission (track B): https://easychair.org/my/conference?conf=icalp2022# ============= 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 ============= 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 not include obvious references that reveal their own identity, and 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 (https://www.dagstuhl.de/en/publications/lipics/instructions-for-authors/) are mandatory: papers that deviate significantly from the required format risk rejection without consideration of merit. 5) During the rebuttal phase, authors will have three days, March 21-23, to view and respond to initial reviews. Further instructions will be sent to authors of submitted papers before that time. 6) One author per accepted paper is expected to present the work in Paris, unless there are strong reasons not to do so, including high environmental cost of travel or impossibility to travel. We will be monitoring the current situation and are aware of possible travel restrictions, but we aim to organize the conference as a hybrid event with a strong in-person attendance. If no speaker can attend, a remote presentation and participation to the discussion session are mandatory. 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 (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 (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 2022 Programme Committee ============= Track A: Algorithms, Complexity and Games ----------------------------- Petra Berenbrink - University of Hamburg Sergio Cabello - University of Ljubljana Yixin Cao - Hong Kong Polytechnic University Sitan Chen - University of California Berkeley Xi Chen - Columbia University Ilias Diakonikolas - University of Wisconsin-Madison David Doty - University of California Davis Yuval Filmus - Technion Cyril Gavoille - Université de Bordeaux Sevag Gharibian - Paderborn University Seth Gilbert - National University of Singapore Nick Gravin - Shanghai University of Finance and Economics Kasper Green Larsen - Aarhus University Abhradeep Guha Thakurta - Google Research Hamed Hatami - McGill University Sandy Irani - University of California Irvine Yuval Ishai - Technion Aayush Jain - NTT Research/CMU Ken-ichi Kawarabayashi - National Institute of Informatics Yuqing Kong - Peking University Michal Koucky - Charles University Stefano Leonardi - Sapienza Universita di Roma Nutan Limaye - IT University of Copenhagen Frederic Magniez - CNRS Audra Mcmillan - Apple Slobodan Mitrovic - MIT / University of California Davis Wolfgang Mulzer - Freie Universitat Berlin Cameron Musco - University of Massachusetts Amherst Anand Natarajan - MIT Jelani Nelson - University of California Berkeley Evdokia Nikolova - University of Texas at Austin Debmalya Panigrahi - Duke University Richard Peng - Georgia Tech Vijaya Ramachandran - University of Texas at Austin Saket Saurabh - Institute of Mathematical Sciences, Chennai Christian Sohler - University of Cologne Thomas Steinke - Google Research Vasilis Syrgkanis - Microsoft Research Emanuele Viola - Northeastern University Adrian Vladu - CNRS Jan Vondrak - Stanford Hoeteck Wee - NTT Research / ENS David Woodruff - CMU (chair) Christian Wulf-Nilsen - University of Copenhagen Track B: Automata, Logic, Semantics, and Theory of Programming --------------------------------- Luca Aceto - Reykjavik University Isolde Adler - University of Leeds Antoine Amarilli - Télécom Paris Pablo Barcelo - Catholic University of Chile Libor Barto - Charles University Mikołaj Bojańczyk - University of Warsaw (chair) Laura Ciobanu - Heriot-Watt University Erich Grädel - RWTH Aachen University Christoph Haase - University of Oxford Marcin Jurdziński - University of Warwick Benjamin Kaminski - University College London Joost-Pieter Katoen - RWTH Aachen University Bartek Klin - University of Oxford Naoki Kobayashi - University of Tokyo Dexter Kozen - Cornell University Orna Kupferman - Hebrew University Jérôme Leroux - CNRS / University of Bordeaux Nathan Lhote - Aix-Marseille University Markus Lohrey - University of Siegen Joël Ouaknine - Max Planck Institute Prakash Panangaden - McGill University Michael Pinsker - Vienna University of Technology Sven Schewe - University of Liverpool Jeffrey Shallit - University of Waterloo Mahsa Shirmohammadi - CNRS / University of Paris Sebastian Siebertz - University of Bremen Alex Simpson - University of Ljubljana Lidia Tendera - University of Opole ============= ICALP 2022 Workshop Chairs ============= Track A: Valia Mitsou Track B: Mahsa Shirmohammadi ============= ICALP 2022 Proceedings Chairs ============= Emanuela Merelli ============= ICALP 2022 Organizing Committee ============= Sandrine Cadet, Olivier Carton Thomas Colcombet Geoffroy Couteau Hugo Férée Irène Guessarian Natalia Hacquart Florian Horn Simon Mauras Valia Mitsou Sylvain Perifel Amaury Pouly Arnaud Sangnier Sylvain Schmitz Mahsa Shirmohammadi

2 Jahre, 5 Monate

1
0
0 0

[Vardi-list] Webinar & Call for Model-Checking Community Feedback

von Moshe Y Vardi

*** 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://modelchecker.temporallogic.org ********************************************************************* 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://modelchecker.temporallogic.org 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 _______________________________________________ Vardi-list mailing list Vardi-list(a)mailman.rice.edu https://mailman.rice.edu/mailman/listinfo/vardi-list

2 Jahre, 5 Monate

1
0
0 0

CSL 2022: 2nd Call for Participation

von Manea, Florin

===================================== 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://www.eacsl.org/. CSL is an interdisciplinary conference, spanning across both basic and application oriented research in mathematical logic and computer science. CSL'22 will be held on February 14 - 19, 2022, online. The conference is hosted by the University of Göttingen. More details, including the schedule, will be announced soon on the website: http://csl2022.uni-goettingen.de/ Invited speakers: ------------------ Annabelle McIver Macquarie (University, Sydney, Australia) Udi Boker (IDC Herzliya, Israel) Martin Escardo (University of Birmingham, UK) Rosalie Iemhoff (Utrecht University, The Netherlands) Karen Lange (Wellesley College, USA) Accepted papers: ----------------- The Program Committee selected 35 accepted papers for presentation at CSL 2022. Their titles and authors can be seen here: http://csl2022.uni-goettingen.de/#acceptedpaper Schedule: ----------------- http://csl2022.uni-goettingen.de/#schedule Registration: -------------- To register for CSL 2022, please fill in the registration form at: https://events.gwdg.de/event/95/ 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://www.eacsl.org/membership/). 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://www.eacsl.org/?page_id=1104 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://www.cs.swansea.ac.uk/lcc/. The program will consist of invited lectures as well as contributed papers selected by the Program Committee. LMW@CSL: Logic Mentoring Workshop --------- The Logic Mentoring Workshop introduces young researchers to the technical and practical aspects of a career in logic research. It is targeted at students, from senior undergraduates to graduates, and will include talks and panel sessions from leaders in the subject. Building on successful LMW editions from past years, its first winter edition will be collocated with CSL 2022. Website: https://lmw.mpi-sws.org/csl/ Contact: --------- Please send all questions about submissions to the PC co-chairs and main organizers: csl2022(a)easychair.org

2 Jahre, 5 Monate

1
0
0 0

DaLí 2022 - Call for Papers

von Carlos Areces

DaLí 2022 - Call for Papers http://dali2022.campus.ciencias.ulisboa.pt ***Important Dates*** - Abstract submission deadline: 03 May 2022 - Full paper submission deadline: 10 May 2022 - Author notifications: 15 June 2022 ************ ****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 behaviour 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=dali2020 A post-proceedings volume and a special issue of a journal are planned. ****Invited Speakers**** TBA ****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) Serenella Cerrito (IBISC, U. Evry, U. Paris-Saclay, 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 Gore (Vienna U. of Technology, AU and Polish A. of Science, PO) Reiner Hähnle (TU Darmstadt, DE) Rolf Hennicker (LMU Munich, 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 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)

2 Jahre, 5 Monate

1
0
0 0

Learning and Automata (LearnAut) 2022 -- ICALP 2022 Workshop

von Tobias Kappé

Learning and Automata (LearnAut) -- ICALP 2022 workshop July 4th - Paris, France and virtually Website: https://learnaut22.github.io 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://ctan.org/tex-archive/macros/latex/contrib/jmlr We do accept submissions of work recently published or currently under review. - Submission url: https://easychair.org/conferences/?conf=learnaut2022 - 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)

2 Jahre, 6 Monate

1
0
0 0

FSCD 2022: Second Call for Papers

von Carsten Fuhs

(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://fscd2022.github.io 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 (http://fscd-conference.org/) covers all aspects of formal structures for computation and deduction from theoretical foundations to applications. Building on two communities, RTA (Rewriting Techniques and Applications) and TLCA (Typed Lambda Calculi and Applications), FSCD embraces their core topics and broadens their scope to closely related areas in logics, models of computation, semantics and verification in new challenging areas. The suggested, but not exclusive, list of topics for submission is: 1. Calculi: - Rewriting systems (string, term, higher-order, graph, conditional, modulo, infinitary, etc.); - Lambda calculus; - Logics (first-order, higher-order, equational, modal, linear, classical, constructive, etc.); - Proof theory (natural deduction, sequent calculus, proof nets, etc.); - Type theory and logical frameworks; - Homotopy type theory; - Quantum calculi. 2. Methods in Computation and Deduction: - Type systems (polymorphism, dependent, recursive, intersection, session, etc.); - Induction, coinduction; - Matching, unification, completion, orderings; - Strategies (normalization, completeness, etc.); - Tree automata; - Model building and model checking; - Proof search and theorem proving; - Constraint solving and decision procedures. 3. Semantics: - Operational semantics and abstract machines; - Game Semantics and applications; - Domain theory and categorical models; - Quantitative models (timing, probabilities, etc.); - Quantum computation and emerging models in computation. 4. Algorithmic Analysis and Transformations of Formal Systems: - Type Inference and type checking; - Abstract Interpretation; - Complexity analysis and implicit computational complexity; - Checking termination, confluence, derivational complexity and related properties; - Symbolic computation. 5. Tools and Applications: - Programming and proof environments; - Verification tools; - Proof assistants and interactive theorem provers; - Applications in industry; - Applications of formal systems in other sciences. 6. Semantics and Verification in new challenging areas: - Certification; - Security; - Blockchain protocols; - Data Bases; - Deep learning and machine learning algorithms; - Planning. PUBLICATION ----------- The proceedings will be published as an electronic volume in the Leibniz International Proceedings in Informatics (LIPIcs) of Schloss Dagstuhl. All LIPIcs proceedings are open access. SPECIAL ISSUE ------------- Authors of selected papers will be invited to submit an extended version to a special issue of Logical Methods in Computer Science. SUBMISSION GUIDELINES --------------------- The submission site is: https://easychair.org/conferences/?conf=fscd2022 Submissions must be formatted using the LIPIcs style files (https://submission.dagstuhl.de/series/details/5#author). 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

2 Jahre, 6 Monate

1
0
0 0

Logica Universalis Webinar - January 14 - Celebrating the World Logic

von Antje Herbst

Join the Logica Universalis Webinar! The next session will be held on Friday, January 14 at 4pm CET. Please register in advance. Registration is now open!<https://springer.zoom.us/meeting/register/tJMvdu6vrzMiHda_iDhjxw9vA9d7we9gT…> To celebrate the World Logic Day<https://www.springer.com/journal/11787/updates/17236846> we will have a roundtable on The Exceptionality of Logic<https://www.jyb-logic.org/ILE> with the participation of Jean-Yves Beziau<https://www.jyb-logic.org/> (Editor-in-Chief LU, President of the Logica Universalis Association, Creator of the World Logic Day) Yuri Gurevich<https://en.wikipedia.org/wiki/Yuri_Gurevich> (Former Principal Researcher at MICROSOFT RESEARCH, Professor Emeritus at the University of Michigan, USA) María del Rosario Martínez-Ordaz<https://www.mariamartinezordaz.com/> (Federal University of Rio de Janeiro, Brazil and Coordinator of LógicaMX) Srecko Kovac<https://www.ifzg.hr/~skovac/index_files/Page328.html> (Institute of Philosophy, Zagreb, President of the Croatian Logic Association) Mihir Chakraborty<https://sites.google.com/site/mihirkchakraborty/> (Jadavpur University and Coordinator of the Calcutta Logic Circle, India) István Németi<https://www.renyi.hu/~nemeti/> and Hajnal Andreka (Alfred Renyi Institute of Mathematics, Hungarian Academy of Sciences, Budapest, Hungary) Chair: Katarzyna Gan-Krzywoszynska<https://filozofia.amu.edu.pl/struktura-instytutu/zaklad-logiki-i-metodologi…> (Adam Mickiewicz University, Poznań, Poland, Secretary of the Logica Universalis Association) Associate Organization: Logica Universalis Association<http://www.logica-universalis.org/LUAD> --- The Logica Universalis Webinar is a World Seminar Series connected to the journal Logica Universalis<https://www.springer.com/journal/11787/>, the book series Studies in Universal Logic<https://www.springer.com/series/7391> and the Universal Logic Project<https://logica-universalis.org/>. It is an open platform for all scholars interested in the many aspects of logic. (See the full program here<https://www.springer.com/journal/11787/updates/18988758>.) Each session of the webinar is chaired by a member of the editorial board of the journal Logica Universalis (LU), the book series Studies in Universal Logic (SUL) or an organizer of an event of the Universal Logic Project (ULP). Sessions will start with a short presentation of a logical organization related to the region of the speaker or the topic of the talk. The talk (30 min) will focus on a recently published paper in LU, on a book in SUL, on an event or on the ULP. Talks are followed by a discussion (15 min). Video recordings of the seminars are uploaded on the YouTube channel Universal Logic Project<https://www.youtube.com/channel/UCPS1c5ApuwjuCV9UjXHUN4w>. --- To unsubscribe from these notifications for the Logica Universalis Webinar please send a message with 'Unsubscribe' to this e-mail address (antje.herbst(a)springernature.com<mailto:antje.herbst@springernature.com>). -- Antje Herbst Associate Editor Mathematics Journals Springer Nature Tiergartenstraße 17, 69121 Heidelberg, Germany T +49 62214878984 antje.herbst(a)springernature.com<mailto:antje.herbst@springernature.com> www.springernature.com<http://www.springernature.com/> -- Springer Nature is a leading research, educational and professional publisher, providing quality content to our communities through a range of innovative platforms, products and services. Every day, around the globe, our imprints, books, journals and resources reach millions of people - helping researchers, students, teachers & professionals to discover, learn and achieve. -- Branch of Springer-Verlag GmbH, Heidelberger Platz 3, 14197 Berlin, Germany Registered Office: Berlin / Amtsgericht Berlin-Charlottenburg, HRB 91881 B Directors: Martin Mos, Dr. Ulrich Vest, Dr. Niels Peter Thomas

2 Jahre, 6 Monate

1
0
0 0

Logica Universalis Webinar - January 14 - Celebrating the World Logic

von Antje Herbst

Join the Logica Universalis Webinar! The next session will be held on Wednesday, January 14 at 4pm CET. Please register in advance. Registration is now open!<https://springer.zoom.us/meeting/register/tJMvdu6vrzMiHda_iDhjxw9vA9d7we9gT…> To celebrate the World Logic Day<https://www.springer.com/journal/11787/updates/17236846> we will have a roundtable on The Exceptionality of Logic<https://www.jyb-logic.org/ILE> with the participation of Jean-Yves Beziau<https://www.jyb-logic.org/> (Editor-in-Chief LU, President of the Logica Universalis Association, Creator of the World Logic Day) Yuri Gurevich<https://en.wikipedia.org/wiki/Yuri_Gurevich> (Former Principal Researcher at MICROSOFT RESEARCH, Professor Emeritus at the University of Michigan, USA) María del Rosario Martínez-Ordaz<https://www.mariamartinezordaz.com/> (Federal University of Rio de Janeiro, Brazil and Coordinator of LógicaMX) Srecko Kovac<https://www.ifzg.hr/~skovac/index_files/Page328.html> (Institute of Philosophy, Zagreb, President of the Croatian Logic Association) Mihir Chakraborty<https://sites.google.com/site/mihirkchakraborty/> (Jadavpur University and Coordinator of the Calcutta Logic Circle, India) Chair: Katarzyna Gan-Krzywoszynska<https://filozofia.amu.edu.pl/struktura-instytutu/zaklad-logiki-i-metodologi…> (Adam Mickiewicz University, Poznań, Poland, Secretary of the Logica Universalis Association) Associate Organization: Logica Universalis Association<http://www.logica-universalis.org/LUAD> The Logica Universalis Webinar is a World Seminar Series connected to the journal Logica Universalis<https://www.springer.com/journal/11787/>, the book series Studies in Universal Logic<https://www.springer.com/series/7391> and the Universal Logic Project<https://logica-universalis.org/>. It is an open platform for all scholars interested in the many aspects of logic. (See the full program here<https://www.springer.com/journal/11787/updates/18988758>.) Each session of the webinar is chaired by a member of the editorial board of the journal Logica Universalis (LU), the book series Studies in Universal Logic (SUL) or an organizer of an event of the Universal Logic Project (ULP). Sessions will start with a short presentation of a logical organization related to the region of the speaker or the topic of the talk. The talk (30 min) will focus on a recently published paper in LU, on a book in SUL, on an event or on the ULP. Talks are followed by a discussion (15 min). Video recordings of the seminars are uploaded on the YouTube channel Universal Logic Project<https://www.youtube.com/channel/UCPS1c5ApuwjuCV9UjXHUN4w>. --- To unsubscribe from these notifications for the Logica Universalis Webinar please send a message with 'Unsubscribe' to this e-mail address (antje.herbst(a)springernature.com<mailto:antje.herbst@springernature.com>). -- Antje Herbst Associate Editor Mathematics Journals Springer Nature Tiergartenstraße 17, 69121 Heidelberg, Germany T +49 62214878984 antje.herbst(a)springernature.com<mailto:antje.herbst@springernature.com> www.springernature.com<http://www.springernature.com/> -- Springer Nature is a leading research, educational and professional publisher, providing quality content to our communities through a range of innovative platforms, products and services. Every day, around the globe, our imprints, books, journals and resources reach millions of people - helping researchers, students, teachers & professionals to discover, learn and achieve. -- Branch of Springer-Verlag GmbH, Heidelberger Platz 3, 14197 Berlin, Germany Registered Office: Berlin / Amtsgericht Berlin-Charlottenburg, HRB 91881 B Directors: Martin Mos, Dr. Ulrich Vest, Dr. Niels Peter Thomas

2 Jahre, 6 Monate

1
0
0 0

2024

2023

2022

2021

2020

2019

2018

finite-model-theory