D-CON

d-con@lists.rwth-aachen.de

321 Diskussionen

FORTE 2021: Last CfP

von Willemse, T.A.C.

******************************************************************************************** *FORTE 2021* <https://www.discotec.org/2021/forte> - 41st International Conference on Formal Techniques for Distributed Objects, Components, and Systems June 14-18, 2021, Valletta, Malta FORTE 2021 is one of the three conferences of DisCoTec 2021 <https://www.discotec.org/2021/>, the 16th International Federated Conference on Distributed Computing Techniques ****************************************************************************************** *Important dates* January 29, 2021 - abstract submission February 5, 2021 - paper submission April 2, 2021 - notification April 23, 2021 - camera ready See the conference website for up-to-date information. *Keynote Speakers* - Gilles Fedak, iExec, FR - Mira Mezini, Technical University of Darmstadt, DE - Alexandra Silva, University College London, UK *Scope* FORTE 2021 is a forum for fundamental research on theory, models, tools, and applications for distributed systems. The conference solicits original contributions that advance the science and technology for distributed systems, with special interest in: - Software quality, reliability, availability, and safety - Security, privacy, and trust in distributed and/or communicating systems - Service-oriented, ubiquitous, and cloud computing systems - Component- and model-based design - Object technology, modularity, software adaptation - Self-stabilization and self-healing/organizing - Verification, validation, formal analysis, and testing of the above. Aligned with the above, FORTE covers *models and formal specification*, *testing* and *verification methods* for distributed computing. Application domains are multiple, and include all kinds of application-level distributed systems, telecommunication services, Internet, embedded and real-time systems, as well as networking and communication security and reliability. Contributions that *combine theory and practice* and that exploit formal methods and theoretical foundations to present novel solutions to problems arising from the development of distributed systems are very much encouraged. *Main Topics of Interest* Topics of interest include but are not limited to: - *Languages and semantic foundations* New modeling and language concepts for distribution and concurrency; semantics for different types of languages, including programming languages, modeling languages, and domain-specific languages; real-time and probability aspects - *Formal methods and techniques* Design, specification, analysis, verification, validation, testing and runtime verification of various types of distributed systems, including communications and network protocols, service-oriented systems, adaptive distributed systems, cyber-physical systems and sensor networks - *Foundations of security* New principles for qualitative and quantitative security analysis of distributed systems, including formal models based on probabilistic concepts - *Applications of formal methods* Applying formal methods and techniques for studying quality, reliability, availability, and safety of distributed systems - *Practical experience with formal methods* Industrial applications, case studies and software tools for applying formal methods and description techniques to the development and analysis of real distributed systems. - *Emerging challenges and hot topics in distributed systems* (broadly construed) Formal specification, verification and analysis of emerging systems and applications, such as, for instance, software-defined networks, distributed ledgers, smart contracts, and blockchain technologies. *Submission Guidelines* Contributions must be written in English according to one of the three categories described below. They should report on original, unpublished work, not submitted for publication elsewhere (cf. IFIP codes of conduct <http://www.ifip.org/index.php?option=com_content&task=view&id=219&Itemid=564>, under Links). Submissions must be prepared as a PDF using Springer’s LNCS style. Submissions not adhering to the specified constraints of their respective category may be rejected without review. *Submission Categories* FORTE accepts contributions in three categories: *full papers*, *short papers*, and *journal-first papers*. These categories and their associated criteria are described in detail below. Notice that *short* and *journal-first* papers must be explicitly marked as such in the submission’s title. * Full papers * (page limit: up to 15 pages + 2 pages references) A full paper submission describes thorough and complete research results in the scope of the conference. * Short papers * (page limit: up to 6 pages + 2 pages references) A short paper submission can be one of the following: - *Rough diamonds*: Extended abstracts presenting innovative and promising ideas, possibly in an early form and without supporting evidence. - *Tool (demonstration) papers*: Extended abstracts describing (or demonstrating) new tools (or tool components) that implement (or build upon) theoretical foundations. - *Position papers* : Extended abstracts describing (i) calls to action, or (ii) substantiated reflections on current and/or future research perspectives related to FORTE. Short paper submissions must be marked as such in the submission’s title. * "Journal First" papers* (page limit: up to 4 pages, including references) This category aims at including published journal papers in the FORTE 2020 program. The objective is to offer FORTE attendees a richer program and further opportunities for interaction. Authors of published papers in high-quality journals can submit a proposal to present their journal paper in FORTE. The journal paper must adhere to the following four criteria: - It should be clearly in the scope of the conference. - It should be recent: only journal papers available after January 1, 2019 (online or paper) can be presented. - It reports new research results that significantly extend prior work. As such, the journal paper does not simply extend prior work with material presented for completeness only (such as omitted proofs, algorithms, minor enhancements, or empirical results). - It has not been presented at, and is not under consideration for, journal-first programs of other similar conferences or workshops. A journal-first submission is a concise but compelling summary of the published journal paper, which makes it clear why a related presentation would enrich the program of FORTE. Journal-first submissions must be marked as such in the submission’s title, and must explicitly include pointers to the journal publication (such as a DOI) but also to related conference and workshop papers, as appropriate. They will be judged on the basis of the above criteria, but also considering relevance and the potential of enriching and complementing the conference program. *Publication* All accepted papers, including short papers and journal-first submissions, will be published in the FORTE 2021 formal proceedings, which will appear in Springer’s LNCS-IFIP volume series. *Special Issue* Selected papers will be invited to a special issue of *Logical Methods in Computer Science* <https://lmcs.episciences.org/>. *Submission Link* https://easychair.org/conferences/?conf=forte21 *Program committee chairs* - Kirstin Peters (TU Darmstadt, DE) - Tim Willemse (Eindhoven University of Technology, NL) *Program committee members* - Luís Soares Barbosa (University of Minho) - Jiri Barnat (Masaryk University) - Pedro R.D'Argenio (Universidad Nacional de Córdoba) - Mila Dalla Preda (University of Verona) - Wan Fokkink (Vrije Universiteit Amsterdam) - Daniele Gorla (University of Rome "La Sapienza") - Artem Khyzha (Tel Aviv University) - Barbara König (University of Duisburg-Essen) - Bas Luttik (Eindhoven University of Technology) - Stephan Merz (Inria Nancy) - Roland Meyer (TU Braunschweig) - Mohammadreza Mousavi (University of Leicester) - Thomas Neele (Royal Holloway, University of London) - Ana-Maria Oprescu (University of Amsterdam) - Catuscia Palamidessi (INRIA) - Anna Philippou (University of Cyprus) - Jorge A.Pérez (University of Groningen) - Anne Remke (WWU Münster) - Kristin Yvonne Rozier (Iowa State University) - Cristina Seceleanu (Mälardalen University) - Maurice H. ter Beek (ISTI-CNR, Pisa) - Simone Tini (University of Insubria) - Rob van Glabbeek (Data61 - CSIRO) - Björn Victor (Uppsala University) - Georg Weissenbacher (Vienna University of Technology) *Steering committee* - Ahmed Bouajjani (University Paris Diderot, France) - Christel Baier (University Dresden, Germany) - Frank de Boer (CWI, Netherlands) - Luís Caires (Universidade Nova de Lisboa, Portugal) - Einar Broch Johnsen (University of Oslo, Norway) - Ivan Lanese (University of Bologna/INRIA, Italy – Chair) - Jorge A. Pérez (University of Groningen, The Netherlands) - Alexandra Silva (University College London, UK) - Ana Sokolova (University of Salzburg, Austria) - Jean-Bernard Stefani (INRIA, France) - Nobuko Yoshida (Imperial College London, UK) - Heike Wehrheim (Paderborn University, Germany) *More Information* For additional information, please contact the Program Committee Co-chairs: forte21 at easychair dot org

