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

Jules Jacobs; Stephanie Balzer; Robbert Krebbers

doi:10.5281/zenodo.5550835

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

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
cgraphs_sources.zip md5:8144ee2de379b330d31e885cd98f3b2b	473.2 kB	Preview Download
readme.pdf md5:e5200dbe0302b778216dfb49fee770a3	418.3 kB	Preview Download

353

Views

229

Downloads

Show more details

	All versions	This version
Views	353	59
Downloads	229	35
Data volume	204.2 GB	17.3 MB

More info on how stats are collected....

DOI

Resource type

Software

Publisher

Zenodo

License: Creative Commons Attribution 4.0 International

The Creative Commons Attribution license allows re-distribution and re-use of a licensed work on the condition that the creator is appropriately credited. Read more

Technical metadata

Created: October 5, 2021
Modified: July 17, 2024

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

Creators

Description

Files

cgraphs_sources.zip

Files (891.5 kB)