D-CON März 2017

d-con@lists.rwth-aachen.de

3 Teilnehmer
4 Diskussionen

2nd CfP - CONCUR 2017

von Kirstin Peters

============================================================================ CONCUR 2017 - Second Call for Papers 28th International Conference on Concurrency Theory September 5-8, 2017, Berlin, Germany https://www.concur2017.tu-berlin.de/ ============================================================================ The purpose of the CONCUR conferences is to bring together researchers, developers, and students in order to advance the theory of concurrency, and promote its applications. TUTORIALS - Alastair Donaldson (Imperial College London, UK) - Pawel Sobocinski (University of Southampton, UK) - Viktor Vafeiadis (Max Planck Institute for Software Systems, Germany) INVITED SPEAKERS - Hongseok Yang (University of Oxford, UK) - Azahdeh Farzan (University of Toronto, Canada) - Madan Musuvathi (Microsoft Research, USA) - Jean-Francois Raskin (Université libre de Bruxelles, Belgium) CO-LOCATED EVENTS 14th International Conference on Quantitative Evaluation of SysTems (QEST 2017) 15th International Conference on Formal Modelling and Analysis of Timed Systems (FORMATS 2017) 14th European Performance Engineering Workshop (EPEW 2017) WORKSHOPS - EXPRESS/SOS - MeMo - RADICAL - TRENDS - YR-CONCUR ============================================================================ IMPORTANT DATES (AoE in 2017) Paper Submission: April 21 (firm deadline) Paper Notification: June 16 Camera Ready Copy Due: July 7 CONCUR 2017: September 5-8 TOPICS Submissions are solicited in semantics, logics, verification and analysis of concurrent systems. The principal topics include (but are not limited to): - Basic models of concurrency such as abstract machines, domain-theoretic models, game-theoretic models, process algebras, graph transformation systems, Petri nets, hybrid systems, mobile and collaborative systems, probabilistic systems, real-time systems, biology-inspired systems, and synchronous systems; - Logics for concurrency such as modal logics, probabilistic and stochastic logics, temporal logics, and resource logics; - Verification and analysis techniques for concurrent systems such as abstract interpretation, atomicity checking, model checking, race detection, pre-order and equivalence checking, run-time verification, state-space exploration, static analysis, synthesis, testing, theorem proving, type systems, and security analysis; - Distributed algorithms and data structures: design, analysis, complexity, correctness, fault tolerance, reliability, availability, consistency, self-organization, self-stabilization, protocols. - Theoretical foundations of architectures, execution environments, and software development for concurrent systems such as geo-replicated systems, communication networks, multiprocessor and multi-core architectures, shared and transactional memory, resource management and awareness, compilers and tools for concurrent programming, programming models such as component-based, object- and service-oriented. PAPER SUBMISSION CONCUR 2017 solicits high quality papers reporting research results and/or experience related to the topics mentioned above. All papers must be original, unpublished, and not submitted for publication elsewhere. Each paper will undergo a thorough review process. If necessary, the paper may be supplemented with a clearly marked appendix, which will be reviewed at the discretion of the program committee. The CONCUR 2017 proceedings will be published by LIPIcs. Papers must be submitted electronically as PDF files via EasyChair (https://www.easychair.org/conferences/?conf=concur2017). Papers must not exceed 14 pages (excluding references and clearly marked appendices) using the LIPIcs style. https://www.dagstuhl.de/en/publications/lipics/instructions-for-authors/ ============================================================================ PROGRAM CHAIRS - Roland Meyer (Technische Universität Braunschweig, Germany) - Uwe Nestmann (Technische Universität Berlin, Germany) PROGRAMM COMMITTEE Jade Alglave (University College London, UK) Mohamed Faouzi Atig (Uppala Universitet, Sweden) Paolo Baldan (Università degli Studi di Padova, Italy) Johannes Borgström (Uppala Universitet, Sweden) Luis Caires (FCT / Universidade Nova de Lisboa, Portugal) Pedro R. D'Argenio (Universidad Nacional de Córdoba, Argentina) Josée Desharnais (Université Laval, Canada) Constantin Enea (Université Paris Diderot (Paris 7), France) Javier Esparza (Technische Universität München, Germany) Wan Fokkink (Vrije Universiteit Amsterdam, The Netherlands) Stefan Göller (École normale supérieure de Cachan, France) Thomas Hildebrandt (IT University of Copenhagen, Denmark) Naoki Kobayashi (The University of Tokyo, Japan) Antonín Kučera (Masaryk University, Czech Republic) Jérôme Leroux (Centre national de la recherche scientifique, France) Roland Meyer (Technische Universität Braunschweig, Germany) K Narayan Kumar (Chennai Mathematical Institute, India) Uwe Nestmann (Technische Universität Berlin, Germany) Catuscia Palamidessi (INRIA - l'École Polytechnique, France) Alexander Rabinovich (Tel Aviv University, Israel) Davide Sangiorgi (Università di Bologna, Italy) Pawel Sobocinski (University of Southampton, UK) Vasco Thudicum Vasconcelos (Universidade de Lisboa, Portugal) Walter Vogler (Universität Augsburg, Germany) Tomáš Vojnar (Brno University of Technology, Czech Republic) Igor Walukiewicz (Université Bordeaux, France) Heike Wehrheim (Universität Paderborn, Germany) Josef Widder (Technische Universität Wien, Austria) Thomas Wies (New York University, USA) Gianluigi Zavattaro (Università di Bologna, Italy) Lijun Zhang (Chinese Academy of Sciences, China) Rob van Glabbeek (CSIRO, Australia) STEERING COMMITTEE Jos Baeten (Centrum Wiskunde & Informatica (CWI), The Netherlands) Pedro R. D'Argenio (Universidad Nacional de Córdoba, Argentina) Javier Esparza (Technische Universität München, Germany) Joost-Pieter Katoen (RWTH Aachen University, Germany) Kim G. Larsen (Aalborg University, Denmark) Ugo Montanari (Università di Pisa, Italy) Catuscia Palamidessi (École Polytechnique, France) ============================================================================

