Conference paper Open Access

Certifying Graph-Manipulating C Programs via Localizations within Data Structures

Wang, Shengyi; Cao, Qinxiang; Mohan, Anshuman; Hobor, Aquinas


MARC21 XML Export

<?xml version='1.0' encoding='UTF-8'?>
<record xmlns="http://www.loc.gov/MARC21/slim">
  <leader>00000nam##2200000uu#4500</leader>
  <datafield tag="041" ind1=" " ind2=" ">
    <subfield code="a">eng</subfield>
  </datafield>
  <datafield tag="653" ind1=" " ind2=" ">
    <subfield code="a">Separation logic</subfield>
  </datafield>
  <datafield tag="653" ind1=" " ind2=" ">
    <subfield code="a">Graph-manipulating programs</subfield>
  </datafield>
  <datafield tag="653" ind1=" " ind2=" ">
    <subfield code="a">Coq</subfield>
  </datafield>
  <datafield tag="653" ind1=" " ind2=" ">
    <subfield code="a">CompCert</subfield>
  </datafield>
  <datafield tag="653" ind1=" " ind2=" ">
    <subfield code="a">VST</subfield>
  </datafield>
  <controlfield tag="005">20200120174031.0</controlfield>
  <datafield tag="500" ind1=" " ind2=" ">
    <subfield code="a">As submitted to the OOPSLA '19 Artifact Evaluation Committee</subfield>
  </datafield>
  <controlfield tag="001">3368779</controlfield>
  <datafield tag="700" ind1=" " ind2=" ">
    <subfield code="u">Shanghai Jiao Tong University</subfield>
    <subfield code="a">Cao, Qinxiang</subfield>
  </datafield>
  <datafield tag="700" ind1=" " ind2=" ">
    <subfield code="u">National University of Singapore</subfield>
    <subfield code="a">Mohan, Anshuman</subfield>
  </datafield>
  <datafield tag="700" ind1=" " ind2=" ">
    <subfield code="u">National University of Singapore</subfield>
    <subfield code="a">Hobor, Aquinas</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2=" ">
    <subfield code="s">144141</subfield>
    <subfield code="z">md5:602c9478fa6265bdca4f34408ce57399</subfield>
    <subfield code="u">https://zenodo.org/record/3368779/files/Artifact_Overview_Docker.pdf</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2=" ">
    <subfield code="s">2591</subfield>
    <subfield code="z">md5:c2f7395843cda78bcae4b75d4194ff1f</subfield>
    <subfield code="u">https://zenodo.org/record/3368779/files/Dockerfile</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2=" ">
    <subfield code="s">1630</subfield>
    <subfield code="z">md5:7e28b3f6d85cc870275862ef1c6e9088</subfield>
    <subfield code="u">https://zenodo.org/record/3368779/files/LICENSE</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2=" ">
    <subfield code="s">579</subfield>
    <subfield code="z">md5:d440c95b8232662a9215246b8c2076c1</subfield>
    <subfield code="u">https://zenodo.org/record/3368779/files/README</subfield>
  </datafield>
  <datafield tag="542" ind1=" " ind2=" ">
    <subfield code="l">open</subfield>
  </datafield>
  <datafield tag="260" ind1=" " ind2=" ">
    <subfield code="c">2019-08-15</subfield>
  </datafield>
  <datafield tag="909" ind1="C" ind2="O">
    <subfield code="p">openaire</subfield>
    <subfield code="o">oai:zenodo.org:3368779</subfield>
  </datafield>
  <datafield tag="100" ind1=" " ind2=" ">
    <subfield code="u">National University of Singapore</subfield>
    <subfield code="a">Wang, Shengyi</subfield>
  </datafield>
  <datafield tag="245" ind1=" " ind2=" ">
    <subfield code="a">Certifying Graph-Manipulating C Programs 
via Localizations within Data Structures</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
    <subfield code="a">Other (Attribution)</subfield>
  </datafield>
  <datafield tag="650" ind1="1" ind2="7">
    <subfield code="a">cc-by</subfield>
    <subfield code="2">opendefinition.org</subfield>
  </datafield>
  <datafield tag="520" ind1=" " ind2=" ">
    <subfield code="a">&lt;p&gt;We develop powerful and general techniques to mechanically verify realistic programs that manipulate heap- represented graphs. These graphs can exhibit well-known organization principles, such as being a directed acyclic graph or a disjoint-forest; alternatively, these graphs can be totally unstructured. The common thread for such structures is that they exhibit deep intrinsic sharing and can be expressed using the language of graph theory. We construct a modular and general setup for reasoning about abstract mathematical graphs and use separation logic to define how such abstract graphs are represented concretely in the heap. We develop a Localize rule that enables modular reasoning about such programs, and show how this rule can support existential quantifiers in postconditions and smoothly handle modified program variables. We demonstrate the generality and power of our techniques by integrating them into the Verified Software Toolchain and certifying the correctness of six graph-manipulating programs written in CompCert C, including a 400-line generational garbage collector for the CertiCoq project. While doing so, we identify two places where the semantics of C is too weak to define generational garbage collectors of the sort used in the OCaml runtime. Our proofs are entirely machine-checked in Coq.&lt;/p&gt;</subfield>
  </datafield>
  <datafield tag="773" ind1=" " ind2=" ">
    <subfield code="n">doi</subfield>
    <subfield code="i">isVersionOf</subfield>
    <subfield code="a">10.5281/zenodo.3368778</subfield>
  </datafield>
  <datafield tag="024" ind1=" " ind2=" ">
    <subfield code="a">10.5281/zenodo.3368779</subfield>
    <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="980" ind1=" " ind2=" ">
    <subfield code="a">publication</subfield>
    <subfield code="b">conferencepaper</subfield>
  </datafield>
</record>
131
89
views
downloads
All versions This version
Views 131131
Downloads 8989
Data volume 10.5 MB10.5 MB
Unique views 116116
Unique downloads 6969

Share

Cite as