{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:7DTHRV3CA23OCQA6RQ2X6WCHOD","short_pith_number":"pith:7DTHRV3C","schema_version":"1.0","canonical_sha256":"f8e678d76206b6e1401e8c357f584770fa508aaa185e97bb575751c19c0346a8","source":{"kind":"arxiv","id":"1902.05436","version":1},"attestation_state":"computed","paper":{"title":"Checking Observational Purity of Procedures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"cs.SE","authors_text":"(2) Microsoft Research), Bangalore, G. Ramalingam (2) ((1) Indian Institute of Science, Himanshu Arora (1), Raghavan Komondoor (1)","submitted_at":"2019-02-14T15:30:01Z","abstract_excerpt":"Verifying whether a procedure is observationally pure is useful in many software engineering scenarios. An observationally pure procedure always returns the same value for the same argument, and thus mimics a mathematical function. The problem is challenging when procedures use private mutable global variables, e.g., for memoization of frequently returned answers, and when they involve recursion.\n  We present a novel verification approach for this problem. Our approach involves encoding the procedure's code as a formula that is a disjunction of path constraints, with the recursive calls being "},"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":"1902.05436","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2019-02-14T15:30:01Z","cross_cats_sorted":["cs.PL"],"title_canon_sha256":"f1eebcb88c393b3eef35de4f5e557e4cf769094a22991fdb319467023b1a4b5d","abstract_canon_sha256":"55e2d6d7a8fa0189f867a724dc4720357a794de03c235a3b3ef3f775864ef09d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:00.774020Z","signature_b64":"cvStLX6rJ1IwwTQbZudVj9LpKPs81WorJ9vKnBVRYQtQMHZ4Fj7ivRewsrNFN/DQwThl4NRl9dJ9UOxd0LvFCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f8e678d76206b6e1401e8c357f584770fa508aaa185e97bb575751c19c0346a8","last_reissued_at":"2026-05-17T23:54:00.773311Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:00.773311Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Checking Observational Purity of Procedures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"cs.SE","authors_text":"(2) Microsoft Research), Bangalore, G. Ramalingam (2) ((1) Indian Institute of Science, Himanshu Arora (1), Raghavan Komondoor (1)","submitted_at":"2019-02-14T15:30:01Z","abstract_excerpt":"Verifying whether a procedure is observationally pure is useful in many software engineering scenarios. An observationally pure procedure always returns the same value for the same argument, and thus mimics a mathematical function. The problem is challenging when procedures use private mutable global variables, e.g., for memoization of frequently returned answers, and when they involve recursion.\n  We present a novel verification approach for this problem. Our approach involves encoding the procedure's code as a formula that is a disjunction of path constraints, with the recursive calls being "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.05436","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":"1902.05436","created_at":"2026-05-17T23:54:00.773439+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.05436v1","created_at":"2026-05-17T23:54:00.773439+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.05436","created_at":"2026-05-17T23:54:00.773439+00:00"},{"alias_kind":"pith_short_12","alias_value":"7DTHRV3CA23O","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_16","alias_value":"7DTHRV3CA23OCQA6","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_8","alias_value":"7DTHRV3C","created_at":"2026-05-18T12:33:12.712433+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/7DTHRV3CA23OCQA6RQ2X6WCHOD","json":"https://pith.science/pith/7DTHRV3CA23OCQA6RQ2X6WCHOD.json","graph_json":"https://pith.science/api/pith-number/7DTHRV3CA23OCQA6RQ2X6WCHOD/graph.json","events_json":"https://pith.science/api/pith-number/7DTHRV3CA23OCQA6RQ2X6WCHOD/events.json","paper":"https://pith.science/paper/7DTHRV3C"},"agent_actions":{"view_html":"https://pith.science/pith/7DTHRV3CA23OCQA6RQ2X6WCHOD","download_json":"https://pith.science/pith/7DTHRV3CA23OCQA6RQ2X6WCHOD.json","view_paper":"https://pith.science/paper/7DTHRV3C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.05436&json=true","fetch_graph":"https://pith.science/api/pith-number/7DTHRV3CA23OCQA6RQ2X6WCHOD/graph.json","fetch_events":"https://pith.science/api/pith-number/7DTHRV3CA23OCQA6RQ2X6WCHOD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7DTHRV3CA23OCQA6RQ2X6WCHOD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7DTHRV3CA23OCQA6RQ2X6WCHOD/action/storage_attestation","attest_author":"https://pith.science/pith/7DTHRV3CA23OCQA6RQ2X6WCHOD/action/author_attestation","sign_citation":"https://pith.science/pith/7DTHRV3CA23OCQA6RQ2X6WCHOD/action/citation_signature","submit_replication":"https://pith.science/pith/7DTHRV3CA23OCQA6RQ2X6WCHOD/action/replication_record"}},"created_at":"2026-05-17T23:54:00.773439+00:00","updated_at":"2026-05-17T23:54:00.773439+00:00"}