3 Jahre, 3 Monate

RWTH Junior Principal Investigator Fellowships

von Joost-Pieter Katoen

[Apologies for multiple copies.] Are you a young rising star in computer science, obtained your PhD less than 3 years ago and spent at least 2 years outside Germany? Then: consider to apply for a Junior Principal Investigator Fellowship at RWTH Aachen University, one of the top universities in Germany. Application deadline: February 9, 2021. What do we offer? Among others: a. A junior research group leader for 4 years (possibly 5 years). b. Funding for one full-time doctoral candidate. c. A research budget for consumables. d. The opportunity to supervise doctoral candidates e. Mentoring and career development support. More information including application requirements at: https://www.rwth-aachen.de/cms/root/Forschung/Angebote-fuer-Forschende/RWTH… CS@RWTH top notch? Check the information at: https://www.informatik.rwth-aachen.de/cms/Informatik/Fachgruppe/Auszeichnun…

3 Jahre, 3 Monate

Organisatorisches und Frohe Weihnachten

von Roland Meyer

Liebe Freundinnen und Freunde der D-CON, ich hoffe, Ihr seid in dieser schweren Zeit bei guter Gesundheit, habt die letzten Dinge erledigt und freut Euch auf erholsame Weihnachtstage. Sicher fragt Ihr Euch, was aus unserer D-CON im Jahr 2021 wird. Derzeit sind wir gezwungen, das Treffen auf den Herbst zu verlegen. Eine online D-CON macht sicher keinen Sinn - ein wichtiger Aspekt des Treffens ist doch der persönliche Austausch. Was die Terminplanung der D-CON 2021 angeht, werden wir die Entwicklung der COVID-19-Lage abwarten müssen. Wir hatten beim letzten Treffen besprochen, die Wahl des Leitungsgremiums unserer Fachgruppe durchzuführen. Mit dieser Mail möchte ich weitere Kandidaturen erfragen. Bitte schickt mir einfach eine Mitteilung per Mail. Zur Kandidatur ist eine Mitgliedschaft in der Fachgruppe erforderlich. Lasst mich kurz den Stand der Dinge wiederholen. Zur Wahl stehen: Jens Gutsfeld (WWU Münster), Tobias Heindel (TU Berlin), Roland Meyer (TU Braunschweig, Sprecher), Thomas Noll (RWTH Aachen), Kirstin Peters (TU Darmstadt, stellv. Sprecherin). Die derzeitigen Mitglieder des Leitungsgremiums (Barbara, Gerald und Markus), können leider nicht wiedergewählt werden. Es gab ein Treffen des GI-Fachbereichs "Grundlagen der Informatik", dem unsere Fachgruppe angehört. - Das Gebiet "Quantum Computing" hat sich vorgestellt, wurde als Arbeitsgruppe zugelassen und wird nach einem Jahr evaluiert. - Die Aktivitäten der Fachgruppen wurden besprochen, ausstehende Wahlen wurden angemahnt. Unsere Fachgruppe wurde uneingeschränkt positiv gesehen. - Es wird ein neues Open-Access Theorie-Journal geben. Unsere Fachgruppe ist beteiligt (Joost-Pieter). - Es wurde eine Wahl zur Leitung des Fachbereichs durchgeführt. Die Kollegen Vollmer (Sprecher) und Scheideler (stellv. Sprecher) wurden wiedergewählt. Ein Blick auf die Publikationen sagt mir, dass unsere Fachgruppe auch in diesem Jahr sehr erfolgreich war. Das betrifft nicht nur die CONCUR und die ETAPS-Konferenzen, bei denen wir nahezu routinemäßig vertreten sind, auch bei den Theorie-Konferenzen ICALP/LICS sowie bei CAV/POPL waren zahlreiche Paper dabei. Herzlichen Glückwunsch an alle! Ich wünsche Euch ein frohes Weihnachtsfest und einen guten Start in ein gesundes Jahr 2021!!! Roland -- Prof. Dr. Roland Meyer TU Braunschweig Institut für Theoretische Informatik Mühlenpfordtstr. 23, 346 38106 Braunschweig Phone: +49 (0)531 391 9524 Fax: +49 (0)531 391 9529 Web: http://www.tcs.cs.tu-bs.de

