There is a newer version of the record available.

Published October 5, 2021 | Version v3
Software Open

Connectivity Graphs: A Method for Proving Deadlock Freedom Based on Separation Logic (Artifact)

  • 1. Radboud University
  • 2. CMU

Description

The artifact for the paper "Connectivity Graphs: A Method for Proving Deadlock Freedom Based on Separation Logic". The file readme.pdf contains a full description.

Files

cgraphs_sources.zip

Files (891.5 kB)

Name Size Download all
md5:8144ee2de379b330d31e885cd98f3b2b
473.2 kB Preview Download
md5:e5200dbe0302b778216dfb49fee770a3
418.3 kB Preview Download