Published October 5, 2021 | Version v8
Software Open

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

Creators

  • 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.

This is an archive. The most recent version of the code can be found at https://github.com/julesjacobs/cgraphs.

Files

cgraphs_sources.zip

Files (6.4 GB)

Name Size Download all
md5:072ff8bf1429490c7382a65c54711966
474.9 kB Preview Download
md5:bd4c08e7f650fad81b085f52ef15fec4
6.4 GB Download
md5:37c83e162747a3a96eabf4e7141f93a9
419.7 kB Preview Download