{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:5Z4VSBKMSK3GFBRJ55LOE5RNHK","short_pith_number":"pith:5Z4VSBKM","schema_version":"1.0","canonical_sha256":"ee7959054c92b6628629ef56e2762d3a8a2267f87fdd26bdf064d23d659c9bae","source":{"kind":"arxiv","id":"2211.03450","version":1},"attestation_state":"computed","paper":{"title":"Symbolic Abstract Heaps for Polymorphic Information-flow Guard Inference (Extended Version)","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CR","cs.FL","cs.SC"],"primary_cat":"cs.PL","authors_text":"Narges Khakpour, Nicolas Berthier","submitted_at":"2022-11-07T11:05:44Z","abstract_excerpt":"In the realm of sound object-oriented program analyses for information-flow control, very few approaches adopt flow-sensitive abstractions of the heap that enable a precise modeling of implicit flows. To tackle this challenge, we advance a new symbolic abstraction approach for modeling the heap in Java-like programs. We use a store-less representation that is parameterized with a family of relations among references to offer various levels of precision based on user preferences. This enables us to automatically infer polymorphic information-flow guards for methods via a co-reachability analysi"},"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":"2211.03450","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2022-11-07T11:05:44Z","cross_cats_sorted":["cs.CR","cs.FL","cs.SC"],"title_canon_sha256":"1e6291e8f43417ee1c3ddcf65b7f09533af1f2510a026f8217cad1c5c88badf2","abstract_canon_sha256":"63496a687e65513e64143c12b99aa38e26d096f455610aae1e42f73c8880d245"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:13:48.804043Z","signature_b64":"7wKVPG2P9zkDYjVoaStbBz+pkHGC0yR+sR/YJqnegEqgySj9pbd67pU5/iYSfGmisQV8iM/BjOoXR+4uDsO3Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ee7959054c92b6628629ef56e2762d3a8a2267f87fdd26bdf064d23d659c9bae","last_reissued_at":"2026-07-05T05:13:48.803631Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:13:48.803631Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Symbolic Abstract Heaps for Polymorphic Information-flow Guard Inference (Extended Version)","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CR","cs.FL","cs.SC"],"primary_cat":"cs.PL","authors_text":"Narges Khakpour, Nicolas Berthier","submitted_at":"2022-11-07T11:05:44Z","abstract_excerpt":"In the realm of sound object-oriented program analyses for information-flow control, very few approaches adopt flow-sensitive abstractions of the heap that enable a precise modeling of implicit flows. To tackle this challenge, we advance a new symbolic abstraction approach for modeling the heap in Java-like programs. We use a store-less representation that is parameterized with a family of relations among references to offer various levels of precision based on user preferences. This enables us to automatically infer polymorphic information-flow guards for methods via a co-reachability analysi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.03450","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2211.03450/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":"2211.03450","created_at":"2026-07-05T05:13:48.803696+00:00"},{"alias_kind":"arxiv_version","alias_value":"2211.03450v1","created_at":"2026-07-05T05:13:48.803696+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.03450","created_at":"2026-07-05T05:13:48.803696+00:00"},{"alias_kind":"pith_short_12","alias_value":"5Z4VSBKMSK3G","created_at":"2026-07-05T05:13:48.803696+00:00"},{"alias_kind":"pith_short_16","alias_value":"5Z4VSBKMSK3GFBRJ","created_at":"2026-07-05T05:13:48.803696+00:00"},{"alias_kind":"pith_short_8","alias_value":"5Z4VSBKM","created_at":"2026-07-05T05:13:48.803696+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/5Z4VSBKMSK3GFBRJ55LOE5RNHK","json":"https://pith.science/pith/5Z4VSBKMSK3GFBRJ55LOE5RNHK.json","graph_json":"https://pith.science/api/pith-number/5Z4VSBKMSK3GFBRJ55LOE5RNHK/graph.json","events_json":"https://pith.science/api/pith-number/5Z4VSBKMSK3GFBRJ55LOE5RNHK/events.json","paper":"https://pith.science/paper/5Z4VSBKM"},"agent_actions":{"view_html":"https://pith.science/pith/5Z4VSBKMSK3GFBRJ55LOE5RNHK","download_json":"https://pith.science/pith/5Z4VSBKMSK3GFBRJ55LOE5RNHK.json","view_paper":"https://pith.science/paper/5Z4VSBKM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2211.03450&json=true","fetch_graph":"https://pith.science/api/pith-number/5Z4VSBKMSK3GFBRJ55LOE5RNHK/graph.json","fetch_events":"https://pith.science/api/pith-number/5Z4VSBKMSK3GFBRJ55LOE5RNHK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5Z4VSBKMSK3GFBRJ55LOE5RNHK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5Z4VSBKMSK3GFBRJ55LOE5RNHK/action/storage_attestation","attest_author":"https://pith.science/pith/5Z4VSBKMSK3GFBRJ55LOE5RNHK/action/author_attestation","sign_citation":"https://pith.science/pith/5Z4VSBKMSK3GFBRJ55LOE5RNHK/action/citation_signature","submit_replication":"https://pith.science/pith/5Z4VSBKMSK3GFBRJ55LOE5RNHK/action/replication_record"}},"created_at":"2026-07-05T05:13:48.803696+00:00","updated_at":"2026-07-05T05:13:48.803696+00:00"}