Difference between revisions of "CONCUR 2021"

From Openresearch
Jump to: navigation, search
(Created page with "{{Event |Acronym=CONCUR 2021 |Title=International Conference on Concurrency Theory |Ordinal=32 |Series=CONCUR |Type=Conference |Start date=2021/08/23 |End date=2021/08/27 |Hom...")
 
Line 5: Line 5:
 
|Series=CONCUR
 
|Series=CONCUR
 
|Type=Conference
 
|Type=Conference
 +
|Superevent=QONFEST
 
|Start date=2021/08/23
 
|Start date=2021/08/23
 
|End date=2021/08/27
 
|End date=2021/08/27
 +
|Submission deadline=2021/04/30
 
|Homepage=https://qonfest2021.lacl.fr/concur21.php
 
|Homepage=https://qonfest2021.lacl.fr/concur21.php
 +
|City=Paris
 
|Country=France
 
|Country=France
 +
|Abstract deadline=2021/04/23
 +
|Paper deadline=2021/04/30
 +
|Notification=2021/06/23
 +
|Camera ready=2021/07/09
 +
|Submitting link=https://easychair.org/conferences?conf=concur2021
 +
|has program chair=Serge Haddad, Daniele Varacca
 +
|has Keynote speaker=Patricia Bouyer-Decitre, Davide Sangiorgi, Boudewijn Haverkort
 +
}}
 +
=== 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.

Revision as of 16:44, 8 April 2021

CONCUR 2021
International Conference on Concurrency Theory
Ordinal 32
Event in series CONCUR
Subevent of QONFEST
Dates 2021/08/23 (iCal) - 2021/08/27
Homepage: https://qonfest2021.lacl.fr/concur21.php
Submitting link: https://easychair.org/conferences?conf=concur2021
Location
Location: Paris, France
Loading map...

Important dates
Abstracts: 2021/04/23
Papers: 2021/04/30
Submissions: 2021/04/30
Notification: 2021/06/23
Camera ready due: 2021/07/09
Committees
PC chairs: Serge Haddad, Daniele Varacca
Keynote speaker: Patricia Bouyer-Decitre, Davide Sangiorgi, Boudewijn Haverkort
Table of Contents

Contents


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.