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

Call for Participation: Logic Mentoring Workshop (LMW@LICS 2023)
by Ilina Stoilkovska 31 May '23

31 May '23

------------------------------------------------------------------------ Call for Participation Logic Mentoring Workshop (LMW@LICS 2023) Boston, USA June 25, 2023 https://logic-mentoring-workshop.github.io/lics23/ Co-located with Logic in Computer Science (LICS) 2023 Registration at https://lics.siglog.org/lics23/ ------------------------------------------------------------------------ Students in US institutions and some students in Europe can have their expenses covered by the Logic Mentoring Workshop Travel Award. Apply here: https://forms.gle/mUgkA5Ah2W5aQwxY6 ------------------------------------------------------------------------ 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 doctoral students, and will include tutorials and plenary talks as well as a panel discussion, where experienced researchers from the field answer career-related questions from the audience. The workshop will be a hybrid event, however on-site participation in Boston, USA, is highly recommended. It is co-located with Logic in Computer Science (LICS’23, https://lics.siglog.org/lics23/) one of the most prestigious conferences on the topic. Attending LICS is not a prerequisite to attend LMW, but it is encouraged. SPEAKERS AND PANELLISTS Mikołaj Bojańczyk (University of Warsaw) Anupam Das (University of Birmingham) Anuj Dawar (University of Cambridge) Marianna Girlando (ILLC, University of Amsterdam) Martin Grohe (RWTH Aachen University) Antonina Kolokolova (Memorial University of Newfoundland) Sonia Marin (University of Birmingham) Igor Walukiewicz (CNRS, Université de Bordeaux) Matthew Weaver (Princeton University) PROGRAM The detailed program will be at https://logic-mentoring-workshop.github.io/lics23/ closer to the workshop. TRAVEL SUPPORT Students (undergrad, master's, and PhD alike) can apply to have their costs (some or all) covered by our sponsors, the National Science Foundation (NSF) and SIGLOG. Deadline: June 6th (applications are accepted after that date if funds allow) Apply at: https://forms.gle/mUgkA5Ah2W5aQwxY6 ORGANIZING COMMITTEE Arthur Azevedo de Amorim Steffen van Bergerem Ilina Stoilkovska K. S. Thejaswini

1 0

Religious Symbolism and Symbolic Logic, Sinaia, Sept 3-8, 2023 - CfP
by jean-yves beziau 24 May '23

24 May '23

Workshop organized by Jean-Yves Beziau and Caroline Pires Ting Federal University of Rio de Janeiro (Brazil) and Logica Universalis Association (Geneva, Switzerland) Part of the 4th World Congress on Logic and Religion), Sinaia, Sept 3-8, 2023 CALL FOR PAPERS On the one hand symbolism is important in most religions, on the other hand modern logic is often characterized as symbolic. This workshop, part of WoCoLoR4, explores the relation between these two symbolic approaches. Suggested topics include - but are not limited to - the following: > Boole's symbolic mathematical notation in logic and abstract religious notions > Zoroastrianism's dualism, Pythagoras's table of opposites, Trinity Christian triangle, Islamic geometrical objects and the theory of oppositions > Yin/Yang and the notion of complementary contradiction > the symbolism of the cross, crucifixion, negation and abnegation > Venn symbolic logic, Venn diagrams and their application for understanding religious phenomena > the universal quantifier and catholicism as a religion for all > is the existential quantifier really symbolizing existence? > Cabala symbolism and logic in Alice's Adventures in Wonderland by Charles Dodgson, aka Lewis Carroll, deacon in the Church of England and symbolic logician > logical "interpretation" of Gödel's proof of the existence of God in symbolic logic Submit a one page abstract by May 31st Religious Symbolism and Symbolic Logic, Sinaia, Sept 3-8, 2023 https://sites.google.com/view/symbol-relog

1 0

Extended submission deadline -- FTfJP 2023
by Aaron Tomb 23 May '23

23 May '23

========================================================== CALL FOR PAPERS -- EXTENDED FTfJP 2023 25th Workshop on Formal Techniques for Java-like Programs July 18th, 2023, Seattle, WA, USA https://2023.ecoop.org/track/ftfjp-2023 =========================================================== === Important Dates === * Paper submission: May 26th, 2023 (AoE) (EXTENDED) * Author notification: June 23rd, 2023 (AoE) * Workshop date: July 18th, 2023 (co-located with ECOOP 2023) Deadlines expire at 23:59 anywhere on earth on the dates displayed above. Submission site: https://easychair.org/conferences/?conf=ftfjp2023 === Objectives and Scope === Formal techniques can help analyse programs, precisely describe program behaviour, and verify program properties. Modern programming languages are interesting targets for formal techniques due to their ubiquity and wide user base, stable and well-defined interfaces and platforms, and powerful (but also complex) libraries. New languages and applications in this space are continually arising, resulting in new programming languages (PL) research challenges. Work on formal techniques and tools and on the formal underpinnings of programming languages themselves naturally complement each other. FTfJP is an established workshop which has run annually since 1999 alongside ECOOP, with the goal of bringing together people working in both fields. The workshop has a broad PL theme. The most important criterion is that submissions will generate interesting discussions within this community. The term “Java-like” is somewhat historic and should be interpreted broadly: FTfJP solicits and welcomes submissions relating to programming languages in general, beyond Java, including submissions related to C#, Scala, and similar languages, and submissions on more general topics that may be relevant to such languages. Example topics of interest include: * Language design and semantics * Type systems * Concurrency and new application domains * Specification and verification of program properties * Program analysis (static or dynamic) * Program synthesis * Security * Pearls (programs or proofs) FTfJP welcomes submissions on technical contributions, case studies, experience reports, challenge proposals, and position papers. Webpages for previous workshops in this series are available at: https://ftfjp.github.io/ === Paper Categories === Contributions are sought in two categories: * Full Papers (6 pages, excluding references) present a technical contribution, case study, or detailed experience report. We welcome both complete and incomplete technical results; ongoing work is particularly welcome, provided it is substantial enough to stimulate interesting discussions. * Short Papers (2 pages, excluding references) should advocate a promising research direction, or otherwise present a position likely to stimulate discussion at the workshop. We encourage, e.g., established researchers to set out a personal vision, and beginning researchers to present a planned path to a Ph.D. Both types of contributions will benefit from feedback received at the workshop. Submissions will be peer reviewed, and will be evaluated based on their clarity and their potential to generate interesting discussions. Reviewing will be single blind, there is no need to anonymize submissions. The format of the workshop encourages interaction. FTfJP is a forum in which a wide range of people share their expertise, from experienced researchers to beginning PhD students. === Submission Guidelines === All submissions and reviews will be managed within EasyChair. Submissions should be made via https://easychair.org/conferences/?conf=ftfjp2023 There is no need to indicate the paper category (long/short). Submissions should be in acmart/sigplan style, 10pt font. Formatting requirements are detailed on the SIGPLAN Author Information page (https://www.sigplan.org/Resources/Author). We plan that, as in previous years, accepted papers will be published in the ACM Digital Library, though authors will be able to opt out of this publication, if desired. At least one author of an accepted paper must register to the conference by the early registration date and attend the workshop to present the work and participate in the discussions. Selected papers will also be considered for extended versions to be submitted to the Journal of Object Technology (JOT).

