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
Contains fulltext : 91697.pdf (publisher's version ) (Closed access
• Last lecture, we saw an algorithm that could be used to analyze the connectivity of a graph withou...
International audienceDependency graphs are a commonly used data structure to encode the streams of ...
The artifact for the paper "Connectivity Graphs: A Method for Proving Deadlock Freedom Based on Sepa...
Graduation date: 1983A process-resource graph is a directed graph with m\ud resource nodes and n pro...
Artifact for the paper "Dependent Session Protocols in Separation Logic from First Principles". See ...
This is the artifact corresponding to the article entitled "DisLog: A Separation Logic for Disentang...
Contains fulltext : 91834.pdf (publisher's version ) (Open Access)ACL2'11 : Proce...
We introduce a number of techniques for establishing the deadlock freedom of concurrent systems. Our...
Kowalski's connection graph method provides a representation for logic programs which allows for the...
Contains fulltext : 91833.pdf (preprint version ) (Open Access
This is the artifact for the OOPSLA '23 paper 'Proof Automation for Linearizability in Separation Lo...
Thesis. 1977. M.S.--Massachusetts Institute of Technology. Dept. of Electrical Engineering and Compu...
This is an artifact for the paper "Specification and Inference of Trace Refinement Relations" condit...
International audienceDeadlocks are an important issue in wormhole networks and a lot of works have ...
Contains fulltext : 91697.pdf (publisher's version ) (Closed access
• Last lecture, we saw an algorithm that could be used to analyze the connectivity of a graph withou...
International audienceDependency graphs are a commonly used data structure to encode the streams of ...
The artifact for the paper "Connectivity Graphs: A Method for Proving Deadlock Freedom Based on Sepa...
Graduation date: 1983A process-resource graph is a directed graph with m\ud resource nodes and n pro...
Artifact for the paper "Dependent Session Protocols in Separation Logic from First Principles". See ...
This is the artifact corresponding to the article entitled "DisLog: A Separation Logic for Disentang...
Contains fulltext : 91834.pdf (publisher's version ) (Open Access)ACL2'11 : Proce...
We introduce a number of techniques for establishing the deadlock freedom of concurrent systems. Our...
Kowalski's connection graph method provides a representation for logic programs which allows for the...
Contains fulltext : 91833.pdf (preprint version ) (Open Access
This is the artifact for the OOPSLA '23 paper 'Proof Automation for Linearizability in Separation Lo...
Thesis. 1977. M.S.--Massachusetts Institute of Technology. Dept. of Electrical Engineering and Compu...
This is an artifact for the paper "Specification and Inference of Trace Refinement Relations" condit...
International audienceDeadlocks are an important issue in wormhole networks and a lot of works have ...
Contains fulltext : 91697.pdf (publisher's version ) (Closed access
• Last lecture, we saw an algorithm that could be used to analyze the connectivity of a graph withou...
International audienceDependency graphs are a commonly used data structure to encode the streams of ...
DOI
Add to ORKG