{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:ESYXKTRQF27A3O373REXZOR26Q","short_pith_number":"pith:ESYXKTRQ","schema_version":"1.0","canonical_sha256":"24b1754e302ebe0dbb7fdc497cba3af4002dff78fe57ba2d3eb959b4398abd8c","source":{"kind":"arxiv","id":"1901.01915","version":1},"attestation_state":"computed","paper":{"title":"Different Maps for Different Uses. A Program Transformation for Intermediate Verification Languages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SE","authors_text":"Alexander Nutz, Andreas Podelski, Daniel Dietsch, Jochen Hoenicke, Matthias Heizmann","submitted_at":"2019-01-07T16:48:12Z","abstract_excerpt":"In theorem prover or SMT solver based verification, the program to be verified is often given in an intermediate verification language such as Boogie, Why, or CHC. This setting raises new challenges. We investigate a preprocessing step which takes the similar role that alias analysis plays in verification, except that now, a (mathematical) map is used to model the memory or a data object of type array. We present a program transformation that takes a program P to an equivalent program P' such that, by verifying P' instead of P, we can reduce the burden of the exponential explosion in the numbe"},"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":"1901.01915","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2019-01-07T16:48:12Z","cross_cats_sorted":[],"title_canon_sha256":"f71b810f2ab9f44d88ec0788fc94a655cdd8a8add60e97f9d76e7f8c39483dda","abstract_canon_sha256":"7a76d908577e4d83c1a27f2246da0e9878acb7c686e708ecf59a20fdfd680a8f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:49.338263Z","signature_b64":"gp8gMG0QrxEwfOHHIQC8WL+zFgsC2qgewi83TyXznpKfu7R5Bho3JdCWDdC+uSVM8CE7bYn5TXUSpGv+yi04DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"24b1754e302ebe0dbb7fdc497cba3af4002dff78fe57ba2d3eb959b4398abd8c","last_reissued_at":"2026-05-17T23:56:49.337850Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:49.337850Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Different Maps for Different Uses. A Program Transformation for Intermediate Verification Languages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SE","authors_text":"Alexander Nutz, Andreas Podelski, Daniel Dietsch, Jochen Hoenicke, Matthias Heizmann","submitted_at":"2019-01-07T16:48:12Z","abstract_excerpt":"In theorem prover or SMT solver based verification, the program to be verified is often given in an intermediate verification language such as Boogie, Why, or CHC. This setting raises new challenges. We investigate a preprocessing step which takes the similar role that alias analysis plays in verification, except that now, a (mathematical) map is used to model the memory or a data object of type array. We present a program transformation that takes a program P to an equivalent program P' such that, by verifying P' instead of P, we can reduce the burden of the exponential explosion in the numbe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.01915","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":"1901.01915","created_at":"2026-05-17T23:56:49.337915+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.01915v1","created_at":"2026-05-17T23:56:49.337915+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.01915","created_at":"2026-05-17T23:56:49.337915+00:00"},{"alias_kind":"pith_short_12","alias_value":"ESYXKTRQF27A","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_16","alias_value":"ESYXKTRQF27A3O37","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_8","alias_value":"ESYXKTRQ","created_at":"2026-05-18T12:33:15.570797+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/ESYXKTRQF27A3O373REXZOR26Q","json":"https://pith.science/pith/ESYXKTRQF27A3O373REXZOR26Q.json","graph_json":"https://pith.science/api/pith-number/ESYXKTRQF27A3O373REXZOR26Q/graph.json","events_json":"https://pith.science/api/pith-number/ESYXKTRQF27A3O373REXZOR26Q/events.json","paper":"https://pith.science/paper/ESYXKTRQ"},"agent_actions":{"view_html":"https://pith.science/pith/ESYXKTRQF27A3O373REXZOR26Q","download_json":"https://pith.science/pith/ESYXKTRQF27A3O373REXZOR26Q.json","view_paper":"https://pith.science/paper/ESYXKTRQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.01915&json=true","fetch_graph":"https://pith.science/api/pith-number/ESYXKTRQF27A3O373REXZOR26Q/graph.json","fetch_events":"https://pith.science/api/pith-number/ESYXKTRQF27A3O373REXZOR26Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ESYXKTRQF27A3O373REXZOR26Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ESYXKTRQF27A3O373REXZOR26Q/action/storage_attestation","attest_author":"https://pith.science/pith/ESYXKTRQF27A3O373REXZOR26Q/action/author_attestation","sign_citation":"https://pith.science/pith/ESYXKTRQF27A3O373REXZOR26Q/action/citation_signature","submit_replication":"https://pith.science/pith/ESYXKTRQF27A3O373REXZOR26Q/action/replication_record"}},"created_at":"2026-05-17T23:56:49.337915+00:00","updated_at":"2026-05-17T23:56:49.337915+00:00"}