{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:ARERO36D44K6KZA62A7NBJVRCT","short_pith_number":"pith:ARERO36D","schema_version":"1.0","canonical_sha256":"0449176fc3e715e5641ed03ed0a6b114ddcce4ab5d89e7cf92e520c667f6a529","source":{"kind":"arxiv","id":"1501.02699","version":1},"attestation_state":"computed","paper":{"title":"Closing the Gap -- Formally Verifying Dynamically Typed Programs like Statically Typed Ones Using Hoare Logic -- Extended Version --","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO","cs.SE"],"primary_cat":"cs.PL","authors_text":"Bj\\\"orn Engelmann, Ernst-R\\\"udiger Olderog, Nils Erik Flick","submitted_at":"2015-01-12T16:30:00Z","abstract_excerpt":"Dynamically typed object-oriented languages enable programmers to write elegant, reusable and extensible programs. However, with the current methodology for program verification, the absence of static type information creates significant overhead. Our proposal is two-fold:\n  First, we propose a layer of abstraction hiding the complexity of dynamic typing when provided with sufficient type information. Since this essentially creates the illusion of verifying a statically-typed program, the effort required is equivalent to the statically-typed case.\n  Second, we show how the required type inform"},"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":"1501.02699","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2015-01-12T16:30:00Z","cross_cats_sorted":["cs.LO","cs.SE"],"title_canon_sha256":"2b116554ff41334ad75f59b86723eed51b287fbcdadc2eae5323ca301ea23e85","abstract_canon_sha256":"677f18a119364c1b83e77bbaad2afa3928db367b6e31a6d52e12ae800981cd4d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:29:37.458514Z","signature_b64":"oVQJ0LECEShApHpePMSSqlUTGF5tCAD9z8UvINIOlt/IhsJVUqU9xyWebdT81JxzxZPsO0Hei4GqbJPWWDrrDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0449176fc3e715e5641ed03ed0a6b114ddcce4ab5d89e7cf92e520c667f6a529","last_reissued_at":"2026-05-18T02:29:37.458072Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:29:37.458072Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Closing the Gap -- Formally Verifying Dynamically Typed Programs like Statically Typed Ones Using Hoare Logic -- Extended Version --","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO","cs.SE"],"primary_cat":"cs.PL","authors_text":"Bj\\\"orn Engelmann, Ernst-R\\\"udiger Olderog, Nils Erik Flick","submitted_at":"2015-01-12T16:30:00Z","abstract_excerpt":"Dynamically typed object-oriented languages enable programmers to write elegant, reusable and extensible programs. However, with the current methodology for program verification, the absence of static type information creates significant overhead. Our proposal is two-fold:\n  First, we propose a layer of abstraction hiding the complexity of dynamic typing when provided with sufficient type information. Since this essentially creates the illusion of verifying a statically-typed program, the effort required is equivalent to the statically-typed case.\n  Second, we show how the required type inform"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.02699","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":"1501.02699","created_at":"2026-05-18T02:29:37.458142+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.02699v1","created_at":"2026-05-18T02:29:37.458142+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.02699","created_at":"2026-05-18T02:29:37.458142+00:00"},{"alias_kind":"pith_short_12","alias_value":"ARERO36D44K6","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_16","alias_value":"ARERO36D44K6KZA6","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_8","alias_value":"ARERO36D","created_at":"2026-05-18T12:29:10.953037+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/ARERO36D44K6KZA62A7NBJVRCT","json":"https://pith.science/pith/ARERO36D44K6KZA62A7NBJVRCT.json","graph_json":"https://pith.science/api/pith-number/ARERO36D44K6KZA62A7NBJVRCT/graph.json","events_json":"https://pith.science/api/pith-number/ARERO36D44K6KZA62A7NBJVRCT/events.json","paper":"https://pith.science/paper/ARERO36D"},"agent_actions":{"view_html":"https://pith.science/pith/ARERO36D44K6KZA62A7NBJVRCT","download_json":"https://pith.science/pith/ARERO36D44K6KZA62A7NBJVRCT.json","view_paper":"https://pith.science/paper/ARERO36D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.02699&json=true","fetch_graph":"https://pith.science/api/pith-number/ARERO36D44K6KZA62A7NBJVRCT/graph.json","fetch_events":"https://pith.science/api/pith-number/ARERO36D44K6KZA62A7NBJVRCT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ARERO36D44K6KZA62A7NBJVRCT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ARERO36D44K6KZA62A7NBJVRCT/action/storage_attestation","attest_author":"https://pith.science/pith/ARERO36D44K6KZA62A7NBJVRCT/action/author_attestation","sign_citation":"https://pith.science/pith/ARERO36D44K6KZA62A7NBJVRCT/action/citation_signature","submit_replication":"https://pith.science/pith/ARERO36D44K6KZA62A7NBJVRCT/action/replication_record"}},"created_at":"2026-05-18T02:29:37.458142+00:00","updated_at":"2026-05-18T02:29:37.458142+00:00"}