{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:J3JFUS3NNZWRKCX5TSRFTYZJKP","short_pith_number":"pith:J3JFUS3N","schema_version":"1.0","canonical_sha256":"4ed25a4b6d6e6d150afd9ca259e32953e75af57daf6e47aa7ba60ccebafbad31","source":{"kind":"arxiv","id":"1602.09061","version":1},"attestation_state":"computed","paper":{"title":"Bounded Model Checking of Pointer Programs Revisited","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"cs.LO","authors_text":"Piotr Witkowski, Witold Charatonik","submitted_at":"2016-02-29T17:35:28Z","abstract_excerpt":"Bounded model checking of pointer programs is a debugging technique for programs that manipulate dynamically allocated pointer structures on the heap. It is based on the following four observations. First, error conditions like dereference of a dangling pointer, are expressible in a~fragment of first-order logic with two-variables. Second, the fragment is closed under weakest preconditions wrt. finite paths. Third, data structures like trees, lists etc. are expressible by inductive predicates defined in a fragment of Datalog. Finally, the combination of the two fragments of the two-variable lo"},"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":"1602.09061","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-02-29T17:35:28Z","cross_cats_sorted":["cs.PL"],"title_canon_sha256":"bffce8fb617bcfacc73a87d34a511a7b4a33517a7b8811b2ac6b9765bcd2c157","abstract_canon_sha256":"63eb536a37aa76dff014b2441d4cf9587a3e3f8062b4b2b2289ba7913f4f0c11"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:47.055707Z","signature_b64":"yhwrDUUDkh2OaCKqQJKJ37k8ypS8EPnCIOQ+HvJSAFMCvNoV7NmgwlZUWcDGoTfAzEMS+/a4qry6L5cMfvvrAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4ed25a4b6d6e6d150afd9ca259e32953e75af57daf6e47aa7ba60ccebafbad31","last_reissued_at":"2026-05-18T01:19:47.055344Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:47.055344Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bounded Model Checking of Pointer Programs Revisited","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"cs.LO","authors_text":"Piotr Witkowski, Witold Charatonik","submitted_at":"2016-02-29T17:35:28Z","abstract_excerpt":"Bounded model checking of pointer programs is a debugging technique for programs that manipulate dynamically allocated pointer structures on the heap. It is based on the following four observations. First, error conditions like dereference of a dangling pointer, are expressible in a~fragment of first-order logic with two-variables. Second, the fragment is closed under weakest preconditions wrt. finite paths. Third, data structures like trees, lists etc. are expressible by inductive predicates defined in a fragment of Datalog. Finally, the combination of the two fragments of the two-variable lo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.09061","kind":"arxiv","version":1},"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":"1602.09061","created_at":"2026-05-18T01:19:47.055397+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.09061v1","created_at":"2026-05-18T01:19:47.055397+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.09061","created_at":"2026-05-18T01:19:47.055397+00:00"},{"alias_kind":"pith_short_12","alias_value":"J3JFUS3NNZWR","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_16","alias_value":"J3JFUS3NNZWRKCX5","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_8","alias_value":"J3JFUS3N","created_at":"2026-05-18T12:30:22.444734+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/J3JFUS3NNZWRKCX5TSRFTYZJKP","json":"https://pith.science/pith/J3JFUS3NNZWRKCX5TSRFTYZJKP.json","graph_json":"https://pith.science/api/pith-number/J3JFUS3NNZWRKCX5TSRFTYZJKP/graph.json","events_json":"https://pith.science/api/pith-number/J3JFUS3NNZWRKCX5TSRFTYZJKP/events.json","paper":"https://pith.science/paper/J3JFUS3N"},"agent_actions":{"view_html":"https://pith.science/pith/J3JFUS3NNZWRKCX5TSRFTYZJKP","download_json":"https://pith.science/pith/J3JFUS3NNZWRKCX5TSRFTYZJKP.json","view_paper":"https://pith.science/paper/J3JFUS3N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.09061&json=true","fetch_graph":"https://pith.science/api/pith-number/J3JFUS3NNZWRKCX5TSRFTYZJKP/graph.json","fetch_events":"https://pith.science/api/pith-number/J3JFUS3NNZWRKCX5TSRFTYZJKP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J3JFUS3NNZWRKCX5TSRFTYZJKP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J3JFUS3NNZWRKCX5TSRFTYZJKP/action/storage_attestation","attest_author":"https://pith.science/pith/J3JFUS3NNZWRKCX5TSRFTYZJKP/action/author_attestation","sign_citation":"https://pith.science/pith/J3JFUS3NNZWRKCX5TSRFTYZJKP/action/citation_signature","submit_replication":"https://pith.science/pith/J3JFUS3NNZWRKCX5TSRFTYZJKP/action/replication_record"}},"created_at":"2026-05-18T01:19:47.055397+00:00","updated_at":"2026-05-18T01:19:47.055397+00:00"}