{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:UEY3WE3OZL6VFT3Q3MI6RFKMKO","short_pith_number":"pith:UEY3WE3O","schema_version":"1.0","canonical_sha256":"a131bb136ecafd52cf70db11e8954c5397c6271a942fc60d1d3084c7cd552845","source":{"kind":"arxiv","id":"1508.03901","version":1},"attestation_state":"computed","paper":{"title":"Unlocking Blocked Communicating Processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.PL","authors_text":"Adrian Francalanza (CS, Ant\\'onio Ravara (NOVA LINCS, DI, DI-FCT, ICT, Marco Giunti (RELEASE, Universidade da Beira Interior & NOVA LINCS, Universidade Nova de Lisboa), University of Malta)","submitted_at":"2015-08-17T01:51:02Z","abstract_excerpt":"We study the problem of disentangling locked processes via code refactoring. We identify and characterise a class of processes that is not lock-free; then we formalise an algorithm that statically detects potential locks and propose refactoring procedures that disentangle detected locks. Our development is cast within a simple setting of a finite linear CCS variant \\^a although it suffices to illustrate the main concepts, we also discuss how our work extends to other language extensions."},"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":"1508.03901","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2015-08-17T01:51:02Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"3cdbf1d6d0151df2219b78ea14583a55f1387d61aea85b79932984a6e40c0e21","abstract_canon_sha256":"db55fbe6cf9e572f42429d1c6f187e413e02010e94c0f6b0cd777197adbdc290"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:46.057824Z","signature_b64":"rjrlNs6myj1ZlrJMKGpZYO4kDherO2H1evs+tN2QA1sPBrh8C69uhIheNyaU12G6i064LOs3zyK/tdHk/4KGBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a131bb136ecafd52cf70db11e8954c5397c6271a942fc60d1d3084c7cd552845","last_reissued_at":"2026-05-18T01:09:46.057334Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:46.057334Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Unlocking Blocked Communicating Processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.PL","authors_text":"Adrian Francalanza (CS, Ant\\'onio Ravara (NOVA LINCS, DI, DI-FCT, ICT, Marco Giunti (RELEASE, Universidade da Beira Interior & NOVA LINCS, Universidade Nova de Lisboa), University of Malta)","submitted_at":"2015-08-17T01:51:02Z","abstract_excerpt":"We study the problem of disentangling locked processes via code refactoring. We identify and characterise a class of processes that is not lock-free; then we formalise an algorithm that statically detects potential locks and propose refactoring procedures that disentangle detected locks. Our development is cast within a simple setting of a finite linear CCS variant \\^a although it suffices to illustrate the main concepts, we also discuss how our work extends to other language extensions."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.03901","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":"1508.03901","created_at":"2026-05-18T01:09:46.057408+00:00"},{"alias_kind":"arxiv_version","alias_value":"1508.03901v1","created_at":"2026-05-18T01:09:46.057408+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.03901","created_at":"2026-05-18T01:09:46.057408+00:00"},{"alias_kind":"pith_short_12","alias_value":"UEY3WE3OZL6V","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_16","alias_value":"UEY3WE3OZL6VFT3Q","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_8","alias_value":"UEY3WE3O","created_at":"2026-05-18T12:29:44.643036+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/UEY3WE3OZL6VFT3Q3MI6RFKMKO","json":"https://pith.science/pith/UEY3WE3OZL6VFT3Q3MI6RFKMKO.json","graph_json":"https://pith.science/api/pith-number/UEY3WE3OZL6VFT3Q3MI6RFKMKO/graph.json","events_json":"https://pith.science/api/pith-number/UEY3WE3OZL6VFT3Q3MI6RFKMKO/events.json","paper":"https://pith.science/paper/UEY3WE3O"},"agent_actions":{"view_html":"https://pith.science/pith/UEY3WE3OZL6VFT3Q3MI6RFKMKO","download_json":"https://pith.science/pith/UEY3WE3OZL6VFT3Q3MI6RFKMKO.json","view_paper":"https://pith.science/paper/UEY3WE3O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1508.03901&json=true","fetch_graph":"https://pith.science/api/pith-number/UEY3WE3OZL6VFT3Q3MI6RFKMKO/graph.json","fetch_events":"https://pith.science/api/pith-number/UEY3WE3OZL6VFT3Q3MI6RFKMKO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UEY3WE3OZL6VFT3Q3MI6RFKMKO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UEY3WE3OZL6VFT3Q3MI6RFKMKO/action/storage_attestation","attest_author":"https://pith.science/pith/UEY3WE3OZL6VFT3Q3MI6RFKMKO/action/author_attestation","sign_citation":"https://pith.science/pith/UEY3WE3OZL6VFT3Q3MI6RFKMKO/action/citation_signature","submit_replication":"https://pith.science/pith/UEY3WE3OZL6VFT3Q3MI6RFKMKO/action/replication_record"}},"created_at":"2026-05-18T01:09:46.057408+00:00","updated_at":"2026-05-18T01:09:46.057408+00:00"}