3 Jahre, 4 Monate

FORTE 2021: First CFP

von Kirstin Peters

******************************************************************************************** *FORTE 2021* <https://www.discotec.org/2021/forte <https://www.discotec.org/2020/forte>> - 41st International Conference on Formal Techniques for Distributed Objects, Components, and Systems June 14-18, 2021, Valletta, Malta FORTE 2021 is one of the three conferences of DisCoTec 2021 <https://www.discotec.org/2021/ <https://www.discotec.org/2020/>>, the 16th International Federated Conference on Distributed Computing Techniques ****************************************************************************************** *Important dates* January 29, 2021 - abstract submission February 5, 2021 - paper submission April 2, 2021 - notification April 23, 2021 - camera ready *Keynote Speakers* Gilles Fedak <https://fr.linkedin.com/in/gilles-fedak-4a303a5b>, iExec, FR Mira Mezini <https://www.stg.tu-darmstadt.de/staff/mira_mezini/>, Technical University of Darmstadt, DE Alexandra Silva <https://alexandrasilva.org/#/main.html>, University College London, UK *Scope* FORTE 2021 is a forum for fundamental research on theory, models, tools, and applications for distributed systems. The conference solicits original contributions that advance the science and technology for distributed systems, with special interest in: - Software quality, reliability, availability, and safety - Security, privacy, and trust in distributed and/or communicating systems - Service-oriented, ubiquitous, and cloud computing systems - Component- and model-based design - Object technology, modularity, software adaptation - Self-stabilization and self-healing/organizing - Verification, validation, formal analysis, and testing of the above. Aligned with the above, FORTE covers *models and formal specification*, *testing* and *verification methods* for distributed computing. Application domains are multiple, and include all kinds of application-level distributed systems, telecommunication services, Internet, embedded and real-time systems, as well as networking and communication security and reliability. Contributions that *combine theory and practice* and that exploit formal methods and theoretical foundations to present novel solutions to problems arising from the development of distributed systems are very much encouraged. *Main Topics of Interest* Topics of interest include but are not limited to: - *Languages and semantic foundations* New modeling and language concepts for distribution and concurrency; semantics for different types of languages, including programming languages, modeling languages, and domain-specific languages; real-time and probability aspects - *Formal methods and techniques* Design, specification, analysis, verification, validation, testing and runtime verification of various types of distributed systems, including communications and network protocols, service-oriented systems, adaptive distributed systems, cyber-physical systems and sensor networks - *Foundations of security* New principles for qualitative and quantitative security analysis of distributed systems, including formal models based on probabilistic concepts - *Applications of formal methods* Applying formal methods and techniques for studying quality, reliability, availability, and safety of distributed systems - *Practical experience with formal methods* Industrial applications, case studies and software tools for applying formal methods and description techniques to the development and analysis of real distributed systems. - *Emerging challenges and hot topics in distributed systems* (broadly construed) Formal specification, verification and analysis of emerging systems and applications, such as, for instance, software-defined networks, distributed ledgers, smart contracts, and blockchain technologies. *Submission Guidelines* Contributions must be written in English according to one of the three categories described below. They should report on original, unpublished work, not submitted for publication elsewhere (cf. IFIP codes of conduct <http://www.ifip.org/index.php?option=com_content&task=view&id=219&Itemid=564>, under Links). Submissions must be prepared as a PDF using Springer’s LNCS style. Submissions not adhering to the specified constraints of their respective category may be rejected without review. *Submission Categories* FORTE accepts contributions in three categories: *full papers*, *short papers*, and *journal-first papers*. These categories and their associated criteria are described in detail below. Notice that *short* and *journal-first* papers must be explicitly marked as such in the submission’s title. *Full papers* (page limit: up to 15 pages + 2 pages references) A full paper submission describes thorough and complete research results in the scope of the conference. *Short papers* (page limit: up to 6 pages + 2 pages references) A short paper submission can be one of the following: - *Rough diamonds*: Extended abstracts presenting innovative and promising ideas, possibly in an early form and without supporting evidence. - *Tool (demonstration) papers*: Extended abstracts describing (or demonstrating) new tools (or tool components) that implement (or build upon) theoretical foundations. - *Position papers* : Extended abstracts describing (i) calls to action, or (ii) substantiated reflections on current and/or future research perspectives related to FORTE. Short paper submissions must be marked as such in the submission’s title. *“Journal First” papers* (page limit: up to 4 pages, including references) This category aims at including published journal papers in the FORTE 2020 program. The objective is to offer FORTE attendees a richer program and further opportunities for interaction. Authors of published papers in high-quality journals can submit a proposal to present their journal paper in FORTE. The journal paper must adhere to the following four criteria: - It should be clearly in the scope of the conference. - It should be recent: only journal papers available after January 1, 2019 (online or paper) can be presented. - It reports new research results that significantly extend prior work. As such, the journal paper does not simply extend prior work with material presented for completeness only (such as omitted proofs, algorithms, minor enhancements, or empirical results). - It has not been presented at, and is not under consideration for, journal-first programs of other similar conferences or workshops. A journal-first submission is a concise but compelling summary of the published journal paper, which makes it clear why a related presentation would enrich the program of FORTE. Journal-first submissions must be marked as such in the submission’s title, and must explicitly include pointers to the journal publication (such as a DOI) but also to related conference and workshop papers, as appropriate. They will be judged on the basis of the above criteria, but also considering relevance and the potential of enriching and complementing the conference program. *Publication* All accepted papers, including short papers and journal-first submissions, will be published in the FORTE 2021 formal proceedings, which will appear in Springer’s LNCS-IFIP volume series. *Special Issue* Selected papers will be invited to a special issue of *Logical Methods in Computer Science* <https://lmcs.episciences.org/>. *Submission Link* https://easychair.org/conferences/?conf=forte21 *Program committee chairs* - Kirstin Peters (TU Darmstadt, DE) - Tim Willemse <https://www.win.tue.nl/~timw/index.php> (Eindhoven University of Technology, NL) *Program committee members* - Luís Soares Barbosa (University of Minho) - Jiri Barnat (Masaryk University) - Pedro R.D'Argenio (Universidad Nacional de Córdoba) - Mila Dalla Preda (University of Verona) - Wan Fokkink (Vrije Universiteit Amsterdam) - Daniele Gorla (University of Rome "La Sapienza") - Artem Khyzha (Tel Aviv University) - Barbara König (University of Duisburg-Essen) - Bas Luttik (Eindhoven University of Technology) - Stephan Merz (Inria Nancy) - Roland Meyer (TU Braunschweig) - Mohammadreza Mousavi (University of Leicester) - Thomas Neele (Royal Holloway, University of London) - Ana-Maria Oprescu (University of Amsterdam) - Catuscia Palamidessi (INRIA) - Anna Philippou (University of Cyprus) - Jorge A.Pérez (University of Groningen) - Anne Remke (WWU Münster) - Kristin Yvonne Rozier (Iowa State University) - Cristina Seceleanu (Mälardalen University) - Maurice H. ter Beek (ISTI-CNR, Pisa) - Simone Tini (University of Insubria) - Rob van Glabbeek (Data61 - CSIRO) - Björn Victor (Uppsala University) - Georg Weissenbacher (Vienna University of Technology) *Steering committee* - Ahmed Bouajjani (University Paris Diderot, France) - Christel Baier (University Dresden, Germany) - Frank de Boer (CWI, Netherlands) - Luís Caires (Universidade Nova de Lisboa, Portugal) - Einar Broch Johnsen (University of Oslo, Norway) - Ivan Lanese (University of Bologna/INRIA, Italy – Chair) - Jorge A. Pérez (University of Groningen, The Netherlands) - Alexandra Silva (University College London, UK) - Ana Sokolova (University of Salzburg, Austria) - Jean-Bernard Stefani (INRIA, France) - Nobuko Yoshida (Imperial College London, UK) - Heike Wehrheim (Paderborn University, Germany) *More Information* For additional information, please contact the Program Committee Co-chairs: forte21 at easychair dot org

