ADeterministic Dynamic Deadlock Detection and RecoveryHARI K. PYLA and SRINIDHI VARADARAJAN, Virginia TechA core problem with concurrent programming using threads is the potential for deadlocks. Even well-written codes that spend an inordinate amount of effort in deadlock avoidance cannot always avoid deadlocks, par- ticularly when the order of lock acquisitions is not known a priori. Furthermore, arbitrarily composing lock based codes may result in deadlock - one of the primary motivations for