{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:OI3JTKXSYHKDJOBFMMOYIIUUSY","short_pith_number":"pith:OI3JTKXS","schema_version":"1.0","canonical_sha256":"723699aaf2c1d434b825631d8422949624204e8e3a7676655be5087a1bdb0c42","source":{"kind":"arxiv","id":"1111.1011","version":3},"attestation_state":"computed","paper":{"title":"Context-Bounded Analysis For Concurrent Programs With Dynamic Creation of Threads","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Ahmed Bouajjani (LIAFA, CNRS, Mohamed Faouzi Atig (LIAFA, Redmond), Shaz Qadeer (Microsoft Research, University of Paris Diderot (Paris 7))","submitted_at":"2011-11-03T23:37:53Z","abstract_excerpt":"Context-bounded analysis has been shown to be both efficient and effective at finding bugs in concurrent programs. According to its original definition, context-bounded analysis explores all behaviors of a concurrent program up to some fixed number of context switches between threads. This definition is inadequate for programs that create threads dynamically because bounding the number of context switches in a computation also bounds the number of threads involved in the computation. In this paper, we propose a more general definition of context-bounded analysis useful for programs with dynami"},"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":"1111.1011","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-11-03T23:37:53Z","cross_cats_sorted":[],"title_canon_sha256":"d0a9841bd65db349c063a53ee261f55e7b7a02f0014f89e9dff317e32adfe482","abstract_canon_sha256":"81f62240d4ca7582232ffc0ecfd228ce2db85c24ff9bbcca403cc3ba0c110107"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:39.169965Z","signature_b64":"vOA5rj+5Rcwxwa9yt4qbPyx69qQJxO7H27IcMS77XdoPW8agB+Gc73EDY09dUc2sCwGBBnU8IqzX1be6Gmr3Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"723699aaf2c1d434b825631d8422949624204e8e3a7676655be5087a1bdb0c42","last_reissued_at":"2026-05-18T01:37:39.169346Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:39.169346Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Context-Bounded Analysis For Concurrent Programs With Dynamic Creation of Threads","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Ahmed Bouajjani (LIAFA, CNRS, Mohamed Faouzi Atig (LIAFA, Redmond), Shaz Qadeer (Microsoft Research, University of Paris Diderot (Paris 7))","submitted_at":"2011-11-03T23:37:53Z","abstract_excerpt":"Context-bounded analysis has been shown to be both efficient and effective at finding bugs in concurrent programs. According to its original definition, context-bounded analysis explores all behaviors of a concurrent program up to some fixed number of context switches between threads. This definition is inadequate for programs that create threads dynamically because bounding the number of context switches in a computation also bounds the number of threads involved in the computation. In this paper, we propose a more general definition of context-bounded analysis useful for programs with dynami"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.1011","kind":"arxiv","version":3},"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":"1111.1011","created_at":"2026-05-18T01:37:39.169425+00:00"},{"alias_kind":"arxiv_version","alias_value":"1111.1011v3","created_at":"2026-05-18T01:37:39.169425+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.1011","created_at":"2026-05-18T01:37:39.169425+00:00"},{"alias_kind":"pith_short_12","alias_value":"OI3JTKXSYHKD","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_16","alias_value":"OI3JTKXSYHKDJOBF","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_8","alias_value":"OI3JTKXS","created_at":"2026-05-18T12:26:37.096874+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/OI3JTKXSYHKDJOBFMMOYIIUUSY","json":"https://pith.science/pith/OI3JTKXSYHKDJOBFMMOYIIUUSY.json","graph_json":"https://pith.science/api/pith-number/OI3JTKXSYHKDJOBFMMOYIIUUSY/graph.json","events_json":"https://pith.science/api/pith-number/OI3JTKXSYHKDJOBFMMOYIIUUSY/events.json","paper":"https://pith.science/paper/OI3JTKXS"},"agent_actions":{"view_html":"https://pith.science/pith/OI3JTKXSYHKDJOBFMMOYIIUUSY","download_json":"https://pith.science/pith/OI3JTKXSYHKDJOBFMMOYIIUUSY.json","view_paper":"https://pith.science/paper/OI3JTKXS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1111.1011&json=true","fetch_graph":"https://pith.science/api/pith-number/OI3JTKXSYHKDJOBFMMOYIIUUSY/graph.json","fetch_events":"https://pith.science/api/pith-number/OI3JTKXSYHKDJOBFMMOYIIUUSY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OI3JTKXSYHKDJOBFMMOYIIUUSY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OI3JTKXSYHKDJOBFMMOYIIUUSY/action/storage_attestation","attest_author":"https://pith.science/pith/OI3JTKXSYHKDJOBFMMOYIIUUSY/action/author_attestation","sign_citation":"https://pith.science/pith/OI3JTKXSYHKDJOBFMMOYIIUUSY/action/citation_signature","submit_replication":"https://pith.science/pith/OI3JTKXSYHKDJOBFMMOYIIUUSY/action/replication_record"}},"created_at":"2026-05-18T01:37:39.169425+00:00","updated_at":"2026-05-18T01:37:39.169425+00:00"}