3 Jahre, 4 Monate

RWTH Junior Principal Investigator Fellowships

von Joost-Pieter Katoen

[Apologies for multiple copies.] Are you a young rising star in computer science, obtained your PhD less than 3 years ago and spent 2 years outside Germany? Then: consider to apply for a Junior Principal Investigator Fellowship at RWTH Aachen University, one of the top universities in Germany. Application deadline: February 9, 2021. What do we offer? Among others: a. A junior research group leader for 4 years (possibly 5 years). b. Funding for one full-time doctoral candidate. c. A research budget for consumables. d. The opportunity to supervise doctoral candidates e. Mentoring and career development support. More information including application requirements at: https://www.rwth-aachen.de/cms/root/Forschung/Angebote-fuer-Forschende/RWTH… CS@RWTH top notch? Check the information at: https://www.informatik.rwth-aachen.de/cms/Informatik/Fachgruppe/Auszeichnun…

3 Jahre, 4 Monate

LATA 2020 & 2021: extended submission deadline October 26

von IRDTA

LATA 2020 & 2021: extended submission deadline October 26*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/ ******************************************************************************* * Extended submission deadline: October 26 * 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 26, 2020 – EXTENDED - 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

3 Jahre, 6 Monate

LATA 2020 & 2021: 3rd call for papers

