{ "access": { "embargo": { "active": false, "reason": null }, "files": "public", "record": "public", "status": "open" }, "created": "2021-01-21T21:03:28.570485+00:00", "custom_fields": {}, "deletion_status": { "is_deleted": false, "status": "P" }, "files": { "count": 8, "enabled": true, "entries": { "DNNF.ova": { "checksum": "md5:bd6cf7ac89d1b54e230c843e4ae1494b", "ext": "ova", "id": "8f4453f5-8e27-4711-8164-c7de779081cf", "key": "DNNF.ova", "metadata": null, "mimetype": "application/octet-stream", "size": 8845349376 }, "INSTALL.pdf": { "checksum": "md5:66c25b6346dcda5ef2a5e6de202beb3a", "ext": "pdf", "id": "e000aa67-3262-407f-884e-ec1f675d88d4", "key": "INSTALL.pdf", "metadata": null, "mimetype": "application/pdf", "size": 112203 }, "INSTALL.rst": { "checksum": "md5:1c205bb4c7ab0430bb0239b0a79efdc7", "ext": "rst", "id": "b7da6042-1894-499d-8212-25d8b7a4b68f", "key": "INSTALL.rst", "metadata": null, "mimetype": "application/octet-stream", "size": 2944 }, "LICENSE": { "checksum": "md5:501af9383f4f1e79619333ad67877802", "ext": "bin", "id": "6ec82b94-1c0b-49ba-989b-36874a5fa5b5", "key": "LICENSE", "metadata": null, "mimetype": "application/octet-stream", "size": 1070 }, "README.pdf": { "checksum": "md5:fe0bc943b8a205ae2ef91285d3431023", "ext": "pdf", "id": "b42c7c3d-48cf-46a6-b16f-5926c050775d", "key": "README.pdf", "metadata": null, "mimetype": "application/pdf", "size": 143981 }, "README.rst": { "checksum": "md5:fe7657f366f0193c4feec7fa3b002a00", "ext": "rst", "id": "6f2e7f54-31fd-410f-b645-b09f29b99e25", "key": "README.rst", "metadata": null, "mimetype": "application/octet-stream", "size": 8277 }, "REQUIREMENTS.pdf": { "checksum": "md5:16b42c4f24ef665cb98c4d34996616fd", "ext": "pdf", "id": "97860736-26f5-4ac9-a602-0fa8417f585e", "key": "REQUIREMENTS.pdf", "metadata": null, "mimetype": "application/pdf", "size": 83580 }, "REQUIREMENTS.rst": { "checksum": "md5:4234a219094cb4b4314e3dd423409018", "ext": "rst", "id": "7801a715-3e99-470a-b886-43f23e2c3d4f", "key": "REQUIREMENTS.rst", "metadata": null, "mimetype": "application/octet-stream", "size": 1619 } }, "order": [], "total_bytes": 8845703050 }, "id": "4439219", "is_draft": false, "is_published": true, "links": { "access": "https://zenodo.org/api/records/4439219/access", "access_links": "https://zenodo.org/api/records/4439219/access/links", "access_request": "https://zenodo.org/api/records/4439219/access/request", "access_users": "https://zenodo.org/api/records/4439219/access/users", "archive": "https://zenodo.org/api/records/4439219/files-archive", "archive_media": "https://zenodo.org/api/records/4439219/media-files-archive", "communities": "https://zenodo.org/api/records/4439219/communities", "communities-suggestions": "https://zenodo.org/api/records/4439219/communities-suggestions", "doi": "https://doi.org/10.5281/zenodo.4439219", "draft": "https://zenodo.org/api/records/4439219/draft", "files": "https://zenodo.org/api/records/4439219/files", "latest": "https://zenodo.org/api/records/4439219/versions/latest", "latest_html": "https://zenodo.org/records/4439219/latest", "media_files": "https://zenodo.org/api/records/4439219/media-files", "parent": "https://zenodo.org/api/records/4439218", "parent_doi": "https://zenodo.org/doi/10.5281/zenodo.4439218", "parent_html": "https://zenodo.org/records/4439218", "requests": "https://zenodo.org/api/records/4439219/requests", "reserve_doi": "https://zenodo.org/api/records/4439219/draft/pids/doi", "self": "https://zenodo.org/api/records/4439219", "self_doi": "https://zenodo.org/doi/10.5281/zenodo.4439219", "self_html": "https://zenodo.org/records/4439219", "self_iiif_manifest": "https://zenodo.org/api/iiif/record:4439219/manifest", "self_iiif_sequence": "https://zenodo.org/api/iiif/record:4439219/sequence/default", "versions": "https://zenodo.org/api/records/4439219/versions" }, "media_files": { "count": 0, "enabled": false, "entries": {}, "order": [], "total_bytes": 0 }, "metadata": { "creators": [ { "affiliations": [ { "name": "University of Virginia" } ], "person_or_org": { "family_name": "Shriver", "given_name": "David", "identifiers": [ { "identifier": "0000-0003-0208-6517", "scheme": "orcid" } ], "name": "Shriver, David", "type": "personal" } }, { "affiliations": [ { "name": "University of Virginia" } ], "person_or_org": { "family_name": "Elbaum", "given_name": "Sebastian", "identifiers": [ { "identifier": "0000-0001-9592-1352", "scheme": "orcid" } ], "name": "Elbaum, Sebastian", "type": "personal" } }, { "affiliations": [ { "name": "University of Virginia" } ], "person_or_org": { "family_name": "Dwyer", "given_name": "Matthew", "identifiers": [ { "identifier": "0000-0002-1937-1544", "scheme": "orcid" } ], "name": "Dwyer, Matthew", "type": "personal" } } ], "description": "
This artifact accompanies the paper Reducing DNN Properties to Enable Falsification with Adversarial Attacks.
\nIn this artifact, we provide the benchmarks and scripts for reproducing the results of our study,
\nand we also provide our tool, DNNF for running falsification methods such as adversarial attacks on DNN property specifications specified using the DNNP language of DNNV.
While many DNN verification techniques have been introduced in the past few years to enable the checking of DNN safety properties, these techniques are often limited in their applicability, due to simplifying assumptions about DNN structure or to high computational cost.
\nFalsification is a complementary approach to verification that seeks only to find violations to a safety property.
\nIn the context of DNNs, adversarial attacks can be viewed as falsifiers for DNN local robustness properties.
\nWhile these techniques often scale to large real-world DNNs, they are currently limited in the range of properties they can falsify.
In Reducing DNN Properties to Enable Falsification with Adversarial Attacks, we introduce an approach for reducing a DNN and an associated safety property -- a correctness problem -- into an equivalid set of correctness problems formulated with robustness properties which can be processed by existing adversarial attack techniques.
\nWe implement the approach in a tool which we call DNNF, and we perform a study demonstrating that property reduction yields a cost-effective approach to find violations of DNN correctness problems.