Connectivity graphs: a method for proving deadlock freedom based on separation logic.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/journals/pacmpl/JacobsBK22
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/journals/pacmpl/JacobsBK22
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Jules_Jacobs
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Robbert_Krebbers
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Stephanie_Balzer
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1145%2F3498662
>
foaf:
homepage
<
https://doi.org/10.1145/3498662
>
dc:
identifier
DBLP journals/pacmpl/JacobsBK22
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1145%2F3498662
(xsd:string)
dcterms:
issued
2022
(xsd:gYear)
swrc:
journal
<
https://dblp.l3s.de/d2r/resource/journals/pacmpl
>
rdfs:
label
Connectivity graphs: a method for proving deadlock freedom based on separation logic.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Jules_Jacobs
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Robbert_Krebbers
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Stephanie_Balzer
>
swrc:
number
POPL
(xsd:string)
swrc:
pages
1-33
(xsd:string)
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/journals/pacmpl/JacobsBK22/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/journals/pacmpl/JacobsBK22
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/journals/pacmpl/pacmpl6.html#JacobsBK22
>
rdfs:
seeAlso
<
https://doi.org/10.1145/3498662
>
dc:
title
Connectivity graphs: a method for proving deadlock freedom based on separation logic.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:Article
rdf:
type
foaf:Document
swrc:
volume
6
(xsd:string)