von IRDTA

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

3 Jahre, 6 Monate

Several Ph.D. positions in Algorithms, Verification and Logic for Uncertainty and Randomness

von Joost-Pieter Katoen

====================================================================== Various Open Positions for Research Assistants/Associates in the post-graduate program UnRAVeL “Uncertainty and Randomness in Algorithms, Verification and Logic” at RWTH Aachen University, Aachen, Germany https://www.unravel.rwth-aachen.de/ ====================================================================== Context. The RWTH Aachen University is looking for enthusiastic and highly qualified doctoral researchers. Various positions are available within the interdisciplinary Research Training Group (RTG) UnRAVeL founded by Deutsche Forschungsgemeinschaft (DFG). The key emphasis of an RTG is on the qualification of doctoral researchers with a focused research program and a structured training strategy. The RTG UnRAVeL aims to significantly advance probabilistic modelling and analysis for uncertainty by developing new theories, algorithms, and tool-supported verification techniques, and to apply them to core problems from security (e.g., probabilistic protocols), planning (robotics and railway engineering), and safety and performance analysis (railway systems). To tackle these research challenges, theoretical computer scientists from computer-aided verification, automata, logic and games, algorithms and complexity, together with experts from management science (robust optimization), applied computer science (robotics and security), and railway engineering intensively cooperate within the RTG UnRAVeL. Required profile. Candidates must have (or soon obtain) a master degree in Computer Science, Mathematics or related area and have completed their studies with excellent grades. You should have interest in performing original, highly competitive scientific research, publishing your results in top conferences and scientific journals. Self-motivation and the ability to work both independently and as a team player in local and international research groups are expected. Fluency in English is required; proficiency in German is helpful but not compulsory. How to apply? Your written application should contain: - a curriculum vitae - a transcript of records (list of courses and grades) - a cover letter including a statement of interest in (some of) the RTG topics (Algorithms and Complexity, Verification, Logic, or Application Scenarios) that can be found on our web-site, and - a recommendation letter e.g., by your master thesis supervisor(s). All documents should be formatted as a single pdf-file. You should send your application ultimately by ** October 30, 2020 (AoE) ** to the e-mail address: unravel-appl(a)cs.rwth-aachen.de. We check applications once they are received, and will conduct interview until our vacancies are filled. What do we offer? We offer a stimulating international research environment, the possibility to participate in highly competitive and interdisciplinary research and the opportunity to involve students in your research through project work. Doctoral researchers have a status as employee with a salary according to the German federal employee scale TV-L E13; the exact salary is subject to your family situation. The duration of the positions is three years. RWTH Aachen University offers excellent facilities for professional and personal development. Starting date of the positions: January 1, 2021 and June 1, 2021. Enquiries can be directed to Prof. Joost-Pieter Katoen (e-mail: katoen(a)cs.rwth-aachen.de). RWTH Aachen University is certified as a “Family-Friendly University”. We particularly welcome and encourage applications from women, disabled persons and ethnic minority groups, recognizing they are underrepresented across RWTH Aachen University. The principles of fair and open competition apply and appointments will be made on merit.

