Summary: E∆ciently Veriable Conditions for
Deadlock-freedom of Large Concurrent
Programs (Extended Abstract)
Paul C. Attie 1 2 and Hana Chockler 2 3
1 College of Computer Science, Northeastern University,
360 Huntington Avenue, Boston, Massachusetts 02115.
2 MIT CSAIL, 32 Vassar street,
Cambridge, MA, 02139, USA.
3 Department of Computer Science, WPI,
100 Institute Road, Worcester, MA 01609, USA.
Abstract. We present two polynomial-time algorithms for automatic
verication of deadlock-freedom of large nite-state concurrent programs.
We consider shared-memory concurrent programs in which a process
can nondeterministically choose amongst several (enabled) actions at
any step. As shown in , deadlock-freedom analysis is NP-hard even
for concurrent programs of restricted form (no nondeterministic choice).
Therefore, research in this area concentrates either on the search for
e∆ciently checkable su∆cient conditions for deadlock-freedom, or on im-