Institute of Theoretical Computer Science Institute of
Theoretical Computer Science

Carl-Friedrich-Gauß-Fakultät
Technische Universität Braunschweig
TU Braunschweig Home Team Teaching Research Publications Tools

Florian Furbach

M.Sc. in Computer Science

Email: furbach at cs.uni-kl.de
Phone: +49 (0)631 205 26 33
Fax: +49 (0)631 205 34 20
Mail: TU Kaiserslautern, Department of Computer Science, Concurrency Theory Group, po box 3049, D-67653 Kaiserslautern, Germany.
Office: Building 34, 4th floor, office 425, Gottlieb-Daimler Straße, D-67663 Kaiserslautern, map.

Since January 2013, I have been a PhD student in the Concurrency Theory Group. I studied Computer Science at the University of Kaiserslautern. My research interests include weak memory models and control synthesis

List of publications

News

GI-Fachgruppe.
Roland Meyer has been elected as the spokesperson of the GI-Fachgruppe Concurrency Theory.

NETYS 2017.
Locality and Singularity for Store-Atomic Memory Models.  publications

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

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

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

Dr.-Ing. Georgel Calin.
Congratulations on your successful defense!

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