Concurrency Theory Concurrency Theory Group

Department of Computer Science
University of Kaiserslautern

Welcome

to the webpages of the Concurrency Theory Group. Our team investigates the foundations of concurrent behaviour in network applications, remote programs, and multi-threaded software. Our ambition is to understand the underlying principles and exploit them in the design of highly efficient analysis algorithms. Harnessing methods from computability theory, computer-aided verification, and formal languages, the group is specialised in inference techniques for qualitative as well as quantitative properties, and currently extends state space exploration algorithms towards automatic system correction and optimisation.

Roland Meyer

Contact and Impressum

Further Information

To get an impression of our research topics and courses, consider

If you would like to join us, if you are interested in a Bachelor's, Master's, or PhD thesis, or in case you are just curious about who we are - we warmly welcome you to visit us. We offer beautiful topics, competitive scholarships, and an international research environment.

News

BCS/CHPC Distinguished Dissertation Award.
The thesis “Verification of Message Passing Concurrent Systems” (by Emanuele D'Osualdo) received the BCS/CHPC Distinguished Dissertation Award in 2016.  PDF

NWPT 2016.
Thread Summaries for Lock-Free Data Structures.  publications

ACSD 2017.
Roland Meyer is a member of the programme committee.

FSTTCS 2016.
Summaries for Context-Free Games.  publications

D-CON 2017.
Roland Meyer will speak at the D-CON workshop.

EATCS Distinguished Dissertation Award.
The thesis “Monoids as Storage Mechanisms” (by Georg Zetzsche) received the EATCS Distinguished Dissertation Award in 2016.  PDF

Marktoberdorf 2016.
Sebastian Wolff was accepted to the Marktoberdorf Summer School.

MEMICS 2016.
Roland Meyer will speak at the MEMICS workshop.

Carl Zeiss.
Our project ArchiV: Architecture-aware Verification has been granted.  research

LICS 2016.
Complexity of Regular Abstractions of One-Counter Languages.  publications

LICS 2016.
First-Order Logic with Reachability for Infinite-State Systems.  publications

UPMARC 2016.
Roland Meyer will speak at the UPMARC summer school.

CONCUR 2017.
Roland Meyer is a co-chair of the conference.

ESOP 2016.
On Hierarchical Communication Topologies in the π-calculus.  publications

FoSSaCS 2017.
Roland Meyer is a member of the programme committee.

Best teaching award SoSe 2015.
Our Bachelor's course Logik received the best teaching award.

ACSD 2016.
Roland Meyer is a member of the programme committee.

VMCAI 2016.
Pointer Race Freedom.  publications

FSTTCS 2015.
What's Decidable about Availability Languages?.  publications

NETYS 2016.
Roland Meyer is a member of the programme committee.

RP 2015.
The Emptiness Problem for Valence Automata or: Another Decidable Extension of Petri Nets.  publications

Best student paper at ICALP 2015.
An approach to computing downward closures.  publications

ACM TECS.
Memory-Model-Aware Testing - a Unified Complexity Analysis.  publications

NETYS 2015.
Antichains for Recursive Program Verification.  publications

CCDP 2015.
Roland Meyer will give an invited talk. More about the workshop can be found  here

FSTTCS 2015.
Roland Meyer is a member of the programme committee.

SKILL 2015.
Roland Meyer is a member of the programme committee. More about the conference can be found  here

MM 2015.
Roland Meyer will give an invited talk. More about the workshop can be found  here

TACAS 2016.
Roland Meyer is a member of the programme committee.

STACS 2015.
Computing downward closures for stacked counter automata.  publications

CONCUR 2015.
Roland Meyer is a member of the programme committee. More about the conference can be found  here

ACSD 2015.
Roland Meyer is a co-chair of the programme committee. More about the conference can be found  here

FASE 2015.
Lazy TSO Reachability.  publications