{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:66C3CF7D2IACPMS37WLA3VZCA6","short_pith_number":"pith:66C3CF7D","schema_version":"1.0","canonical_sha256":"f785b117e3d20027b25bfd960dd72207a4e287bb7ed1e732bde3176ab1d39948","source":{"kind":"arxiv","id":"1703.05341","version":3},"attestation_state":"computed","paper":{"title":"DiVM: Model Checking with LLVM and Graph Memory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SE","authors_text":"Ivana \\v{C}ern\\'a, Ji\\v{r}\\'i Barnat, Petr Ro\\v{c}kai, Vladim\\'ir \\v{S}till","submitted_at":"2017-03-15T18:29:50Z","abstract_excerpt":"In this paper, we introduce the concept of a virtual machine with graph-organised memory as a versatile backend for both explicit-state and abstraction-driven verification of software. Our virtual machine uses the LLVM IR as its instruction set, enriched with a small set of hypercalls. We show that the provided hypercalls are sufficient to implement a small operating system, which can then be linked with applications to provide a POSIX-compatible verification environment. Finally, we demonstrate the viability of the approach through a comparison with a more traditionally-designed LLVM model ch"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1703.05341","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2017-03-15T18:29:50Z","cross_cats_sorted":[],"title_canon_sha256":"336f1894c5188295ebf43e05ee25450264989726ae4da1902b2ca3bf5a6a0ca6","abstract_canon_sha256":"fc2093cb3053fee7100fbf1655d5e9c39308581e98743d9ba15af317c1c0f8f0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:13.585677Z","signature_b64":"HcxxcxWljzqNWVfLMmOn4PFOUrbfHmCzl5JORSHN9xi+nrwDvxMiADA+X02SGr66Att1/y8pV0Irp9c+M5CuBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f785b117e3d20027b25bfd960dd72207a4e287bb7ed1e732bde3176ab1d39948","last_reissued_at":"2026-05-17T23:41:13.585178Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:13.585178Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"DiVM: Model Checking with LLVM and Graph Memory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SE","authors_text":"Ivana \\v{C}ern\\'a, Ji\\v{r}\\'i Barnat, Petr Ro\\v{c}kai, Vladim\\'ir \\v{S}till","submitted_at":"2017-03-15T18:29:50Z","abstract_excerpt":"In this paper, we introduce the concept of a virtual machine with graph-organised memory as a versatile backend for both explicit-state and abstraction-driven verification of software. Our virtual machine uses the LLVM IR as its instruction set, enriched with a small set of hypercalls. We show that the provided hypercalls are sufficient to implement a small operating system, which can then be linked with applications to provide a POSIX-compatible verification environment. Finally, we demonstrate the viability of the approach through a comparison with a more traditionally-designed LLVM model ch"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.05341","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1703.05341","created_at":"2026-05-17T23:41:13.585248+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.05341v3","created_at":"2026-05-17T23:41:13.585248+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.05341","created_at":"2026-05-17T23:41:13.585248+00:00"},{"alias_kind":"pith_short_12","alias_value":"66C3CF7D2IAC","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_16","alias_value":"66C3CF7D2IACPMS3","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_8","alias_value":"66C3CF7D","created_at":"2026-05-18T12:31:03.183658+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.00172","citing_title":"Model Checking a C++ Software Framework, a Case Study","ref_index":26,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/66C3CF7D2IACPMS37WLA3VZCA6","json":"https://pith.science/pith/66C3CF7D2IACPMS37WLA3VZCA6.json","graph_json":"https://pith.science/api/pith-number/66C3CF7D2IACPMS37WLA3VZCA6/graph.json","events_json":"https://pith.science/api/pith-number/66C3CF7D2IACPMS37WLA3VZCA6/events.json","paper":"https://pith.science/paper/66C3CF7D"},"agent_actions":{"view_html":"https://pith.science/pith/66C3CF7D2IACPMS37WLA3VZCA6","download_json":"https://pith.science/pith/66C3CF7D2IACPMS37WLA3VZCA6.json","view_paper":"https://pith.science/paper/66C3CF7D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.05341&json=true","fetch_graph":"https://pith.science/api/pith-number/66C3CF7D2IACPMS37WLA3VZCA6/graph.json","fetch_events":"https://pith.science/api/pith-number/66C3CF7D2IACPMS37WLA3VZCA6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/66C3CF7D2IACPMS37WLA3VZCA6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/66C3CF7D2IACPMS37WLA3VZCA6/action/storage_attestation","attest_author":"https://pith.science/pith/66C3CF7D2IACPMS37WLA3VZCA6/action/author_attestation","sign_citation":"https://pith.science/pith/66C3CF7D2IACPMS37WLA3VZCA6/action/citation_signature","submit_replication":"https://pith.science/pith/66C3CF7D2IACPMS37WLA3VZCA6/action/replication_record"}},"created_at":"2026-05-17T23:41:13.585248+00:00","updated_at":"2026-05-17T23:41:13.585248+00:00"}