==========================================================
CALL FOR (VIRTUAL) PARTICIPATION
iFM 2020
16th International Conference on integrated Formal Methods
16-20 November 2020, hosted virtually from Lugano, Switzerland
https://ifm20.si.usi.ch/
===========================================================
Due to the disruptions caused by the COVID-19 pandemic, iFM 2020 will be a virtual event.
To attend it, you should register by 9 November 2020.
=== Important dates ===
Registration deadline: 9 November 2020
Main conference: 18-20 November 2020
=== Invited speakers ===
- Edward A. Lee (University of California at Berkeley, United States)
- David Parker (University of Birmingham, United Kingdom)
- Hongseok Yang (School of Computing, KAIST, Korea)
=== Paper presentations ===
PALM: a technique for Process ALgebraic specification Mining
Sara Belluccini, Rocco De Nicola, Barbara Re and Francesco Tiezzi
Modular Integration of Crashsafe Caching into a Verified Virtual File System Switch
Stefan Bodenm��ller, Gerhard Schellhorn and Wolfgang Reif
Formal Verification of Executable Complementation and Equivalence Checking for B��chi Automata
Julian Brunner
Lock and Fence When Needed: State Space Exploration + Static Analysis = Improved Fence and Lock Insertion
Sander de Putter and Anton Wijs
Chain of events: Modular Process Models for the Law
S��ren Debois, Hugo A. L��pez, Tijs Slaats, Amine Abbad Andaloussi and Thomas Hildebrandt
An Event-B Based Generic Framework for Hybrid Systems Formal Modelling
Guillaume Dupont, Yamine Ait Ameur, Marc Pantel and Neeraj Singh
Grey-Box Learning of Register Automata
Bharat Garhewal, Frits Vaandrager, Falk Howar, Timo Schrijvers, Toon Lenaerts and Rob Smits
Active Objects with Deterministic Behaviour
Ludovic Henrio, Einar Broch Johnsen and Violet Ka I Pun
History-based Specification and Verification of Java Collections in KeY
Hans-Dieter Hiep, Jinting Bian, Frank De Boer and Stijn De Gouw
Algebra-based Loop Synthesis
Andreas Humenberger, Nikolaj Bjorner and Laura Kovacs
Meeduse: A Tool to Build and Run Proved DSLs
Akram Idani
Reformulation of SAT into a Polynomial Box-Constrained Optimization Problem (Short Paper)
St��phane Jacquet and Sylvain Hall��
Formal Policy Synthesis for Continuous-State Systems via Reinforcement Learning
Milad Kazemi and Sadegh Soudjani
Fast and Effective Well-Definedness Checking for Formal Models
Michael Leuschel
Detection of Polluting Test Objectives for Dataflow Criteria
Thibault Martin, Nikolai Kosmatov, Virgile Prevosto and Matthieu Lemerre
Clustering-Guided SMT(LRA) Learning
Tim Meywerk, Marcel Walter, Daniel Gro��e and Rolf Drechsler
Jaint: A Framework for User-Defined Dynamic Taint-Analyses based on Dynamic Symbolic Execution of Java Programs
Malte Mues, Till Schallau and Falk Howar
Synthesizing clock-efficient timed automata
Neda Saeedloei and Feliks Kluzniak
A Generic Approach to the Verification of the Permutation Property of Sequential and Parallel Swap-based Sorting Algorithms
Mohsen Safari and Marieke Huisman
Tight Error Analysis in Fixed-point Arithmetic
Stella Simic, Alberto Bemporad, Omar Inverso and Mirco Tribastone
Generating SPARK from Event-B Models
Sanjeevan Sritharan and Thai Son Hoang
Philosophers may Dine - Definitively!
Safouan Taha, Lina Ye and Burkhart Wolff
Automatic Generation of Guard-Stable Floating-Point Code
Laura Titolo, Mariano Moscato, Marco Antonio Feliu Gabaldon and Cesar Munoz
Formal methods for GPGPU programming: is the demand met?
Lars B. van den Haak, Anton Wijs, Mark van den Brand and Marieke Huisman
=== Organisation ===
= General chair =
Carlo A. Furia (USI Universit�� della Svizzera Italiana, Switzerland)
= PC chairs =
Brijesh Dongol (University of Surrey, UK)
Elena Troubitsyna (KTH -- Royal Institute of Technology, Sweden)
= Local Organisation =
Web Chair
Mohammad Rezaalipour (USI Universit�� della Svizzera italiana, CH)
Publicity Chair
Diego Marcilio (USI Universit�� della Svizzera italiana, CH)
Finance Chair
Elisa Larghi (USI Universit�� della Svizzera italiana, CH)
= Program committee =
Erika Abraham (RWTH, Aachen University, Germany)
Wolfgang Ahrendt (Chalmers University of Technology, Sweden)
Yamine Ait Ameur (IRIT/INPT-ENSEEIHT, France)
��tienne Andr�� (Universit�� de Lorraine, France)
Richard Banach (The University of Manchester, UK)
Maurice H. ter Beek (ISTI-CNR, Italy)
Pierre-Evariste Dagand (CNRS-LIP6, France)
Ferruccio Damiani (University of Torino, Italy)
John Derrick (University of Sheffield, UK)
Brijesh Dongol (University of Surrey, UK)
Marc Frappier (University of Sherbrooke, Canada)
Carlo A. Furia (USI Universit�� della Svizzera italiana, Switzerland)
Marieke Huisman (University of Twente, Netherlands)
Fuyuki Ishikawa (National Institute of Informatics, Japan)
Einar Broch Johnsen (University of Oslo, Norway)
Stephan Merz (Inria Nancy, France)
Paritosh Pandya (IIT Mumbai, India)
Patrizio Pelliccione (Chalmers University of Technology, Sweden)
Luigia Petre (��bo Akademi University, Finland)
R. Ramanujam (Institute of Mathematical Sciences, India)
Steve Schneider (University of Surrey, UK)
Emil Sekerinski (McMaster University, Canada)
Silvia Lizeth Tapia Tarifa (University of Oslo, Norway)
Stefano Tonetta (FBK, Italy)
Elena Troubitsyna (KTH, Sweden)
Juri Vain (Tallin Technical University, Estonia)
Tom���� Vojnar (Brno University of Technology, Czech Republic)
Farn Wang (NTU, Taiwan)
Heike Wehrheim (University of Paderborn, Germany)
Kirsten Winter (University of Queensland, Australia)
Naijun Zhan (Chinese Academy of Sciences, China)
LATA 2020 & 2021: 3rd call for papers*To be removed from our mailing list, please respond to this message with UNSUBSCRIBE in the subject line*
*******************************************************************************
14th-15th INTERNATIONAL CONFERENCE ON LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS
LATA 2020 & 2021
Milan, Italy
March 1-5, 2021
Co-organized by:
Department of Informatics, Systems and Communication
University of Milano-Bicocca
and
Institute for Research Development, Training and Advice
Brussels/London
https://irdta.eu/lata2020-2021/
*******************************************************************************
AIMS:
LATA is a conference series on theoretical computer science and its applications. LATA 2020 & 2021 will reserve significant room for young scholars at the beginning of their career. It will aim at attracting contributions from classical theory fields as well as application areas.
LATA 2020 & 2021 will merge the scheduled program for LATA 2020, which could not take place because of the Covid-19 crisis, with a new series of papers submitted on this occasion.
VENUE:
LATA 2020 & 2021 will be held in Milan, the third largest economy among European cities and one of the Four Motors for Europe. The venue will be:
University of Milano-Bicocca
Viale Piero e Alberto Pirelli 22
Building U6
Aula Mario Martini (Aula U6-04)
Milan
SCOPE:
Topics of either theoretical or applied interest include, but are not limited to:
algebraic language theory
algorithms for semi-structured data mining
algorithms on automata and words
automata and logic
automata for system analysis and programme verification
automata networks
automatic structures
codes
combinatorics on words
computational complexity
concurrency and Petri nets
data and image compression
descriptional complexity
foundations of finite state technology
foundations of XML
grammars (Chomsky hierarchy, contextual, unification, categorial, etc.)
grammatical inference, inductive inference and algorithmic learning
graphs and graph transformation
language varieties and semigroups
language-based cryptography
mathematical and logical foundations of programming methodologies
parallel and regulated rewriting
parsing
patterns
power series
string processing algorithms
symbolic dynamics
term rewriting
transducers
trees, tree languages and tree automata
weighted automata
STRUCTURE:
LATA 2020 & 2021 will consist of:
invited talks
peer-reviewed contributions
KEYNOTE SPEAKERS:
Eric Allender (Rutgers University), The New Complexity Landscape around Circuit Minimization
Laure Daviaud (City, University of London), About Decision Problems for Weighted Automata
Christoph Haase (University College London), Approaching Arithmetic Theories with Finite-state Automata
Artur Jeż (University of Wrocław), Recompression: Technique for Word Equations and Compressed Data
Jean-Éric Pin (CNRS), How to Prove that a Language Is Regular or Star-free?
Thomas Place (University of Bordeaux), Deciding Classes of Regular Languages: A Language Theoretic Point of View
PROGRAMME COMMITTEE:
Jorge Almeida (University of Porto, PT)
Franz Baader (Technical University of Dresden, DE)
Alessandro Barenghi (Polytechnic University of Milan, IT)
Marie-Pierre Béal (University of Paris-Est, FR)
Djamal Belazzougui (CERIST, DZ)
Marcello Bonsangue (Leiden University, NL)
Flavio Corradini (University of Camerino, IT)
Bruno Courcelle (University of Bordeaux, FR)
Laurent Doyen (ENS Paris-Saclay, FR)
Manfred Droste (Leipzig University, DE)
Rudolf Freund (Technical University of Vienna, AT)
Paweł Gawrychowski (University of Wrocław, PL)
Amélie Gheerbrant (Paris Diderot University, FR)
Tero Harju (University of Turku, FI)
Lane A. Hemaspaandra (University of Rochester, US)
Jarkko Kari (University of Turku, FI)
Dexter Kozen (Cornell University, US)
Markus Lohrey (University of Siegen, DE)
Parthasarathy Madhusudan (University of Illinois, Urbana-Champaign, US)
Sebastian Maneth (University of Bremen, DE)
Nicolas Markey (IRISA, Rennes, FR)
Carlos Martín-Vide (Rovira i Virgili University, ES, chair)
Giancarlo Mauri (University of Milano-Bicocca, IT)
Victor Mitrana (University of Bucharest, RO)
Paliath Narendran (University at Albany, US)
Gennaro Parlato (University of Molise, IT)
Dominique Perrin (University of Paris-Est, FR)
Nir Piterman (Chalmers University of Technology, SE)
Sanguthevar Rajasekaran (University of Connecticut, US)
Antonio Restivo (University of Palermo, IT)
Wojciech Rytter (University of Warsaw, PL)
Kai Salomaa (Queen’s University, CA)
Helmut Seidl (Technical University of Munich, DE)
William F. Smyth (McMaster University, CA)
Jiří Srba (Aalborg University, DK)
Edward Stabler (University of California, Los Angeles, US)
Benjamin Steinberg (City University of New York, US)
Frank Stephan (National University of Singapore, SG)
Jan van Leeuwen (Utrecht University, NL)
Margus Veanes (Microsoft Research, US)
Mikhail Volkov (Ural Federal University, RU)
ORGANIZING COMMITTEE:
Alberto Leporati (Milan, co-chair)
Sara Morales (Brussels)
Manuel Parra-Royón (Granada)
Rafael Peñaloza Nyssen (Milan)
Dana Shapira (Ariel)
David Silva (London, co-chair)
Bianca Truthe (Giessen)
Claudio Zandron (Milan, co-chair)
SUBMISSIONS:
Authors are invited to submit non-anonymized papers in English presenting original and unpublished research. Papers should not exceed 12 single-spaced pages (all included) and should be prepared according to the standard format for Springer Verlag's LNCS series (see http://www.springer.com/computer/lncs?SGWID=0-164-6-793341-0). If necessary, exceptionally authors are allowed to provide missing proofs in a clearly marked appendix.
Upload submissions to:
https://easychair.org/conferences/?conf=lata20202021
PUBLICATIONS:
A volume of proceedings published by Springer in the LNCS series will be available by the time of the conference.
A special issue of Information and Computation (Elsevier, 2019 JCR impact factor: 0.872) will be later published containing peer-reviewed substantially extended versions of some of the papers contributed to the conference. Submissions to it will be by invitation.
REGISTRATION:
The registration form can be found at:
https://irdta.eu/lata2020-2021/registration/
DEADLINES (all at 23:59 CET):
Paper submission: October 19, 2020
Notification of paper acceptance or rejection: November 23, 2020
Final version of the paper for the LNCS proceedings: November 30, 2020
Early registration: November 30, 2020
Late registration: February 15, 2021
Submission to the journal special issue: June 5, 2021
QUESTIONS AND FURTHER INFORMATION:
david (at) irdta.eu
ACKNOWLEDGMENTS:
Università degli Studi di Milano-Bicocca
IRDTA – Institute for Research Development, Training and Advice, Brussels/London