{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:FQGLZT65FF7O3ZZLPX5E4AYZWA","short_pith_number":"pith:FQGLZT65","canonical_record":{"source":{"id":"1708.07226","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-08-24T00:20:08Z","cross_cats_sorted":[],"title_canon_sha256":"5a7cf9e27b65cc59a5b6daade9b8dbdaf0f1331bdb41eaac78ab707c3d6d6962","abstract_canon_sha256":"9d7ab9c296736635b65e94490a8417038711e3f6191b01c1857cc344212997a1"},"schema_version":"1.0"},"canonical_sha256":"2c0cbccfdd297eede72b7dfa4e0319b035c6aa3bd5cfa2e8f6d62be2001b902f","source":{"kind":"arxiv","id":"1708.07226","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.07226","created_at":"2026-05-18T00:36:46Z"},{"alias_kind":"arxiv_version","alias_value":"1708.07226v1","created_at":"2026-05-18T00:36:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.07226","created_at":"2026-05-18T00:36:46Z"},{"alias_kind":"pith_short_12","alias_value":"FQGLZT65FF7O","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FQGLZT65FF7O3ZZL","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FQGLZT65","created_at":"2026-05-18T12:31:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:FQGLZT65FF7O3ZZLPX5E4AYZWA","target":"record","payload":{"canonical_record":{"source":{"id":"1708.07226","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-08-24T00:20:08Z","cross_cats_sorted":[],"title_canon_sha256":"5a7cf9e27b65cc59a5b6daade9b8dbdaf0f1331bdb41eaac78ab707c3d6d6962","abstract_canon_sha256":"9d7ab9c296736635b65e94490a8417038711e3f6191b01c1857cc344212997a1"},"schema_version":"1.0"},"canonical_sha256":"2c0cbccfdd297eede72b7dfa4e0319b035c6aa3bd5cfa2e8f6d62be2001b902f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:46.866114Z","signature_b64":"WMXAJOY3RYJueK4Z289CtpUgGDreYFBjX3UkeJncaXJWOTLtuf7JCGCtJv/ZK0QqAFcL5O+/bwNtY4Dzy1esCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2c0cbccfdd297eede72b7dfa4e0319b035c6aa3bd5cfa2e8f6d62be2001b902f","last_reissued_at":"2026-05-18T00:36:46.865451Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:46.865451Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.07226","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:36:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fDxMCbLgOps9rnMeUcw4LDBDkJHscyC6Vrsqtq55qEzTaGhoYWMs/6Ee/qP1jLbnoiaeToX5MdHqjjgJ34yvDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T21:18:40.173439Z"},"content_sha256":"a904a7a798dbf7cd4beebc8c6071763d5f2b8ad05d0a3402802449665b481439","schema_version":"1.0","event_id":"sha256:a904a7a798dbf7cd4beebc8c6071763d5f2b8ad05d0a3402802449665b481439"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:FQGLZT65FF7O3ZZLPX5E4AYZWA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"From Concurrent Programs to Simulating Sequential Programs: Correctness of a Transformation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Allan Blanchard (Univ. Orl\\'eans, CEA LIST, Cyber Systems, Flagstaff, France), Fr\\'ed\\'eric Loulergue (Northern Arizona University, INSA Centre Val de Loire, Nikolai Kosmatov (Software Reliability Laboratory, School of Informatics Computing, USA)","submitted_at":"2017-08-24T00:20:08Z","abstract_excerpt":"Frama-C is a software analysis framework that provides a common infrastructure and a common behavioral specification language to plugins that implement various static and dynamic analyses of C programs. Most plugins do not support concurrency. We have proposed Conc2Seq, a Frama-C plugin based on program transformation, capable to leverage the existing huge code base of plugins and to handle concurrent C programs.\n  In this paper we formalize and sketch the proof of correctness of the program transformation principle behind Conc2Seq, and present an effort towards the full mechanization of both "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.07226","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:36:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RcHpPFLWT8/vmKpagcGRgCXsAVzo6sNBei0XhLpPhaM/RD44EAHQSL3qYFa+LKKdWq/6c8z3Y8yBDxNvNF5DAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T21:18:40.173997Z"},"content_sha256":"25110ff3fbbcd0912c10bcdac7b20a2101c235ad8b7b535b906d5095fb5b38f3","schema_version":"1.0","event_id":"sha256:25110ff3fbbcd0912c10bcdac7b20a2101c235ad8b7b535b906d5095fb5b38f3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FQGLZT65FF7O3ZZLPX5E4AYZWA/bundle.json","state_url":"https://pith.science/pith/FQGLZT65FF7O3ZZLPX5E4AYZWA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FQGLZT65FF7O3ZZLPX5E4AYZWA/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-26T21:18:40Z","links":{"resolver":"https://pith.science/pith/FQGLZT65FF7O3ZZLPX5E4AYZWA","bundle":"https://pith.science/pith/FQGLZT65FF7O3ZZLPX5E4AYZWA/bundle.json","state":"https://pith.science/pith/FQGLZT65FF7O3ZZLPX5E4AYZWA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FQGLZT65FF7O3ZZLPX5E4AYZWA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:FQGLZT65FF7O3ZZLPX5E4AYZWA","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"9d7ab9c296736635b65e94490a8417038711e3f6191b01c1857cc344212997a1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-08-24T00:20:08Z","title_canon_sha256":"5a7cf9e27b65cc59a5b6daade9b8dbdaf0f1331bdb41eaac78ab707c3d6d6962"},"schema_version":"1.0","source":{"id":"1708.07226","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.07226","created_at":"2026-05-18T00:36:46Z"},{"alias_kind":"arxiv_version","alias_value":"1708.07226v1","created_at":"2026-05-18T00:36:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.07226","created_at":"2026-05-18T00:36:46Z"},{"alias_kind":"pith_short_12","alias_value":"FQGLZT65FF7O","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FQGLZT65FF7O3ZZL","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FQGLZT65","created_at":"2026-05-18T12:31:15Z"}],"graph_snapshots":[{"event_id":"sha256:25110ff3fbbcd0912c10bcdac7b20a2101c235ad8b7b535b906d5095fb5b38f3","target":"graph","created_at":"2026-05-18T00:36:46Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Frama-C is a software analysis framework that provides a common infrastructure and a common behavioral specification language to plugins that implement various static and dynamic analyses of C programs. Most plugins do not support concurrency. We have proposed Conc2Seq, a Frama-C plugin based on program transformation, capable to leverage the existing huge code base of plugins and to handle concurrent C programs.\n  In this paper we formalize and sketch the proof of correctness of the program transformation principle behind Conc2Seq, and present an effort towards the full mechanization of both ","authors_text":"Allan Blanchard (Univ. Orl\\'eans, CEA LIST, Cyber Systems, Flagstaff, France), Fr\\'ed\\'eric Loulergue (Northern Arizona University, INSA Centre Val de Loire, Nikolai Kosmatov (Software Reliability Laboratory, School of Informatics Computing, USA)","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-08-24T00:20:08Z","title":"From Concurrent Programs to Simulating Sequential Programs: Correctness of a Transformation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.07226","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:a904a7a798dbf7cd4beebc8c6071763d5f2b8ad05d0a3402802449665b481439","target":"record","created_at":"2026-05-18T00:36:46Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"9d7ab9c296736635b65e94490a8417038711e3f6191b01c1857cc344212997a1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-08-24T00:20:08Z","title_canon_sha256":"5a7cf9e27b65cc59a5b6daade9b8dbdaf0f1331bdb41eaac78ab707c3d6d6962"},"schema_version":"1.0","source":{"id":"1708.07226","kind":"arxiv","version":1}},"canonical_sha256":"2c0cbccfdd297eede72b7dfa4e0319b035c6aa3bd5cfa2e8f6d62be2001b902f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2c0cbccfdd297eede72b7dfa4e0319b035c6aa3bd5cfa2e8f6d62be2001b902f","first_computed_at":"2026-05-18T00:36:46.865451Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:36:46.865451Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WMXAJOY3RYJueK4Z289CtpUgGDreYFBjX3UkeJncaXJWOTLtuf7JCGCtJv/ZK0QqAFcL5O+/bwNtY4Dzy1esCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:36:46.866114Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.07226","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a904a7a798dbf7cd4beebc8c6071763d5f2b8ad05d0a3402802449665b481439","sha256:25110ff3fbbcd0912c10bcdac7b20a2101c235ad8b7b535b906d5095fb5b38f3"],"state_sha256":"84cebe66a9e02750ada025bd1de4c238dbb61102e68805d2ba798f010fa4df1b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xs2Ji10+2uVz0dFhL/1fYXBZPEHxSuO7OaE5vpJwEuxJD1z+qz8/fthHl5lT2ztY0kZWGbefJEsC4IxpKwMsAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T21:18:40.177498Z","bundle_sha256":"186fd793fbf7cd4269c088dfb195261702568d3068b20860009be6c5f0d0fcdb"}}