{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:THBV6T77YXUEHNMXBK3Q2XQNH2","short_pith_number":"pith:THBV6T77","schema_version":"1.0","canonical_sha256":"99c35f4fffc5e843b5970ab70d5e0d3e8411535f6ad695c510928b823ed18bfb","source":{"kind":"arxiv","id":"1012.3100","version":1},"attestation_state":"computed","paper":{"title":"Secure Information Flow by Model Checking Pushdown System","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Cong Sun, Liyong Tang, Zhong Chen","submitted_at":"2010-12-14T17:34:56Z","abstract_excerpt":"We propose an approach on model checking information flow for imperative language with procedures. We characterize our model with pushdown system, which has a stack of unbounded length that naturally models the execution of procedural programs. Because the type-based static analysis is sometimes too conservative and rejects safe program as ill-typed, we take a semantic-based approach by self-composing symbolic pushdown system and specifying noninterference with LTL formula. Then we verify this LTL-expressed property via model checker Moped. Except for overcoming the conservative characteristic"},"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":"1012.3100","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2010-12-14T17:34:56Z","cross_cats_sorted":[],"title_canon_sha256":"7bd864f98801a378039fc35bcd0bc300a7b9972d817ac949abf48f2407c3a0e0","abstract_canon_sha256":"40afdde3fe2842f7bf13e45eb0d22b8bc1ae2e87c4c15be31eaacc91fec2fe27"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:33:18.611123Z","signature_b64":"/uiixo6Af1tg1Ne5rPRDPFC9iXuyWFArloaBAGKaVgDtEotx7dd0u/kGi53p05n5nERIq0hHIYYdVHA58arXDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"99c35f4fffc5e843b5970ab70d5e0d3e8411535f6ad695c510928b823ed18bfb","last_reissued_at":"2026-05-18T04:33:18.610526Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:33:18.610526Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Secure Information Flow by Model Checking Pushdown System","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Cong Sun, Liyong Tang, Zhong Chen","submitted_at":"2010-12-14T17:34:56Z","abstract_excerpt":"We propose an approach on model checking information flow for imperative language with procedures. We characterize our model with pushdown system, which has a stack of unbounded length that naturally models the execution of procedural programs. Because the type-based static analysis is sometimes too conservative and rejects safe program as ill-typed, we take a semantic-based approach by self-composing symbolic pushdown system and specifying noninterference with LTL formula. Then we verify this LTL-expressed property via model checker Moped. Except for overcoming the conservative characteristic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.3100","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":"1012.3100","created_at":"2026-05-18T04:33:18.610596+00:00"},{"alias_kind":"arxiv_version","alias_value":"1012.3100v1","created_at":"2026-05-18T04:33:18.610596+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.3100","created_at":"2026-05-18T04:33:18.610596+00:00"},{"alias_kind":"pith_short_12","alias_value":"THBV6T77YXUE","created_at":"2026-05-18T12:26:13.927090+00:00"},{"alias_kind":"pith_short_16","alias_value":"THBV6T77YXUEHNMX","created_at":"2026-05-18T12:26:13.927090+00:00"},{"alias_kind":"pith_short_8","alias_value":"THBV6T77","created_at":"2026-05-18T12:26:13.927090+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/THBV6T77YXUEHNMXBK3Q2XQNH2","json":"https://pith.science/pith/THBV6T77YXUEHNMXBK3Q2XQNH2.json","graph_json":"https://pith.science/api/pith-number/THBV6T77YXUEHNMXBK3Q2XQNH2/graph.json","events_json":"https://pith.science/api/pith-number/THBV6T77YXUEHNMXBK3Q2XQNH2/events.json","paper":"https://pith.science/paper/THBV6T77"},"agent_actions":{"view_html":"https://pith.science/pith/THBV6T77YXUEHNMXBK3Q2XQNH2","download_json":"https://pith.science/pith/THBV6T77YXUEHNMXBK3Q2XQNH2.json","view_paper":"https://pith.science/paper/THBV6T77","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1012.3100&json=true","fetch_graph":"https://pith.science/api/pith-number/THBV6T77YXUEHNMXBK3Q2XQNH2/graph.json","fetch_events":"https://pith.science/api/pith-number/THBV6T77YXUEHNMXBK3Q2XQNH2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/THBV6T77YXUEHNMXBK3Q2XQNH2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/THBV6T77YXUEHNMXBK3Q2XQNH2/action/storage_attestation","attest_author":"https://pith.science/pith/THBV6T77YXUEHNMXBK3Q2XQNH2/action/author_attestation","sign_citation":"https://pith.science/pith/THBV6T77YXUEHNMXBK3Q2XQNH2/action/citation_signature","submit_replication":"https://pith.science/pith/THBV6T77YXUEHNMXBK3Q2XQNH2/action/replication_record"}},"created_at":"2026-05-18T04:33:18.610596+00:00","updated_at":"2026-05-18T04:33:18.610596+00:00"}