Reachability in Binary Multithreaded Programs Is Polynomial

Article Details
Title:	Reachability in Binary Multithreaded Programs Is Polynomial
Article URLs:	https://doi.org/10.1109/ICDCS.2017.290 http://doi.ieeecomputersociety.org/10.1109/ICDCS.2017.290
Alternative Article URLs:
Authors:	Alexander Malkis	Technische Universität München
Authors:	Steffen Borgwardt	University of Colorado Denver
Sharing:	Unknown
Verification:	Authors have not verified information
Artifact Evaluation Badge:	none
Artifact URLs:	http://www.sec.in.tum.de/~malkis/Malkis-diam.zip
Artifact Correspondence Email Addresses:
NSF Award Numbers:
DBLP Key:	conf/icdcs/MalkisB17
Author Comments:

IEEE International Conference on Distributed Computing Systems, ICDCS 2017