{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:HDFNNDW3ERO4PTAKVAXO3MZEL4","short_pith_number":"pith:HDFNNDW3","schema_version":"1.0","canonical_sha256":"38cad68edb245dc7cc0aa82eedb3245f3dee778a6c8ef29d78cfa895834e5cc5","source":{"kind":"arxiv","id":"1608.05252","version":2},"attestation_state":"computed","paper":{"title":"Slicing Concurrent Constraint Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"cs.LO","authors_text":"Carlos Olarte, Catuscia Palamidessi, Maurizio Gabbrielli, Moreno Falaschi","submitted_at":"2016-08-18T13:36:21Z","abstract_excerpt":"Concurrent Constraint Programming (CCP) is a declarative model for concurrency where agents interact by telling and asking constraints (pieces of information) in a shared store. Some previous works have developed (approximated) declarative debuggers for CCP languages. However, the task of debugging concurrent programs remains difficult. In this paper we define a dynamic slicer for CCP and we show it to be a useful companion tool for the existing debugging techniques. Our technique starts by considering a partial computation (a trace) that shows the presence of bugs. Often, the quantity of info"},"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":"1608.05252","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-08-18T13:36:21Z","cross_cats_sorted":["cs.PL"],"title_canon_sha256":"fb21f3bbe41f005a3c9813bbbcafd1defe5addd833393659ec251797c4f833e1","abstract_canon_sha256":"89b7a5760fb66aadf794d6d1453c854393784501667c62059cc2acea4616f5c0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:01.188625Z","signature_b64":"F6sh/9wx3DZ6r+JKIbrA01yk+qq4BFXC9MzfBe6XFtLmehIBfT2Q7mgT6xlDSvRnhkNTn0SCUBI5MXIVpvYSDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"38cad68edb245dc7cc0aa82eedb3245f3dee778a6c8ef29d78cfa895834e5cc5","last_reissued_at":"2026-05-18T00:51:01.188124Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:01.188124Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Slicing Concurrent Constraint Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"cs.LO","authors_text":"Carlos Olarte, Catuscia Palamidessi, Maurizio Gabbrielli, Moreno Falaschi","submitted_at":"2016-08-18T13:36:21Z","abstract_excerpt":"Concurrent Constraint Programming (CCP) is a declarative model for concurrency where agents interact by telling and asking constraints (pieces of information) in a shared store. Some previous works have developed (approximated) declarative debuggers for CCP languages. However, the task of debugging concurrent programs remains difficult. In this paper we define a dynamic slicer for CCP and we show it to be a useful companion tool for the existing debugging techniques. Our technique starts by considering a partial computation (a trace) that shows the presence of bugs. Often, the quantity of info"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.05252","kind":"arxiv","version":2},"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":"1608.05252","created_at":"2026-05-18T00:51:01.188196+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.05252v2","created_at":"2026-05-18T00:51:01.188196+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.05252","created_at":"2026-05-18T00:51:01.188196+00:00"},{"alias_kind":"pith_short_12","alias_value":"HDFNNDW3ERO4","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_16","alias_value":"HDFNNDW3ERO4PTAK","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_8","alias_value":"HDFNNDW3","created_at":"2026-05-18T12:30:19.053100+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/HDFNNDW3ERO4PTAKVAXO3MZEL4","json":"https://pith.science/pith/HDFNNDW3ERO4PTAKVAXO3MZEL4.json","graph_json":"https://pith.science/api/pith-number/HDFNNDW3ERO4PTAKVAXO3MZEL4/graph.json","events_json":"https://pith.science/api/pith-number/HDFNNDW3ERO4PTAKVAXO3MZEL4/events.json","paper":"https://pith.science/paper/HDFNNDW3"},"agent_actions":{"view_html":"https://pith.science/pith/HDFNNDW3ERO4PTAKVAXO3MZEL4","download_json":"https://pith.science/pith/HDFNNDW3ERO4PTAKVAXO3MZEL4.json","view_paper":"https://pith.science/paper/HDFNNDW3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.05252&json=true","fetch_graph":"https://pith.science/api/pith-number/HDFNNDW3ERO4PTAKVAXO3MZEL4/graph.json","fetch_events":"https://pith.science/api/pith-number/HDFNNDW3ERO4PTAKVAXO3MZEL4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HDFNNDW3ERO4PTAKVAXO3MZEL4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HDFNNDW3ERO4PTAKVAXO3MZEL4/action/storage_attestation","attest_author":"https://pith.science/pith/HDFNNDW3ERO4PTAKVAXO3MZEL4/action/author_attestation","sign_citation":"https://pith.science/pith/HDFNNDW3ERO4PTAKVAXO3MZEL4/action/citation_signature","submit_replication":"https://pith.science/pith/HDFNNDW3ERO4PTAKVAXO3MZEL4/action/replication_record"}},"created_at":"2026-05-18T00:51:01.188196+00:00","updated_at":"2026-05-18T00:51:01.188196+00:00"}