7 Jahre, 4 Monate

1st CfP EXPRESS/SOS'17

von Kirstin Peters

---------------------------------------------------------------------------------------------------------- Combined 24th International Workshop on Expressiveness in Concurrency and 14th Workshop on Structural Operational Semantics *EXPRESS/SOS 2017* ---------------------------------------------------------------------------------------------------------- September 04, 2017, Berlin (Germany) Affiliated with CONCUR 2017 https://www.concur2017.tu-berlin.de/express_sos.html Submission of papers: Friday *June 23*, 2017 ---------------------------------------------------------------------------------------------------------- SCOPE AND TOPICS: The EXPRESS workshop series aims at bringing together researchers interested in the expressiveness of various formal systems and semantic notions, particularly in the field of concurrency. The SOS workshop series aims at being a forum for researchers, students and practitioners interested in new developments, and directions for future investigation, in the field of structural operational semantics. Since 2012, the EXPRESS and SOS communities have joined forces and organised a combined EXPRESS/SOS workshop on the formal semantics of systems and programming concepts, and on the expressiveness of mathematical models of computation. Topics of interest for this workshop include (but are not limited to): * expressiveness and comparison of models of computation (process algebras, event structures, Petri nets, rewrite systems) * expressiveness and comparison of programming models (distributed, component-based, object-oriented, service-oriented); * logics for concurrency (modal logics, probabilistic and stochastic logics, temporal logics and resource logics); * analysis techniques for concurrent systems; * theory of structural operational semantics (meta-theory, category-theoretic approaches, congruence results); * comparison of structural operational semantics to other formal semantics approaches * applications and case studies of structural operational semantics; * software tools that automate, or are based on, structural operational semantics. SUBMISSION GUIDELINES: We solicit two types of submissions: * Full papers (up to 15 pages). * Short papers (up to 5 pages, not included in the workshop proceedings) Simultaneous submission to journals, conferences or other workshops is only allowed for short papers; full papers must be unpublished. All submissions should adhere to the EPTCS format (http://www.eptcs.org), and submission is performed through the EXPRESS/SOS 2017 EasyChair server (https://easychair.org/conferences/?conf=expresssos2017). The final versions of accepted full papers will be published in EPTCS. INVITED SPEAKER: Mohammad Mousavi (Halmstad University, Sweden) IMPORTANT DATES: Paper submission: June 23, 2017 Notification date: July 31, 2017 Camera ready version: August 14, 2017 Workshop: September 04, 2017 WORKSHOP CO-CHAIRS: Kirstin Peters (Technische Universität Berlin, Germany) Simone Tini (Università degli Studi dell’Insubria, Italia) PROGRAM COMMITTEE: Giorgio Bacci (Aalborg University, Denmark) Ilaria Castellani (INRIA, France) Silvia Crafa (Università di Padova, Italy) Pedro R. D’Argenio (Universidad Nacional de Córdoba, Argentina) Erik de Vink (Eindhoven University of Technology, The Netherlands) Álvaro García-Pérez (IMDEA, Spain) Bartek Klin (Warsaw University, Poland) Stephan Mennicke (TU Braunschweig, Germany) Kirstin Peters (TU Berlin, Germany) Johannes Åman Pohjola (Chalmers University of Technology, Sweden) Pawel Sobocinski (University of Southampton, UK) Simone Tini (Università degli Studi dell’Insubria, Italia) Irek Ulidowski (University of Leicester, UK)