3 Jahre, 7 Monate

PhD/Post-Doc positions at the University of Duisburg-Essen

von Barbara Koenig

The Theoretical Computer Science Group (Prof. Barbara Koenig) at the University of Duisburg-Essen, Campus Duisburg (Germany) has two open PhD positions paid according to TV-L 13 (full-time). The first position (no. 604-20) is in the DFG project SpeQt ("Spectra of Behavioural Distances and Quantitative Logics"), which has recently been granted by the German Research Foundation. This is a joint project with Prof. Lutz Schröder at the University of Erlangen-Nürnberg. A project description is attached below. The second position (no. 605-20) is not associated with a specific project. The PhD thesis topic will be in the area of modelling and verification of concurrent systems. You can apply for one or both positions. For both positions, candidates at post-doc level can also be considered. Due to the Covid-19 pandemic universities in Germany are partially closed. However, there is the possibility to meet and work at the university, observing the current Corona regulations. There is of course the possibility to do the job interview virtually. Requirements ------------ You should have or should be in the process of obtaining an MSc or equivalent degree (in Computer Science or Mathematics). Prior knowledge about the topics of the projects is considered an advantage. Good English speaking and writing skills are demanded, as well as the willingness to learn German. For a post-doc position you should have or should be in the process of obtaining a PhD. The application deadline is 8th October 2020. https://www.uni-due.de/theoinf/index_en.php ====================================================================== Your Application ---------------- You can obtain further information by adressing your enquiries to: Barbara Koenig barbara_koenig(a)uni-due.de tel.: ++49-203-3793397 If you are interested in the position, please send your application. Your application should include: * A description of your interest in the position, including your motivation and specific qualifications. * A curriculum vitae, including an abstract of your graduate thesis and the name of your supervisor. * If you are interested in a post-doc position, please include a list of your publications and the names of possible referees. Please send your application directly to me (barbara_koenig(a)uni-due.de). ---------------------------------------------------------------------- DFG Project SpeQt - Spectra of Behavioural Distances and Quantitative Logics ---------------------------------------------------------------------- One of the central topics in the study of concurrent systems are notions of system equivalence, which define when two given system states have the same behaviour in a given sense. Classically, i.e. over relational transition systems, such system semantics range on a spectrum between branching-time and linear-time equivalences, with each equivalence reflecting a notion of possible interaction with systems, and characterized by a dedicated modal logic. In this setting, equivalences and logics are two-valued, i.e. two states are either equivalent or inequivalent, and a formula is either satisfied or not satisfied in a given state. For systems involving quantitative data, such as probabilities, weights, or more generally values in some metric space, it has been recognized that quantitative notions of equivalence, i.e. behavioural distances, and quantitative logics are more suitable for some purposes, and enable a more fine-grained analysis. For instance, while two states in Markov chains with small differences in their transition probabilities are just inequivalent under two-valued probabilistic bisimilarity, a suitable behavioural distance will retain the information that the two states are not exactly equivalent but still quite similar. As indicated above, behavioural distances by their very nature apply to settings that deviate from the classical relational model; these settings are generally less standardized and vary quite widely. This creates a need for uniform methods that apply to many system types at once. For branching-time behavioural metrics, we have developed such methods in earlier work within the framework of universal coalgebra, which encapsulates system types as functors and systems as coalgebras for the given type functor. The objective of SpeQt is to additionally parametrize these methods over the system semantics, thus providing support for spectra of behavioural distances in coalgebraic generality. The key tool we foresee for such a parametrization are graded monads, which we have successfully used in earlier work to parametrize two-valued equivalences. Central research goals include game-theoretic and logical characterization and efficient calculation of distances. Our results will enable us to derive such logics, games and algorithms in a principled way for a whole range of different types of transition systems and for the full spectrum between branching-time and linear-time semantics. We plan to test and evaluate the resulting algorithms in case studies centered around conformance testing of hybrid systems and differential privacy.

3 Jahre, 7 Monate

LATA 2020 & 2021: 1st call for papers

von IRDTA

LATA 2020 & 2021: 1st call for papers*To be removed from our mailing list, please respond to this message with UNSUBSCRIBE in the subject line* ************************************************************************* 14th 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

3 Jahre, 8 Monate

← Neuer
1
2
3
4
5
6
7
8
...
33
Älter →

Springe zur Seite:

2024

2023

2022

2021

2020

2019

2018

2017

2016

2015

2014

2013

2012

2011

2010

2009

2008

D-CON