International Conference on Concurrency Theory

Last updated
International Conference on Concurrency Theory
AbbreviationCONCUR
Discipline concurrency
Publication details
Publisher LIPICS, Lecture Notes in Computer Science
History1984-present
FrequencyAnnually

The International Conference on Concurrency Theory (CONCUR) is an academic conference in the field of computer science, with focus on the theory of concurrency and its applications. It is the flagship conference for concurrency theory according to the International Federation for Information Processing Working Group on Concurrency Theory (WP 1.8). [1] The conference is organised annually since 1988. Since 2015, papers presented at CONCUR are published in the LIPIcs–Leibniz International Proceedings in Informatics, a "series of high-quality conference proceedings across all fields in informatics established in cooperation with Schloss Dagstuhl –Leibniz Center for Informatics". [2] [3] Before, CONCUR papers were published in the series Lecture Notes in Computer Science. [4]

Contents

Editions

Test-of-Time Award

In 2020, the International Conference on Concurrency Theory (CONCUR) and the IFIP Working Group 1.8 on Concurrency Theory established the CONCUR Test-of-Time Award. The goal of the Award is to recognize important achievements in concurrency theory that have stood the test of time, and were published at CONCUR since its first edition in 1990. [15]

Starting with CONCUR 2024, an award event will take place every other year, and recognize one or two papers presented at CONCUR in the 4-year period from 20 to 17 years earlier. From 2020 to 2023 two such award events are combined each year, in order to also recognize achievements that appeared in the early editions of CONCUR. [16]

2023

Period 2002–2005

  • Vincent Danos, Jean Krivine: "Reversible Communicating Systems." (CONCUR 2004) [17]

2022

Period 2000–2003

Period 1998–2001

  • Franck Cassez & Kim Larsen: "The Impressive Power of Stopwatches" (CONCUR 2000) [18]
  • Christel Baier, Joost-Pieter Katoen & Holger Hermanns: "Approximate symbolic model checking of continuous-time Markov chains." (CONCUR 1999) [18]

2021

Period 1996–1999

Period 1994–1997

  • Uwe Nestmann & Benjamin C. Pierce: "Decoding Choice Encodings" (CONCUR 1996) [15]
  • David Janin & Igor Walukiewicz: "On the Expressive Completeness of the Propositional mu-Calculus with Respect to Monadic Second Order Logic." (CONCUR 1996) [15]

2020

Period 1992–1995

  • Roberto Segala & Nancy Lynch: "Probabilistic Simulations for Probabilistic Processes" (CONCUR 1994) [16]
  • Davide Sangiorgi: "A Theory of Bisimulation for the pi-Calculus" (CONCUR 1993) [16]

Period 1990–1993

  • Rob van Glabbeek: "The Linear Time-Branching Time Spectrum" (CONCUR 1993) [16]
  • Søren Christensen, Hans Hüttel & Colin Stirling: "Bisimulation Equivalence is Decidable for all Context-Free Processes" (CONCUR 1992) [16]

Affiliated events

See also

Related Research Articles

<span class="mw-page-title-main">DBLP</span> Computer science bibliography website

DBLP is a computer science bibliography website. Starting in 1993 at Universität Trier in Germany, it grew from a small collection of HTML files and became an organization hosting a database and logic programming bibliography site. Since November 2018, DBLP is a branch of Schloss Dagstuhl – Leibniz-Zentrum für Informatik (LZI). DBLP listed more than 5.4 million journal articles, conference papers, and other publications on computer science in December 2020, up from about 14,000 in 1995 and 3.66 million in July 2016. All important journals on computer science are tracked. Proceedings papers of many conferences are also tracked. It is mirrored at three sites across the Internet.

<span class="mw-page-title-main">Dagstuhl</span>

Dagstuhl is a computer science research center in Germany, located in and named after a district of the town of Wadern, Merzig-Wadern, Saarland.

<span class="mw-page-title-main">Russell Impagliazzo</span> American computer scientist

Russell Graham Impagliazzo is a professor of computer science at the University of California, San Diego, specializing in computational complexity theory.

ICALP, the International Colloquium on Automata, Languages, and Programming is an academic conference organized annually by the European Association for Theoretical Computer Science and held in different locations around Europe. Like most theoretical computer science conferences its contributions are strongly peer-reviewed. The articles have appeared in proceedings published by Springer in their Lecture Notes in Computer Science, but beginning in 2016 they are instead published by the Leibniz International Proceedings in Informatics.

The ACM–IEEE Symposium on Logic in Computer Science (LICS) is an annual academic conference on the theory and practice of computer science in relation to mathematical logic. Extended versions of selected papers of each year's conference appear in renowned international journals such as Logical Methods in Computer Science and ACM Transactions on Computational Logic.

The Symposium on Theoretical Aspects of Computer Science (STACS) is an academic conference in the field of computer science. It is held each year, alternately in Germany and France, since 1984. Typical themes of the conference include algorithms, computational and structural complexity, automata, formal languages and logic.

The European Symposium on Algorithms (ESA) is an international conference covering the field of algorithms. It has been held annually since 1993, typically in early Autumn in a different European location each year. Like most theoretical computer science conferences its contributions are strongly peer-reviewed; the articles appear in proceedings published in Springer Lecture Notes in Computer Science. Acceptance rate of ESA is 24% in 2012 in both Design and Analysis and Engineering and Applications tracks.

