{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:L2BCYVXBDAIJDUCDUSBDNUNJVK","short_pith_number":"pith:L2BCYVXB","schema_version":"1.0","canonical_sha256":"5e822c56e1181091d043a48236d1a9aa8753998021f900bdda1e69c6288a87a7","source":{"kind":"arxiv","id":"1908.06271","version":2},"attestation_state":"computed","paper":{"title":"Software Verification with PDR: Implementation and Empirical Evaluation of the State of the Art","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SE","authors_text":"Dirk Beyer, Matthias Dangl","submitted_at":"2019-08-17T09:29:01Z","abstract_excerpt":"Property-directed reachability (PDR) is a SAT/SMT-based reachability algorithm that incrementally constructs inductive invariants. After it was successfully applied to hardware model checking, several adaptations to software model checking have been proposed. We contribute a replicable and thorough comparative evaluation of the state of the art: We (1) implemented a standalone PDR algorithm and, as improvement, a PDR-based auxiliary-invariant generator for k-induction, and (2) performed an experimental study on the largest publicly available benchmark set of C verification tasks, in which we e"},"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":"1908.06271","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2019-08-17T09:29:01Z","cross_cats_sorted":[],"title_canon_sha256":"332d4154067faa9f4e2e794e4864d3a8c3ee8681eea119246ec3f7e36b036f71","abstract_canon_sha256":"1183522e30495db6dc17ab94400641fbcf8ca444bbc3179abe0350f0912d906e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:43:02.978628Z","signature_b64":"oryWNZ5JKtobXGRDU5X9ne+36oX7uKAsCBdDnukpXFKX85bvDyuU/a+3klJ3ADSfQlZTWQ7DUtHXOeZZe6uRAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5e822c56e1181091d043a48236d1a9aa8753998021f900bdda1e69c6288a87a7","last_reissued_at":"2026-07-05T00:43:02.978205Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:43:02.978205Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Software Verification with PDR: Implementation and Empirical Evaluation of the State of the Art","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SE","authors_text":"Dirk Beyer, Matthias Dangl","submitted_at":"2019-08-17T09:29:01Z","abstract_excerpt":"Property-directed reachability (PDR) is a SAT/SMT-based reachability algorithm that incrementally constructs inductive invariants. After it was successfully applied to hardware model checking, several adaptations to software model checking have been proposed. We contribute a replicable and thorough comparative evaluation of the state of the art: We (1) implemented a standalone PDR algorithm and, as improvement, a PDR-based auxiliary-invariant generator for k-induction, and (2) performed an experimental study on the largest publicly available benchmark set of C verification tasks, in which we e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.06271","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.06271/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1908.06271","created_at":"2026-07-05T00:43:02.978261+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.06271v2","created_at":"2026-07-05T00:43:02.978261+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.06271","created_at":"2026-07-05T00:43:02.978261+00:00"},{"alias_kind":"pith_short_12","alias_value":"L2BCYVXBDAIJ","created_at":"2026-07-05T00:43:02.978261+00:00"},{"alias_kind":"pith_short_16","alias_value":"L2BCYVXBDAIJDUCD","created_at":"2026-07-05T00:43:02.978261+00:00"},{"alias_kind":"pith_short_8","alias_value":"L2BCYVXB","created_at":"2026-07-05T00:43:02.978261+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/L2BCYVXBDAIJDUCDUSBDNUNJVK","json":"https://pith.science/pith/L2BCYVXBDAIJDUCDUSBDNUNJVK.json","graph_json":"https://pith.science/api/pith-number/L2BCYVXBDAIJDUCDUSBDNUNJVK/graph.json","events_json":"https://pith.science/api/pith-number/L2BCYVXBDAIJDUCDUSBDNUNJVK/events.json","paper":"https://pith.science/paper/L2BCYVXB"},"agent_actions":{"view_html":"https://pith.science/pith/L2BCYVXBDAIJDUCDUSBDNUNJVK","download_json":"https://pith.science/pith/L2BCYVXBDAIJDUCDUSBDNUNJVK.json","view_paper":"https://pith.science/paper/L2BCYVXB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.06271&json=true","fetch_graph":"https://pith.science/api/pith-number/L2BCYVXBDAIJDUCDUSBDNUNJVK/graph.json","fetch_events":"https://pith.science/api/pith-number/L2BCYVXBDAIJDUCDUSBDNUNJVK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L2BCYVXBDAIJDUCDUSBDNUNJVK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L2BCYVXBDAIJDUCDUSBDNUNJVK/action/storage_attestation","attest_author":"https://pith.science/pith/L2BCYVXBDAIJDUCDUSBDNUNJVK/action/author_attestation","sign_citation":"https://pith.science/pith/L2BCYVXBDAIJDUCDUSBDNUNJVK/action/citation_signature","submit_replication":"https://pith.science/pith/L2BCYVXBDAIJDUCDUSBDNUNJVK/action/replication_record"}},"created_at":"2026-07-05T00:43:02.978261+00:00","updated_at":"2026-07-05T00:43:02.978261+00:00"}