Skip to main navigation Skip to search Skip to main content

Efficiently Verifiable Conditions for Deadlock-Freedom of Large Concurrent Programs

  • Northeastern University

Research output: Chapter in Book/Report/Conference proceedingConference paperpeer-review

20 Citations (Scopus)

Fingerprint

Dive into the research topics of 'Efficiently Verifiable Conditions for Deadlock-Freedom of Large Concurrent Programs'. Together they form a unique fingerprint.
Sort by

Computer Science

Engineering