7 Jahre, 4 Monate

CFP: The 11th International Workshop on Reachability Problems (RP'17)

von Peter Lammich

--- Apologies for multiple posting --- The 11th International Workshop on Reachability Problems (RP'17) 7 - 9 September 2017 | Royal Holloway, University of London, UK | http: //rp17.cs.rhul.ac.uk The 11th Workshop on Reachability Problems will be hosted at Royal Holloway, University of London. The Reachability Workshop is specifically aimed at gathering together scholars from diverse disciplines interested in reachability problems that appear in algebraic structures, computational models, hybrid systems, logic and verification. Invited Speakers: Hana Chockler, King's College London Laurent Doyen, LSV - ENS Cachan RaphaÃ«l Jungers, UniversitÃ© catholique de Louvain Andreas Podelski, University of Freiburg Submissions: Authors are invited to submit a draft of a full paper with at most 12 pages (in LaTeX, formatted according to LNCS guidelines) via Easychair. Proofs omitted due to space constraints must be put into an appendix to be read by the program committee members at their discretion. Submissions deviating from these guidelines risk rejection. Electronic submissions should be formatted in pdf. Simultaneous submission to other conferences or workshops with published proceedings is not allowed. Submission link: https://easychair.org/conferences/?conf=rp2017 Topics of interest include (but are not limited to): reachability problems in infinite state systems, rewriting systems, dynamical and hybrid systems; reachability problems in logic and verification; reachability analysis in different computational models, counter timed/cellular/communicating automata; Petri nets; computational aspects of algebraic structures (semigroups, groups and rings); frontiers between decidable and undecidable reachability problems; predictability in iterative maps and new computational paradigms. Important Dates Submission deadline: 10 May 2017 (AoE) Notification to authors: 21 June 2017 Final version: 30 June 2017 Workshop: 7 - 9 September 2017 Presentation-Only Track In addition to regular papers that will appear in our LNCS proceedings, we invite researchers to apply to give a presentation at RP'17 without an accompanying paper. Such presentations can be based on work that has appeared (or which is going to appear) in the proceedings of another conference, or which has not yet been submitted. These contributions will be judged solely on the basis of their attractiveness to the workshop. To apply to give such a presentation please submit a PDF file containing a short abstract (up to two pages) by e-mail [ rp2017(a)easychair.org ] by August 2st 2017, with subject "RP2017 Informal Presentations". This abstract will not be published in the conference proceedings. Notification for the presentation-only track will be August 9th 2016. Proceedings The Conference Proceedings will be published as the volume of the Springer Verlag LNCS (Lecture Notes in Computer Science) series and distributed at the Conference. We plan also to publish selected papers in a special issue of a high quality journal following the regular referee procedure. RP'16 Program Committee: Igor Potapov, University of Liverpool (co-chair) Matthew Hague, Royal Holloway, University of London (co-chair) Paul Bell, Liverpool John Moores University Patricia Bouyer-Decitre, LSV, CNRS & ENS de Cachan Aiswarya Cyriac, Chennai Mathematical Institute Giorgio Delzanno, Universita Degli Studi Di Genova Piotrek Hofman, University of Warsaw Peter Lammich, Institut fuer Informatik, TU Munich Martin Lange, University of Kassel Salvatore La Torre, UniversitÃ degli Studi di Salerno Ranko Lazic, University of Warwick OndÅ™ej LengÃ¡l, Brno University of Technology Jerome Leroux, Laboratoire Bordelais de Recherche en Informatique Rupak Majumdar, Max Planck Institute for Software Systems Ahmed Rezine, LinkÃ¶ping University Tachio Terauchi, School of Information Science, Japan Advanced Institute of Science and Technology Hsu-Chun Yen, National Taiwan University Previous Workshops: 2016: RP'16 in Aalborg, Denmark LNCS proceedings, Volume 9899/2016, Springer Verlag 2015: RP'15 in Warsaw, Poland LNCS proceedings, Volume 9328/2015, Springer Verlag 2014: RP'14 in Oxford, UK LNCS proceedings, Volume 8762/2014, Springer Verlag 2013: RP'13 in Uppsala, Sweden LNCS proceedings, Volume 8169/2013, Springer Verlag 2012: RP'12 in Bordeaux, France LNCS proceedings, Volume 7550/2012, Springer Verlag 2011: RP'11 in Genova, Italy LNCS proceedings, Volume 6945/2011, Springer Verlag 2010: RP'10 in Brno, Czech Republic LNCS proceedings, Volume 6227/2010, Springer Verlag 2009: RP'09 in Palaiseau, France LNCS proceedings, Volume 5797/2009, Springer Verlag 2008: RP'08 in Liverpool, UK ENTCS proceedings, Volume 223, Elsevier 2007: RP'07 in Turku, Finland TUCS General Publication Series, Volume 45, Turku Centre for Computer Science

7 Jahre, 4 Monate

[GI FG CT] Aufruf

von Uwe Nestmann

Liebe Fans der Concurrency Theory, wie auf dem Treffen in Paderborn am Freitag angekündigt, hier nochmals die wichtigsten Daten zur GI-Fachgruppe "Concurrency Theory”, um möglichst viele von Euch/Ihnen dazu zu bewegen, der Fachgruppe beizutreten. Die Mitgliedschaft in der Fachgruppe kostet nichts, außer dem Ausfüllen und Absenden eines Formulars ... Je mehr Mitglieder wir haben, umso sichtbarer sind wir. Umsomehr Gewicht der "Concurrency Theory” wird in der deutschen Theoretischen Informatik auch wahrgenommen. Aktuell ist allerdings nur etwa ein Fünftel(!) der D-CON-Teilnehmer_innen auch Mtglied der Fachgruppe. (Obwohl es kostenlos ist.) Die offizielle Webseite der Fachgruppe im Kleid der GI ist unter http://fg-ct.gi.de/ <http://fg-ct.gi.de/> zu finden. Dort werden bisher im wesentlichen die Aktivitäten protokolliert. Natürlich kann man sich da auch mehr wünschen. Mithilfe ist jederzeit willkommen. Unter http://www.gi.de/service/wie-mitglied-werden/fachgruppenmitgliedschaft.html <http://www.gi.de/service/wie-mitglied-werden/fachgruppenmitgliedschaft.html> kann man Mitglied unserer Fachgruppe werden. Wer bereits Mitglied der GI ist, füllt dazu einfach den Antrag nach http://www.gi.de/fileadmin/redaktion/Mitglieder-Service/Fach.pdf <http://www.gi.de/fileadmin/redaktion/Mitglieder-Service/Fach.pdf> aus. (Man kann Mitglied in mehreren Fachgruppen sein.) Wer [noch] nicht Mitglied der GI ist, füllt den Antrag http://www.gi.de/fileadmin/redaktion/Mitglieder-Service/Fach_Ass.pdf <http://www.gi.de/fileadmin/redaktion/Mitglieder-Service/Fach_Ass.pdf> für assoziierte Mitglieder aus. Man kann dann nur Mitglied in einer Fachgruppe sein. Mit besten Grüßen, Uwe Nestmann

7 Jahre, 4 Monate

2024

2023

2022

2021

2020

2019

2018

2017

2016

2015

2014

2013

2012

2011

2010

2009

2008

D-CON März 2017