WADS, the Algorithms and Data Structures Symposium, is an international academic conference in the field of computer science, focusing on algorithms and data structures. WADS is held every second year, usually in Canada and always in North America. It is held in alternation with its sister conference, the Scandinavian Symposium and Workshops on Algorithm Theory (SWAT), which is usually held in Scandinavia and always in Northern Europe. Historically, the proceedings of both conferences were published by Springer Verlag through their Lecture Notes in Computer Science series. Springer continues to publish WADS proceedings, but starting in 2016, SWAT proceedings are now published by Dagstuhl through their Leibniz International Proceedings in Informatics.

Susanne Boll is a Professor for Media Informatics and Multimedia Systems in the Department of Computing Science at the University of Oldenburg, Germany. and is a member of the board at the research institute OFFIS. She is a member of SIGMM and SIGCHI of the ACM as well as the German Informatics Society GI. She founded and directs the HCI Lab at the University of Oldenburg and OFFIS.

Raimund G. Seidel is a German and Austrian theoretical computer scientist and an expert in computational geometry.

<span class="mw-page-title-main">Reinhard Wilhelm</span> German computer scientist

Reinhard Wilhelm is a German computer scientist.

<span class="mw-page-title-main">Joost-Pieter Katoen</span> Dutch theoretical computer scientist

Joost-Pieter Katoen is a Dutch theoretical computer scientist based in Germany. He is distinguished professor in Computer Science and head of the Software Modeling and Verification Group at RWTH Aachen University. Furthermore, he is part-time associated to the Formal Methods & Tools group at the University of Twente.

Runtime predictive analysis is a runtime verification technique in computer science for detecting property violations in program executions inferred from an observed execution. An important class of predictive analysis methods has been developed for detecting concurrency errors in concurrent programs, where a runtime monitor is used to predict errors which did not happen in the observed run, but can happen in an alternative execution of the same program. The predictive capability comes from the fact that the analysis is performed on an abstract model extracted online from the observed execution, which admits a class of executions beyond the observed one.

The International Symposium on Experimental Algorithms (SEA), previously known as Workshop on Experimental Algorithms (WEA), is a computer science conference in the area of algorithm engineering.

Francisco Javier Esparza Estaun is a Spanish computer scientist. He is a professor at the Technische Universität München.

Scott A. Smolka is a SUNY Distinguished Professor in the Department of Computer Science at Stony Brook University, Stony Brook, New York.

AofA, the International Meeting on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms is an academic meeting that has been held regularly since 1993 in the field of computer science, focusing on mathematical methods from analytic combinatorics and probability for the study of properties of algorithms and large combinatorial structures. In early years, different formal names were used, but the meeting and associated community of researchers has always been known as AofA.

In computer science, choreographic programming is a programming paradigm where programs are compositions of interactions among multiple concurrent participants.

<span class="mw-page-title-main">Thomas Neumann</span> German computer scientist

Thomas Neumann is a German computer scientist and full professor for Data Science and Engineering at the Technical University of Munich (TUM).

References

  1. "Conferences - IFIP WG 1.8 (Concurrency Theory)". concurrency-theory.org. Retrieved 2019-02-08.
  2. "Schloss Dagstuhl : LIPIcs". www.dagstuhl.de. Retrieved 2019-02-03.
  3. "dblp: CONCUR 2015". dblp.org. Retrieved 2019-02-03.
  4. "dblp: Concurrency 1988". dblp.org. Retrieved 2019-02-03.
  5. "CORE 2021 - CONCUR". portal.core.edu.au. Retrieved 2023-04-01.
  6. "CONCUR - Google Scholar Metrics". scholar.google.dk. Retrieved 2019-07-20.
  7. "CONCUR 2023". CONCUR 2023. Retrieved 2023-09-20.
  8. "CONCUR 2022". CONCUR 2022. Retrieved 2023-04-25.
  9. "CONCUR 2021". Qonfest 2021. Retrieved 2021-04-26.
  10. "CONCUR 2020". CONCUR 2020. Retrieved 2023-04-25.
  11. "CONCUR 2019 - AMSTERDAM". event.cwi.nl. Retrieved 2019-02-03.
  12. "CONCUR 2018 - BEIJING". lcs.ios.ac.cn. Retrieved 2019-02-03.
  13. "CONCUR 2017". www.concur2017.tu-berlin.de. Retrieved 2019-02-03.
  14. "CONCUR2016: Home". www.concur2016.ulaval.ca. Retrieved 2019-02-03.
  15. 1 2 3 4 5 Bertrand, Nathalie; de Alfaro, Luca; van Glabbeek, Rob; Palamidessi, Catuscia; Yoshida, Nobuko (2021). "CONCUR Test-Of-Time Award 2021" (PDF). CONCUR. Leibniz International Proceedings in Informatics (LIPIcs). 203: 1:1–1:3. doi:10.4230/LIPIcs.CONCUR.2021.1. ISBN   9783959772037.
  16. 1 2 3 4 5 Aceto, Luca; Baeten, Jos; Bouyer-Decitre, Patricia; Hermanns, Holger; Silva, Alexandra (2020). "CONCUR Test-Of-Time Award 2020 Announcement" (PDF). CONCUR. Leibniz International Proceedings in Informatics (LIPIcs). 171: 5:1–5:3. doi:10.4230/LIPIcs.CONCUR.2020.5. ISBN   9783959771603.
  17. "Concur 2023 Test of Time Award". Concur 2023 website. Retrieved 20 September 2023.
  18. 1 2 3 4 "Concur 2022 Test of Time Award". Concur 2022 website. Retrieved 9 November 2022.