1 0

FSCD 2023: Call for Participation (early registration deadline: 31
by Carsten Fuhs 19 May '23

19 May '23

============================================================================== CALL FOR PARTICIPATION Eighth International Conference on Formal Structures for Computation and Deduction (FSCD 2023) July 3-6, 2023, Rome, Italy https://easyconferences.eu/fscd2023/ OVERVIEW -------- FSCD (https://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 logic, models of computation, semantics and verification in new challenging areas. REGISTRATION --------------- The registration page is already open and linked from: https://easyconferences.eu/fscd2023/registration1/ This link should be used also to register for affiliated workshops. The early registration deadline is *** May 31, 2023 ***. Attending FSCD 2023 is possible both in-person and remotely. FSCD 2023 is co-located with CADE-29 (July 1-4, 2023), and special rates are available for joint registration to both conferences. INVITED SPEAKERS ---------------- Titles and abstracts: https://easyconferences.eu/fscd2023/keynote-speakers/ - Maribel Fernández (Joint FSCD-CADE), King’s College London - Mateja Jamnik (Joint FSCD-CADE), University of Cambridge - Giulio Manzonetto, LIPN&CNRS, Université Sorbonne Paris Nord - Akihisa Yamada, Cyber Physical Security Research Center, National Institute of Advanced Industrial Science and Technology (AIST) ACCEPTED PAPERS --------------- The list of accepted papers is here: https://easyconferences.eu/fscd2023/accepted-papers-2/ CO-LOCATION AND AFFILIATED WORKSHOPS ------------------------------------ FSCD 2023 is co-located with CADE-29: https://easyconferences.eu/cade2023/ The following workshops are affiliated with FSCD and CADE in 2023: https://easyconferences.eu/fscd2023/satellite-events/ - WIL: 7th Workshop Women in Logic (July 1, 2023) - WPTE: 10th International Workshop on Rewriting Techniques for Program Transformations and Evaluation (July 1, 2023) - TLLA: 7th International Workshop on Trends in Linear Logic and Applications (July 1-2, 2023) - LSFA: 8th Logical and Semantic Frameworks with Applications (July 1-2, 2023) - DCM: 13th International Workshop on Developments in Computational Models (July 2, 2023) - LFMTP: International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice (July 2, 2023) - UNIF: 37th International Workshop on Unification (July 2, 2023) - CASC: The CADE ATP System Competition (July 3, 2023) - HOR: 11th International Workshop on Higher-Order Rewriting (July 4, 2023) - IFIP WG 1.6: Annual Meeting of IFIP Working Group 1.6 on Rewriting (July 5, 2023) - ADeMaL: Automated Deduction for Machine Learning (July 5, 2023) - ThEdu: Theorem proving components for Educational software (July 5, 2023) - Vampire: 7th Vampire Workshop (July 5, 2023) - SMT: 21st International Workshop on Satisfiability Modulo Theories (July 5-6, 2023) PROGRAM COMMITTEE CHAIRS ------------------------ Marco Gaboardi, Boston University Femke van Raamsdonk, Vrije Universiteit Amsterdam PROGRAM COMMITTEE ----------------- Martin Avanzini, INRIA Patrick Bahr, ITU Copenhagen Pablo Barenbaum, University of Quilmes (CONICET) & ICC Filippo Bonchi, University of Pisa Sabine Broda, University of Porto Valeria De Paiva, Topos Institute Andrej Dudenhefner, TU Dortmund Santiago Escobar, Universitat Politècnica de València Claudia Faggian, University of Paris (IRIF) Frank (Peng) Fu, Dalhousie University Silvio Ghilardi, University of Milano Clemens Grabmayer, GSSI or Gran Sasso Science Institute Nao Hirokawa, JAIST Mirai Ikebuchi, National Institute of Informatics Ambrus Kaposi, Eotvos Lorand University Ian Mackie, University of Sussex Radu Mardare, University of Strathclyde Aart Middeldorp, University of Innsbruck Anders Mortberg, University of Stockholm Daniele Nantes-Sobrinho, Imperial College London / University of Brasília Vincent van Oostrom, Independent researcher Grigore Rosu, University of Illinois Urbana-Champaign Luca Roversi, University of Torino Aleksy Schubert, University of Warsaw Jakob G. Simonsen, University of Copenhagen Alwen Tiu, Australian National University Valeria Vignudelli, CNRS/ENS Lyon Johannes Waldmann, HTWK Leipzig Sarah Winkler, University of Bolzano CONFERENCE CHAIR ---------------- Daniele Gorla, University of Rome - Sapienza WORKSHOP CHAIR -------------- Ivano Salvo, University of Rome - Sapienza STEERING COMMITTEE WORKSHOP CHAIR --------------------------------- Cynthia Kop, Radboud University Nijmegen STEERING COMMITTEE PUBLICITY CHAIR ---------------------------------- Carsten Fuhs, Birkbeck, University of London FSCD STEERING COMMITTEE ----------------------- Zena Ariola, University of Oregon Alejandro Díaz-Caro, Quilmes University & ICC/CONICET Amy Felty, University of Ottawa Carsten Fuhs, Birkbeck, University of London Herman Geuvers (Chair), Radboud University Nijmegen Silvia Ghilezan, University of Novi Sad Jürgen Giesl, RWTH Aachen University Stefano Guerrini, Université de Paris 13 Delia Kesner, Université de Paris Diderot Naoki Kobayashi, University of Tokyo Cynthia Kop, Radboud University Nijmegen Luigi Liquori, Inria Daniele Nantes, Imperial College London / University of Brasília Looking forward to seeing you in Rome! ==============================================================================

1 0

Ackermann Award: Second call for nominations - Deadline 1st July
by Maribel Fernandez 14 May '23

14 May '23

ACKERMANN AWARD 2023 EACSL OUTSTANDING DISSERTATION AWARD FOR LOGIC IN COMPUTER SCIENCE 2ND CALL FOR NOMINATIONS Nominations are invited for the 2023 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 2022 and 31 December 2022 are eligible for nomination for the award. The deadline for submission is 1 July 2023. Nominations should be submitted by the candidate or the supervisor via Easychair: https://easychair.org/my/conference?conf=ackermann23 Please submit a pdf file containing: 1. a summary in English of the thesis (maximum 10 pages), providing a gentle introduction and overview of the thesis, highlighting the novel results and their impact and including a link to the thesis (please do not include the thesis itself); 2. a supporting letter by the PhD advisor and two supporting letters by other senior researchers (in English); 3. a copy of a document stating that the thesis was accepted as a PhD thesis at a recognised University (or equivalent institution) and that the candidate was awarded the PhD degree within the specified period; 4. a short CV of the candidate. *** The Award The 2023 Ackermann award will be presented to the recipient(s) at CSL 2024, 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 publish the thesis in the FoLLI subseries of Springer LNCS, and financial support to attend the conference. *** Ackermann Jury The jury consists of: * Christel Baier (TU Dresden) * Maribel Fernandez (King’s College London), president of EACSL * Jean Goubault-Larrecq (ENS Paris-Saclay) * Joost-Pieter Katoen (RWTH Aachen University), ACM SigLog rep. * Delia Kesner (IRIF, U Paris Cite) * Slawomir Lasota (U Warsaw) * Florin Manea (U Goettingen), vice-president of EACSL * Prakash Panangaden (McGill University) * James Worrell (U Oxford) For more information please contact Maribel Fernandez: Maribel.Fernandez(a)kcl.ac.uk<mailto:Maribel.Fernandez@kcl.ac.uk>

1 0

Call for Papers on Dynamic Logics and related subjects [JLAMP]
by Diana Costa 11 May '23

11 May '23

Call for Papers (apologies for multiple copies of this email) *** DaLí - Dynamic Logic: new trends and applications *** special issue of the Journal of Logical and Algebraic Methods in Programming === Updated Deadlines === Deadline for submission of papers: June 15th, 2023 Notification of acceptance/rejection: November 1st, 2023 Submission of final versions: December 1st, 2023 === General Description === 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 DL 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. This special issue is dedicated to new advances in Dynamic Logic. Its aim is to bring together papers on both pure and applied aspects of various branches of DL, and foster the exchange of ideas between researchers working in DL and other disciplines. We invite submissions on both (a) theoretical topics from all branches of mathematical logic (e.g., proof-theory, model theory, game theory, computational complexity, etc.) in connection with DL, as well as (b) their applications in various areas (including computer science, linguistics, mathematics, philosophy, etc.). === Topics of Interest === We invite submissions 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 === Submissions === Papers should be submitted via EasyChair (https://easychair.org/conferences/?conf=dalsi2023). The submissions should be formatted according to the Journal's guidelines (https://www.elsevier.com/authors/policies-and-guidelines/latex-instructions). All submissions will undergo the usual peer-review process by the standards of the Journal of Logical and Algebraic Methods in Programming. === Guest editors === Diana Costa (LASIGE, University of Lisbon, Portugal) Carlos Areces (FAMAF, Universidad Nacional de Córdoba, Argentina) === A related conference === This special issue is a follow-up of the workshop “DaLí - Dynamic Logic: new trends and applications” (affiliated with LICS, as part of FLOC) that took part on the 31st of July and 1st of August 2022, (http://dali2022.campus.ciencias.ulisboa.pt/). Although the scope of the special issue coincides with that of the workshop, submissions are not restricted to papers presented there or papers by the participants. Rather, the call is open and all papers within the scope of the special issue are welcome. Best regards, Diana & Carlos DaLí 2022 special issue editors.

1 0

ICALP 2023 -- Call for Participation
by Kousha Etessami 11 May '23

11 May '23

======================================================== ICALP 2023 - Call for Participation ======================================================== The 50th EATCS International Colloquium on Automata, Languages, and Programming (ICALP) will take place in: Paderborn, Germany, on 10-14 July 2023. ICALP is the main conference and annual meeting of the European Association for Theoretical Computer Science (EATCS). As usual, ICALP will be preceded by a series of workshops, which will take place on July 10. The 2023 edition has the following features: - The conference is planned as a physical, in-person event. - This will be the 50th ICALP conference and some special events are planned. ======================================================== Important dates and information ======================================================== Conference website: https://icalp2023.cs.upb.de/ Twitter: @ICALPconf Early registration: May 15, 2023 by 23:59 CET Conference: July 10-14, 2023 (Workshops on July 10, 2023) ======================================================== Registration ======================================================== Please register here: https://icalp2023.cs.upb.de/registration/ On-site child care: Please contact noelle.maicher.hoff(a)upb.de of the Equality Office of Paderborn University as soon as possible. ======================================================== Invited Speakers ======================================================== Anna Karlin - University of Washington, USA Rasmus Kyng - ETH Zurich, Switzerland Rupak Majumdar - Max Planck Institute for Software Systems, Germany Thomas Vidick - California Institute of Technology, USA, and Weizmann Institute of Science, Israel James Worrell - University of Oxford, UK ======================================================== Awards ======================================================== During the conference, the following awards will be given: – the EATCS award (https://eatcs.org/index.php/eatcs-award), - the Church award (https://eatcs.org/index.php/church-award) – 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). ========================================================= Special 50th ICALP session ========================================================= Invited talks: Kurt Mehlhorn (MPI für Informatik, Saarland Informatics Campus) Thomas Henzinger (IST Austria) ========================================================= Workshops ========================================================= See https://icalp2023.cs.upb.de/workshops/ for more information. - Combinatorial Reconfiguration - Graph Width Parameters: from Structure to Algorithms (GWP 2023) - Algorithmic Aspects of Temporal Graphs VI - Adjoint Homomorphism Counting Workshop (ad hoc) - Congestion Games - Workshop On Reachability, Recurrences, and Loops '23 (WORReLL'23) - Workshop on Recent Trends in Online Algorithms - Quantum Computing with Qiskit, and why Classical Algorithms still matter! - Algebraic Complexity Theory - Computer Science for CONTINUOUS Data ============= Accepted papers ============= ////////////////////// TRACK A ////////////////////// Badih Ghazi, Pritish Kamath, Ravi Kumar, Pasin Manurangsi and Kewen Wu. On Differentially Private Counting on Trees Leslie Ann Goldberg and Marc Roth. Parameterised and Fine-grained Subgraph Counting, modulo 2 Michał Wlodarczyk. Tight Bounds for Chordal/Interval Vertex Deletion Parameterized by Treewidth Laure Morelle, Ignasi Sau, Giannos Stamoulis and Dimitrios M. Thilikos. Faster parameterized algorithms for modification problems to minor-closed classes Sanjeev Khanna, Yu Chen and Zihan Tan. Sublinear Algorithms and Lower Bounds for Estimating MST and TSP Cost in General Metrics Noam Touitou. Frameworks for Nonclairvoyant Network Design with Deadlines or Delay Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Yusuke Kobayashi, Shunichi Maezawa, Yuta Nozaki, Yoshio Okamoto and Kenta Ozeki. Rerouting Planar Curves and Disjoint Paths Honghao Fu, Daochen Wang and Qi Zhao. Parallel self-testing of EPR pairs under computational assumptions Shi Li. Nearly-Linear Time LP Solvers and Rounding Algorithms for Scheduling Problems Shyan Akmal and Ce Jin. An Efficient Algorithm for All-Pairs Bounded Edge Connectivity Benjamin Aram Berendsohn, Ishay Golinsky, Haim Kaplan and Laszlo Kozma. Fast approximation of search trees on trees with centroid trees Ishan Bansal, Joe Cheriyan, Logan Grout and Sharat Ibrahimpur. Improved Approximation Algorithms by Generalizing the Primal-Dual Method Beyond Uncrossable Functions Hadley Black, Iden Kalemaj and Sofya Raskhodnikova. Isoperimetric Inequalities for Real-Valued Functions with Applications to Monotonicity Testing Claire Mathieu and Hang Zhou. A Tight $(1.5+\epsilon)$-Approximation for Unsplittable Capacitated Vehicle Routing on Trees Sixue Liu, Zhao Song, Hengjie Zhang, Lichen Zhang and Tianyi Zhou. Space-Efficient Interior Point Method, with applications to Linear Programming and Maximum Weight Bipartite Matching Yanlin Chen and Ronald de Wolf. Quantum Algorithms and Lower Bounds for Linear Regression with Norm Constraints Spencer Compton, Slobodan Mitrović and Ronitt Rubinfeld. New Partitioning Techniques and Faster Algorithms for Approximate Interval Scheduling Tatsuya Terao. Faster Matroid Partition Algorithms David Harris and Vladimir Kolmogorov. Parameter estimation for Gibbs distributions Eric Rivals, Michelle Sweering and Pengfei Wang. Convergence of the number of period sets in strings David E. Roberson and Tim Seppelt. Lasserre Hierarchy for Graph Isomorphism and Homomorphism Indistinguishability Tobias Friedrich, Andreas Göbel, Maximilian Katzmann and Leon Schiller. Cliques in High-Dimensional Geometric Inhomogeneous Random Graphs Konstantina Mellou, Marco Molinaro and Rudy Zhou. Online Demand Scheduling with Failovers David Eppstein and Daniel Frishberg. Improved mixing for the convex polygon triangulation flip walk Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-Ichi Maezawa, Yuta Nozaki and Yoshio Okamoto. Hardness of Finding Combinatorial Shortest Paths on Graph Associahedra Rajarshi Bhattacharjee, Gregory Dexter, Petros Drineas, Cameron Musco and Archan Ray. Sublinear Time Eigenvalue Approximation via Random Sampling Lijie Chen, Xin Lyu, Avishay Tal and Hongxun Wu. New PRGs for Unbounded-width/Adaptive-order Read-once Branching Programs Petr Hlineny and Jan Jedelský. Twin-width of Planar Graphs is at most 8, and at most 6 when Bipartite Planar Yann Disser, Max Klimm, Kevin Schewior and David Weckbecker. Incremental Maximization via Continuization Mohit Garg, Felix Hommelsheim and Nicole Megow. Matching Augmentation via Simultaneous Contractions Manuel Cáceres. Minimum Chain Cover in Almost Linear Time Zachary Friggstad and Ramin Mousavi. An $O(\log k)$-Approximation for Directed Steiner Tree in Planar Graphs Shu Liu, Chaoping Xing and Chen Yuan. List Decoding of Rank-Metric Codes with Row-to-Column Ratio Bigger Than 1/2 Yossi Azar and Danny Vainstein. Multi Layer Peeling for Linear Arrangement and Hierarchical Clustering Daniel Hader and Matthew Patitz. The Impacts of Dimensionality, Diffusion, and Directedness on Intrinsic Cross-Model Simulation in Tile-Based Self-Assembly Hans L. Bodlaender, Carla Groenland and Michał Pilipczuk. Parameterized Complexity of Binary CSP: Vertex Cover, Treedepth, and Related Parameters Ishan Agarwal and Richard Cole. Stable Matching: Choosing Which Proposals to Make Ruizhe Zhang and Xinzhi Zhang. A Hyperbolic Extension of Kadison-Singer Type Results Fedor Fomin, Petr Golovach, Danil Sagunov and Kirill Simonov. Approximating Long Cycle Above Dirac’s Guarantee Michael Whitmeyer and Siddharth Iyer. Searching for Regularity in Bounded Functions Vaishali Surianarayanan, Daniel Lokshtanov and Saket Saurabh. Breaking the All Subsets Barrier for Min $k$-Cut Magdalen Dobson and Guy Blelloch. The Geometry of Tree-Based Sorting Thiago Bergamaschi. Improved Product-state Approximation Algorithms for Quantum Local Hamiltonians Shaddin Dughmi, Yusuf Hakan Kalaycı and Neel Patel. On Sparsification of Stochastic Packing Problems Siu-Wing Cheng and Haoqiang Huang. Approximate Nearest Neighbor for Polygonal Curves under Frechet Distance Gramoz Goranci and Monika Henzinger. Efficient Data Structures for Incremental Exact and Approximate Maximum Flow Shimon Kogan and Merav Parter. New Additive Emulators Davide Bilò, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Simon Krogmann and Martin Schirneck. Fault-Tolerant ST-Diameter Oracles Michal Feldman, Federico Fusco, Stefano Leonardi, Simon Mauras and Rebecca Reiffenhäuser. Truthful Matching with Online Items and Offline Agents Ilan Cohen and Debmalya Panigrahi. A General Framework for Learning-Augmented Online Allocation Fedor Fomin, Petr Golovach, Ignasi Sau, Giannos Stamoulis and Dimitrios M. Thilikos. Compound Logics for Modification Problems Anders Aamand, Adam Karczmarz, Jakub Łącki, Nikos Parotsidis, Peter Rasmussen and Mikkel Thorup. Optimal Decremental Connectivity in Non-Sparse Graphs Dana Ron and Omer Cohen Sidon. Sample-based distance-approximation for subsequence-freeness Siddharth Barman and Pooja Kulkarni. Approximation Algorithms for Envy-Free Cake Division with Connected Pieces Kazusato Oko, Shinsaku Sakaue and Shin-ichi Tanigawa. Nearly Tight Spectral Sparsification of Directed Hypergraphs Daniel Agassy, Dani Dorfman and Haim Kaplan. Expander Decomposition with Fewer Inter-Cluster Edges Using a Spectral Cut Player Jakob Bæk Tejs Houen and Mikkel Thorup. A Sparse Johnson-Lindenstrauss Transform using Fast Hashing Pan Peng and Yuyang Wang. An Optimal Separation between Two Property Testing Models for Bounded Degree Directed Graphs Qin Minglong and Penghui Yao. Decidability of fully quantum nonlocal games with noisy maximally entangled states Louis Esperet, Nathaniel Harms and Viktor Zamaraev. Optimal Adjacency Labels for Subgraphs of Cartesian Products Amirreza Akbari, Navid Eslami, Henrik Lievonen, Darya Melnyk, Joona Särkijärvi and Jukka Suomela. Locality in online, dynamic, sequential, and distributed graph algorithms Dmitry Paramonov, Gillat Kol, Klim Efremenko and Raghuvansh R. Saxena. Protecting Single-Hop Radio Networks from Message Drops Alexandru Gheorghiu, Tony Metger and Alexander Poremba. Quantum cryptography with classical communication - Parallel remote state preparation for copy-protection, verification, and more Andrzej Dorobisz and Jakub Kozik. Local Computation Algorithms for Hypergraph Coloring - following Beck's approach Ishay Haviv. On Finding Constrained Independent Sets in Cycles Petra Berenbrink, Lukas Hintze, Hamed Hosseinpour, Dominik Kaaser and Malin Rau. Dynamic Averaging Load Balancing on Arbitrary Graphs Ilan Doron, Ariel Kulik and Hadas Shachnai. An EPTAS for Budgeted Matching and Budgeted Matroid Intersection Karthik Murali and Therese Biedl. On computing the vertex connectivity of 1-plane graphs Vladimir Braverman, Robert Krauthgamer, Aditya Krishnan and Shay Sapir. Lower Bounds for Pseudo-Deterministic Counting in a Stream Charilaos Efthymiou and Weiming Feng. On the Mixing Time of Glauber Dynamics for the Hard-core and Related Models on G(n,d/n) Jun-Ting Hsieh and Pravesh K Kothari. Approximating Max-Cut on Bounded Degree Graphs: Tighter Analysis of the FKL Algorithm Or Zamir. The wrong direction of Jensen’s inequality is algorithmically right Talya Eden, Sofya Raskhodnikova, Quanquan C. Liu and Adam Smith. Triangle Counting with Local Edge Differential Privacy Lukas Drexler, Jan Eube, Kelin Luo, Heiko Röglin, Melanie Schmidt and Julian Wargalla. Connected k-Center and k-Diameter Clustering Dylan Hyatt-Denesik, Afrouz Ameli and Laura Sanita. Finding Almost Tight Witness Trees Adam Karczmarz and Piotr Sankowski. Fully Dynamic Shortest Paths and Reachability in Sparse Digraphs Xiantao Li and Chunhao Wang. Simulating Markovian open quantum systems using higher-order series expansion Monika Henzinger, Paul Liu, Jan Vondrák and Da Wei Zheng. Faster submodular maximization for several classes of matroids Miguel Bosch Calvo, Fabrizio Grandoni and Afrouz Jabal Ameli. A 4/3 Approximation for 2-Vertex-Connectivity Paul Beame and Niels Kornerup. Cumulative Memory Lower Bounds for Randomized and Quantum Computation Sudatta Bhattacharya and Michal Koucky. Streaming $k$-edit approximate pattern matching via string decomposition Robert Ferens and Marek Szykuła. Completely Reachable Automata: A Polynomial Algorithm and Quadratic Upper Bounds David Stalfa, Rajmohan Rajaraman and Sheng Yang. Scheduling under Non-Uniform Job and Machine Delays Konstantinos Zampetakis and Charilaos Efthymiou. Broadcasting with Random Matrices Chandra Chekuri and Rhea Jain. Approximation Algorithms for Network Design in Non-Uniform Fault Models Jin-Yi Cai and Ben Young. Planar \#CSP Equality Corresponds to Quantum Isomorphism -- A Holant Viewpoint Andrej Bogdanov and Alon Rosen. Nondeterministic Refutations for Nearest Boolean Vector Amir Azarmehr and Soheil Behnezhad. Robust Communication Complexity of Matching: EDCS Achieves 5/6 Approximation Timothy M. Chan, Qizheng He and Yuancheng Yu. On the Fine-Grained Complexity of Small-Size Geometric Set Cover and Discrete $k$-Center for Small $k$ Tsun-Ming Cheung, Hamed Hatami, Pooya Hatami and Kaave Hosseini. Online Learning and Disambiguations of Partial Concept Classes Sharat Ibrahimpur, Manish Purohit, Zoya Svitkina, Erik Vee and Joshua Wang. Efficient Caching with Reserves via Marking Jun-Ting Hsieh, Pravesh Kothari, Aaron Potechin and Jeff Xu. Ellipsoid Fitting Up to a Constant Ryu Hayakawa, Jordi Weggemans, Tomoyuki Morimae, Chris Cade, Marten Folkertsma, Sevag Gharibian and Francois Le Gall. Improved Hardness Results for the Guided Local Hamiltonian Problem Mohak Goyal, Sukolsak Sakshuwong, Sahasrajit Sarmasarkar and Ashish Goel. Low Sample Complexity Participatory Budgeting Yi-Jun Chang. Ortho-radial Drawing in Near-linear Time Kuan Cheng, Zhengzhong Jin, Xin Li, Zhide Wei and Yu Zheng. Linear Insertion Deletion Codes in the High-Noise and High-Rate Regimes Rotem Oshman and Tal Roth. The Communication Complexity of Set Intersection under Product Distributions Thomas Sauerwald, He Sun and Danny Vagnozzi. The Support of Open versus Closed Random Walks Sam Coy, Artur Czumaj, Peter Davies and Gopinath Mishra. Optimal (degree+1)-Coloring in Congested Clique Ittai Rubinstein. Average-Case to (shifted) Worst-Case Reduction for the Trace Reconstruction Problem Prashanth Amireddy, Ankit Garg, Neeraj Kayal, Chandan Saha and Bhargav Thankey. Low-depth arithmetic circuit lower bounds: Bypassing set-multilinearization Nicolas Resch, Chen Yuan and Yihan Zhang. Zero-Rate Thresholds and New Capacity Bounds for List-Decoding and List-Recovery Peyman Afshani, Pingan Cheng, Aniket Basu Roy and Zhewei Wei. On Range Summary Queries ////////////////////// TRACK B ////////////////////// Frits Vaandrager and Thorsten Wißmann. Action Codes Michael Lampis. First Order Logic on Pathwidth Revisited Again Patricia Bouyer, Nathanaël Fijalkow, Mickael Randour and Pierre Vandenhove. How to Play Optimally for Regular Objectives? Bader Abu Radi and Orna Kupferman. On Semantically-Deterministic Automata Manuel Bodirsky and Simon Knäuer. Network Satisfaction Problems Solved by k-Consistency Ruiwen Dong. The Identity Problem in $\mathbb{Z} \wr \mathbb{Z}$ is decidable Michael Blondin and François Ladouceur. Population Protocols with Unordered Data Markus Lohrey and Andreas Rosowski. On the complexity of diameter and related problems in permutation groups Moritz Lichter. Witnessed Symmetric Choice and Interpretations in Fixed-Point Logic with Counting Wojciech Rozowski, Tobias Kappé, Dexter Kozen, Todd Schmid and Alexandra Silva. Probabilistic Guarded KAT Modulo Bisimilarity: Completeness and Complexity Bartosz Bednarczyk, Ian Pratt-Hartmann and Daumantas Kojelis. On the of Limits of Decision: the Adjacent Fragment of First-Order Logic Mikołaj Bojańczyk and Lê Thành Dũng Nguyễn. Algebraic Recognition of Regular Functions Jan Dreier, Nikolas Mählmann, Sebastian Siebertz and Szymon Toruńczyk. Indiscernibles and Wideness in Monadically Stable and Monadically NIP Classes Antonio Casares and Pierre Ohlmann. Characterising memory in infinite games Pierre Ohlmann, Michał Pilipczuk, Wojciech Przybyszewski and Szymon Toruńczyk. Canonical decompositions in monadically stable and bounded shrubdepth graph classes Jakub Gajarský, Nikolas Mählmann, Rose McCarty, Pierre Ohlmann, Michał Pilipczuk, Wojciech Przybyszewski, Sebastian Siebertz, Marek Sokołowski and Szymon Toruńczyk. Flipper games for monadically stable graph classes Titouan Carette, Etienne Moutot, Thomas Perez and Renaud Vilmart. Compositionality of planar perfect matchings, a universal and complete fragment of ZW-calculus Harry Vinall-Smeeth and Christoph Berkholz. A dichotomy for succinct representations of homomorphisms Javier Esparza and Vincent Grande. Black-box Testing Liveness Properties of Partially Observable Stochastic Systems Thomas Henzinger, Pavol Kebis, Nicolas Mazzocchi and N. Ege Saraç. Regular Methods for Operator Precedence Languages George Kenison, Joris Nieuwveld, Joël Ouaknine and James Worrell. Positivity Problems for Reversible Linear Recurrence Sequences Olivier Carton, Gaëtan Douéneau-Tabot, Emmanuel Filiot and Sarah Winter. Deterministic regular functions of infinite words Fabian Birkmann, Stefan Milius and Henning Urbat. Nominal Topology for Data Languages Marvin Künnemann, Filip Mazowiecki, Lia Schütze, Henry Sinclair-Banks and Karol Węgrzycki. Coverability in VASS Revisited: Improving Rackoff’s Bound to Obtain Conditional Optimality Austen Z. Fan, Paraschos Koutris and Hangdong Zhao. The Fine-Grained Complexity of Boolean Conjunctive Queries and Sum-Product Problems Diptarka Chakraborty, Sourav Chakraborty, Gunjan Kumar and Kuldeep Meel. Approximate Model Counting: Is SAT Oracle More Powerful than NP Oracle? Samuel Braunfeld, Anuj Dawar, Ioannis Eleftheriadis and Aris Papadopoulos. Monadic NIP in monotone classes of relational structures Michael Benedikt, Dmitry Chistikov and Alessio Mansutti. The complexity of Presburger arithmetic with power or powers Pascal Baumann, Moses Ganardi, Rupak Majumdar, Ramanathan Thinniyam Srinivasan and Georg Zetzsche. Checking Refinement of Asynchronous Programs against Context-Free Specifications The University of Edinburgh is a charitable body, registered in Scotland, with registration number SC005336. Is e buidheann carthannais a th’ ann an Oilthigh Dhùn Èideann, clàraichte an Alba, àireamh clàraidh SC005336.

1 0

[fm-announcements] FMICS 2023 - Deadline extension
by Titolo, Laura (LARC-D320)[NATIONAL INSTITUTE OF AEROSPACE] via fm-announcements 10 May '23

10 May '23

FMICS 2023: 28th International Conference on Formal Methods for Industrial Critical Systems Antwerp, Belgium, 20-22 September 2023 https://www.uantwerpen.be/en/conferences/confest-2023/fmics/<https://gcc02.safelinks.protection.outlook.com/?url=https%3A%2F%2Fwww.uantw…> The aim of the FMICS conference series is to provide a forum for researchers and practitioners who are interested in the development and application of formal methods in the industry. FMICS brings together scientists and engineers who are active in the area of formal methods and interested in exchanging their experiences in the industrial usage of these methods. The FMICS conference series also strives to promote research and development for the improvement of formal methods and tools for industrial applications. IMPORTANT DATES: Paper submission: 28 May 2023 (extended) Authors’ response period: 12-14 July 2023 (extended) Notification: 21 July 2023 (extended) Camera-ready version: 31 July, 2023 Conference: 20-22 September 2023 TOPICS: Topics of interest include (but are not limited to): - Case studies and experience reports on industrial applications of formal methods, focusing on lessons learned or identification of new research directions. - Methods, techniques, and tools to support automated analysis, certification, debugging, learning, optimization, and transformation of complex, distributed, real-time, embedded, mobile and autonomous systems. - Verification and validation methods (model checking, theorem proving, SAT/SMT constraint solving, abstract interpretation, etc.) that address the shortcomings of existing methods with respect to their industrial applicability (e.g., scalability and usability issues, tool qualification, and certification). - Impact of the adoption of formal methods on the development process and associated costs. - Application of formal methods in standardization and industrial forums. PAPER SUBMISSION: Papers must describe original research work and results. Submitted papers must not have previously appeared in a journal or conference with published proceedings and must not be concurrently submitted to any other peer-reviewed workshop, symposium, conference, or archival journal. Any partial overlap with any such published or concurrently submitted paper must be clearly indicated. Submissions should clearly motivate relevance to industrial applications. Case study papers should identify lessons learned, validate theoretical results (such as scalability of methods) or provide specific motivation for further research and development. Papers should not exceed 15 pages formatted according to the LNCS style (Springer). All submissions will be reviewed by the Programme Committee, which will make a selection among the submissions based on the novelty, soundness, and applicability of the presented ideas and results. Papers must be written in English and should be submitted as PDF files using the EasyChair submission site: https://easychair.org/conferences/?conf=fmics2023<https://gcc02.safelinks.protection.outlook.com/?url=https%3A%2F%2Feasychair…>. PROCEEDINGS: The conference proceedings will be published by Springer in the LNCS series. At least one author of each accepted paper is expected to present the paper at the conference as a registered participant. BEST PAPER AWARD: An award will be presented to the authors of the submission selected by the Program Committee as the FMICS 2023 Best Paper. This submission will be awarded a 1.000 Euro prize sponsored by Springer. SPECIAL ISSUE: The Program Committee of FMICS 2023 will invite a selection of accepted papers to submit extended versions to a special issue of an International Journal. PC CHAIRS: Alessandro Cimatti, FBK, Italy Laura Titolo, NIA/NASA LaRC, USA PROGRAM COMMITTEE: Jasmin Blanchette (Vrije Universiteit Amsterdam, the Netherlands) Supratik Chakraborty (IIT Bombay, India) Pedro D'Argenio (Universidad Nacional de Cordoba, Argentina) Jennifer Davis (Collins Aerospace, USA) David Deharbe (Federal University of Rio Grande do Norte, Brazil) Alexandre Duret-Lutz (Laboratoire de Recherche et Développement de l'Epita, France) Alessandro Fantechi (University of Florence, Italy) Alessio Ferrari (CNR, Italy) Hubert Garavel (INRIA, France) Pierre-Loic Garoche (ENAC, France) Klaus Havelund (JPL, USA) Jean-Baptiste Jeannin (University of Michigan, USA) Barbara Jobstmann (EPFL, Switzerland) Laura Kovac (TU Wien, Austria) Tiziana Margaria (University of Limerick and LERO, Ireland) Paolo Masci (NIA/NASA Langley, USA) Stefan Mitsch (CMU, USA) Rosemary Monahan (Maynooth University, Ireland) David Monniaux (VERIMAG, France) Sergio Mover (Ecole Politechnique, France) Yannick Moy (ADACORE, France) Jorge Navas (Certora, USA) Dejan Nickovic (Austrian Institute of Technology, Austria) Kristine Yvonne Rozier (Iowa State University, USA) Cristina Seceleanu (Malardalen University, Sweden) Martina Seidl (Johannes Kepler University, Austria) Jaco van de Pol (Aarhus University, Denmark) Alicia Villanueva (Universitat Politecnica de Valencia, Spain) Virginie Wiels (Onera, France) FMICS STEERING COMMITTEE: Maurice ter Beek (ISTI-CNR, Italy) Alessandro Fantechi (University of Florence, Italy) Hubert Garavel (INRIA, France) Tiziana Margaria (University of Limerick and LERO, Ireland) Radu Mateescu (INRIA, France) Jaco van de Pol (Aarhus University, Denmark) VENUE: As in previous years, FMICS 2023 is part of the CONFEST umbrella conference. In addition to FMICS, CONFEST also comprises CONCUR, FORMATS, and QEST, as well as workshops and tutorials. CONFEST will be held in Antwerp, Belgium on 18-23 September 2023. --- To opt-out from this mailing list, send an email to fm-announcements-request(a)lists.nasa.gov with the word 'unsubscribe' as subject or in the body. You can also make the request by contacting fm-announcements-owner(a)lists.nasa.gov

1 0

CiE 2023: CALL FOR PARTICIPATION - CALL FOR INFORMAL PRESENTATIONS
by acie＠acie.eu 10 May '23

10 May '23

# CiE 2023: CALL FOR PARTICIPATION ## Computability in Europe 2023: **Unity of Logic and Computation** Batumi, Georgia July 24-28, 2023 https://www.viam.science.tsu.ge/cie2023/ ## FORMAT The conference will have a **hybrid format**. At the same time, we strongly encourage in-person participation for a richer experience: There are direct flights to Batumi from Istanbul and Tel Aviv, among other airports. Hotels can be booked directly on the conference website (https://www.viam.science.tsu.ge/cie2023/) at a reduced rate. Batumi is located on the Black Sea coast close to the Turkish border. We suggest to book hotels as soon as possible, since Batumi is a well-appreciated touristic location, especially in July. Numerous travel advisory websites currently rank travel to Georgia as very safe. ## IMPORTANT DATES: * Early registration before: **June 18, 2023**. ## GENERAL INFORMATION CiE 2023 is the 19th conference organized by CiE (Computability in Europe), a European association of mathematicians, logicians, computer scientists, philosophers, physicists and others interested in new developments in computability and their underlying significance for the real world. Previous meetings have taken place in Amsterdam (2005), Swansea (2006), Siena (2007), Athens (2008), Heidelberg (2009), Ponta Delgada (2010), Sofia (2011), Cambridge (2012), Milan (2013), Budapest (2014), Bucharest (2015), Paris (2016), Turku (2017), Kiel (2018), Durham (2019), Salerno (2020, virtually), Ghent (2021, virtually), and Swansea (2022). ## TUTORIAL SPEAKERS * Ludovic Perret (Sorbonne University) * Ludovic Patey (Université Paris Diderot) ## INVITED SPEAKERS * Andrei Bulatov (Simon Fraser University) * Anne Condon (University of British Columbia) * Stephanie Dick (University of Pennsylvania) * Kirsten Eisenträger (Pennsylvania State University) * Neil Lutz (Iowa State University) * Mark Steedman (University of Edinburgh) ## SPECIAL SESSIONS The following special sessions will be part of the CiE 2023 activities: * Classical Theories of Degrees * Computational Science * Proof Theory * Scalable computational genomics * Weihrauch Complexity ## CONFERENCE TOPICS The CiE conferences serve as an interdisciplinary forum for research in all aspects of computability, foundations of computer science, logic, and theoretical computer science, as well as the interplay of these areas with practical issues in computer science and with other disciplines such as biology, mathematics, philosophy, or physics. ## PROGRAM COMMITTEE * Nikolay Bazhenov (Novosibirsk State University) * Manuel Bodirsky (TU Dresden) * Vasco Brattka (Bundeswehr-Universitaet Munich) * Liesbeth De Mol (University of Lille) * Gianluca Della Vedova (University of Milano-Bicocca, co-chair) * Besik Dundua (Kutaisi Intl University) * Juan Luis Gastaldi (ETH Zurich) * Thomas Graf (Stony Brook University) * Delaram Kahrobaei (CUNY) * Ekaterina Komendantskaya (Heriot-Watt University Edinburgh) * Angeliki Koutsoukou-Argyraki (Cambridge University) * Steffen Lempp (University of Wisconsin-Madison, co-chair) * Florin Manea (Goettingen University) * Klaus Meer (University Cottbus) * Isabel Oitavem (Nova University Lisbon) * Roland Omanadze (Ivane Javakhishvili Tbilisi State University) * Daniel Paulusma (Durham University) * Elaine Pimentel (University College London) * Markus Schmid (Humboldt University Berlin) * Shinnosuke Seki (University of Electro-Communications Tokyo) * Sebastiaan Terwijn (Radboud University Nijmegen) * Dan Turetsky (Victoria University of Wellington) * Linda Westrick (Pennsylvania State University) ## WOMEN IN COMPUTABILITY We are very happy to announce that within the framework of the Women in Computability program, we are able to offer some grants for junior women researchers who want to participate in CiE 2023. Applications for this grant should be sent to Liesbeth de Mol, liesbeth.de-mol(a)univ-lille.fr, before May 15, 2023 and include a short cv (at most 2 pages) and contact information for an academic reference. Preference will be given to junior women researchers who are presenting a paper (including informal presentations) at CiE 2023. [Association CiE](https://www.acie.eu) [CiE Conference Series](https://www.acie.eu/cie-conference-series/) ## HOSTED BY Both the in-person and the virtual aspects of the conference will be hosted by Batumi Shota Rustaveli State University Rustaveli str. 32, Batumi, Georgia. The conference will have a **hybrid format** that guarantees the highest possible level of interaction. We are grateful for support from Batumi Shota Rustaveli State University and Institute of Applied Mathematics, Tbilisi State University and from the Association for Symbolic Logic. ## ORGANIZING COMMITTEE * Davit Begashvili (Kutaisi International University) * Mikheil Donadze (Batumi Shota Rustaveli State University) * Besik Dundua (chair, Kutaisi International University and Institute of Applied Mathematics, Tbilisi State University) * Tsotne Mikadze (Kutaisi International University) * Mikheil Rukhaia (co-chair, Institute of Applied Mathematics, Tbilisi State University) * Lela Turmanidze (Batumi Shota Rustaveli State University) # CiE 2023: CALL FOR INFORMAL PRESENTATIONS ## Computability in Europe 2023: **Unity of Logic and Computation** ## IMPORTANT DATES: * Deadline for informal presentations submission: **June 8, 2023** (The notifications of acceptance for informal presentations will be sent a few days after submission.) ## INFORMAL PRESENTATIONS Continuing the tradition of past CiE conferences, we invite researchers to present informal presentations of their recent work. A proposal for an informal presentation must be submitted via EasyChair (https://easychair.org/conferences/?conf=cie2023), using the LNCS style file (available at https://www.springer.com/gp/computer-science/lncs/conference-proceedings-gu…), and be 1 page long; a brief description of the results suffices and an abstract is not required. Informal presentations will not be published in the LNCS conference proceedings. Results presented as informal presentations at CiE 2023 may appear or may have appeared in other conferences with formal proceedings and/or in journals. Since CiE 2023 will be a hybrid conference, informal presentations may be given remotely or in person.

1 0

FMCAD 2023: Final Call for Papers with *** Deadlines Extension ***
by Rozier, Kristin-Yvonne [AER E] 08 May '23

08 May '23

(apologies for multiple copies) ========================================================================================================== 2023 Formal Methods in Computer-Aided Design (FMCAD): Final Call for Papers with ***Deadlines Extension*** ========================================================================================================== GENERAL INFORMATION ------------------- Conference website:https://fmcad.org/FMCAD23/ Conference location: Ames, Iowa, USA Part of the FMCAD 2023 program: FMCAD Student Forum Co-located event: VSTTE 2023 (https://homepage.cs.uiowa.edu/~ajreynol/VSTTE2023/) IMPORTANT DATES (WITH ***DEADLINES EXTENSION***) ------------------------------------------------ Abstract Submission: May 15, 2023 (extended from May 8, 2023) Paper Submission: May 22, 2023 (extended from May 15, 2023) Author Response: June 29 - July 2, 2023 (postponed from June 22 - June 25, 2023) Author Notification: July 8, 2023 (postponed from July 1, 2023) Camera-Ready Version: August 14, 2023 Early Registration Deadline: September 28, 2023 All deadlines are 11:59 pm AoE (Anywhere on Earth) Conference Dates: October 23 - October 27, 2023, including: VSTTE: October 23, 2023 FMCAD/VSTTE Tutorial Day: October 24, 2023 FMCAD Regular Program: October 25 - October 27, 2023 CONFERENCE SCOPE AND PUBLICATION -------------------------------- FMCAD 2023 is the twenty-third in a series of conferences on the theory and applications of formal methods in hardware and system verification. FMCAD provides a leading forum to researchers in academia and industry for presenting and discussing groundbreaking methods, technologies, theoretical results, and tools for reasoning formally about computing systems. FMCAD covers formal aspects of computer-aided system design including verification, specification, synthesis, and testing. FMCAD employs a rigorous peer-review process. Accepted papers are published by TU Wien Academic Press under a Creative Commons license (the authors retain the copyright) and distributed through the IEEE XPlore digital library. There are no publication fees. At least one of the authors is required to register for the conference and present the accepted paper. TOPICS OF INTEREST ------------------ FMCAD welcomes submission of papers reporting original research on advances in all aspects of formal methods and their applications to computer- aided design. Topics of interest include (but are not limited to): - Model checking, theorem proving, equivalence checking, abstraction and reduction, compositional methods, decision procedures at the bit- and word-level, probabilistic methods, combinations of deductive methods and decision procedures. - Synthesis and compilation for computer system descriptions, modeling, specification, and implementation languages, formal semantics of languages and their subsets, model-based design, design derivation and transformation, correct-by-construction methods. - Application of formal and semi-formal methods to functional and non-functional specification and validation of hardware and software, including timing and power modeling, verification of computing systems on all levels of abstraction, system-level design and verification for embedded systems, cyber-physical systems, automotive systems and other safety-critical systems, hardware-software co-design and verification, and transaction-level verification. - Experience with the application of formal and semi-formal methods to industrial-scale designs; tools that represent formal verification enablement, new features, or a substantial improvement in the automation of formal methods. - Application of formal methods to verifying safety, connectivity and security properties of networks, distributed systems, smart contracts, block chains, and IoT devices. SUBMISSIONS ----------- Submissions must be made electronically in PDF format via CMT: https://cmt3.research.microsoft.com/fmcad2023/ Submissions are now open! Two categories of papers are invited: Regular papers, and Tool & Case Study papers. Regular papers are expected to offer novel foundational ideas, theoretical results, or algorithmic improvements to existing methods, along with experimental impact validation where applicable. Tool & Case Study papers are expected to report on the design, implementation or use of verification (or related) technology in a practically relevant context (which need not be industrial), and its impact on design processes. Both Regular and Tool & Case study papers must use the IEEE Transactions format on letter-size paper with a 10-point font size. Papers in both categories can be either 8 pages (long) or 4 pages (short) in length not including references. Short papers that describe emerging results, practical experiences, or original ideas that can be described succinctly are encouraged. Authors will be required to select an appropriate paper category at abstract submission time. Submissions may contain an optional appendix, which will not appear in the final version of the paper. The reviewers should be able to assess the quality and the relevance of the results in the paper without reading the appendix. Submissions in both categories must contain original research that has not been previously published, nor is concurrently submitted for publication. Any partial overlap with published or concurrently submitted papers must be clearly indicated. If experimental results are reported, authors are strongly encouraged to provide the reviewers access to their data at submission time, so that results can be independently verified. The review process is single blind. Authors of accepted contributions will be required to sign the FMCAD copyright transfer form found here:https://fmcad.or.at/pdf/copyright.pdf. STUDENT FORUM ------------- Continuing the tradition of the previous years, FMCAD 2023 is hosting a Student Forum that provides a platform for graduate students at any career stage to introduce their research to the wider Formal Methods community, and solicit feedback. Submissions for the event must be short reports describing research ideas or ongoing work that the student is currently pursuing, and must be within the scope of FMCAD. Work, part of which has been previously published, will be considered; the novel aspect to be addressed in future work must be clearly described in such cases. All submissions will be reviewed by a select group of FMCAD program committee members. FMCAD 2023 COMMITTEES --------------------- PROGRAM CHAIRS: Alexander Nadel, Intel Corporation and Technion, Israel Kristin Y. Rozier, Iowa State University, IA, USA PROGRAM COMMITTEE: Alessandro Abate, Oxford Guy Amir, Hebrew University Clark Barrett, Stanford University Per Bjesse, Synopsys Inc. Roderick Bloem, Graz University of Technology Ivana Cerna, Masaryk University Supratik Chakraborty, IIT Bombay Sylvain Conchon, Universite Paris-Sud Rayna Dimitrova, CISPA Helmholtz Center for Information Security Rohit Dureja, IBM Grigory Fedyukovich, Florida State University Mathias Fleury, University of Freiburg Amit Goel, Amazon Alberto Griggio, FBK Arie Gurfinkel, University of Waterloo Liana Hadarean, Amazon Web Services Ziyad Hanna, Cadence Design Systems William Harrison, Two Six Technologies Bo-Yuan Huang, Intel Alan Jović, University of Zagreb Daniela Kaufmann, TU Wien Tim King, Google Rebekah Leslie-Hurd, Cerebras Andreas Lööw, Imperial College London Kuldeep Meel, National University of Singapore Baoluo Meng, GE Research Naoko Okubo, Japan Aerospace Exploration Agency (JAXA) Andrew Reynolds, University of Iowa Philipp Ruemmer, University of Regensburg Cristoph Scholl, University of Freiburg Roberto Sebastiani, University of Trento Shaowei Cai, Chinese Academy of Sciences Natasha Sharygina, Università della Svizzera Italiana (USI Lugano) Christoph Sticksel, The Mathworks Christoph Torens, DLR Nestan Tsikaridze, Stanford University Yakir Vizel, Technion Georg Weissenbacher, TU Wien Michael Whalen, Amazon Web Services, Inc. Shufang Zhu, Oxford STUDENT FORUM CHAIRS: Mikoláš Janota, Czech Institute of Informatics, Robotics and Cybernetics (CIIRC), Czech Republic Nina Narodytska, Samsung Research America, CA, USA SPONSORSHIP CHAIR: Yoni Zohar, Bar Ilan University, Israel WEB CHAIR: Yogev Shalmon, Intel Corporation and the Open University, Israel PUBLICATION CHAIR: Georg Weissenbacher, TU Wien, Austria FMCAD STEERING COMMITTEE: Clark Barrett, Stanford University, CA, USA Armin Biere, University of Freiburg, Germany Ruzica Piskac, Yale University, CT, USA Anna Slobodova, Intel Corporation, TX, USA Georg Weissenbacher, TU Wien, Austria -- ____________________________________________________________ __ /\ \ \_____ / \ ###[==_____> / \ /_/ __ / __ \ \ \_____ | ( ) | ###[==_____> /| /\/\ |\ /_/ / | | | | \ / |=|==|=| \ Kristin Yvonne Rozier, Ph.D. / | | | | \ Associate Professor, Iowa State Univ / USA | ~||~ |NASA \ Departments of Aerospace Engineering, |______| ~~ |______| Computer Science, Mathematics, and (__||__) Electrical and Computer Engineering /_\ /_\ !!! !!! laboratory.temporallogic.org

1 0