{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:XQIBPMHPI36J2CTPR2RG2RFRJG","short_pith_number":"pith:XQIBPMHP","schema_version":"1.0","canonical_sha256":"bc1017b0ef46fc9d0a6f8ea26d44b149bf9f949c6f044cd3e9e63d978084cb85","source":{"kind":"arxiv","id":"1604.06747","version":1},"attestation_state":"computed","paper":{"title":"Generating Concurrency Checks Automatically","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.LO","authors_text":"Jonathan Hoyland, Matthew Hague","submitted_at":"2016-04-22T16:52:58Z","abstract_excerpt":"This article introduces ATAB, a tool that automatically generates pairwise reachability checks for action trees. Action trees can be used to study the behaviour of real-world concurrent programs. ATAB encodes pairwise reachability checks into alternating tree automata that determine whether an action tree has a schedule where any pair of given points in the program are simultaneously reachable. Because the pairwise reachability problem is undecidable in general ATAB operates under a restricted form of lock-based concurrency. ATAB produces alternating tree automata that are more compact and mor"},"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":"1604.06747","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-04-22T16:52:58Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"134ccf5de9cb183f457eb55769cee57b0d05ced0c9de533e308495560c6c7a71","abstract_canon_sha256":"0ed7f7c5b2513d318545fcb34ca4481b5e1b3f80daca1aefb14c030515a9c881"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:16:28.232516Z","signature_b64":"vv/wm9xfzMgknR8VAfvFPsV2d6mTaIbfXSWSf3zV+cZfhqhlJzUdMRv378+WN4SYYQaxuU/mROtrPJoG6Iv0Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bc1017b0ef46fc9d0a6f8ea26d44b149bf9f949c6f044cd3e9e63d978084cb85","last_reissued_at":"2026-05-18T01:16:28.232049Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:16:28.232049Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generating Concurrency Checks Automatically","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.LO","authors_text":"Jonathan Hoyland, Matthew Hague","submitted_at":"2016-04-22T16:52:58Z","abstract_excerpt":"This article introduces ATAB, a tool that automatically generates pairwise reachability checks for action trees. Action trees can be used to study the behaviour of real-world concurrent programs. ATAB encodes pairwise reachability checks into alternating tree automata that determine whether an action tree has a schedule where any pair of given points in the program are simultaneously reachable. Because the pairwise reachability problem is undecidable in general ATAB operates under a restricted form of lock-based concurrency. ATAB produces alternating tree automata that are more compact and mor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.06747","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":"1604.06747","created_at":"2026-05-18T01:16:28.232115+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.06747v1","created_at":"2026-05-18T01:16:28.232115+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.06747","created_at":"2026-05-18T01:16:28.232115+00:00"},{"alias_kind":"pith_short_12","alias_value":"XQIBPMHPI36J","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_16","alias_value":"XQIBPMHPI36J2CTP","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_8","alias_value":"XQIBPMHP","created_at":"2026-05-18T12:30:51.357362+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/XQIBPMHPI36J2CTPR2RG2RFRJG","json":"https://pith.science/pith/XQIBPMHPI36J2CTPR2RG2RFRJG.json","graph_json":"https://pith.science/api/pith-number/XQIBPMHPI36J2CTPR2RG2RFRJG/graph.json","events_json":"https://pith.science/api/pith-number/XQIBPMHPI36J2CTPR2RG2RFRJG/events.json","paper":"https://pith.science/paper/XQIBPMHP"},"agent_actions":{"view_html":"https://pith.science/pith/XQIBPMHPI36J2CTPR2RG2RFRJG","download_json":"https://pith.science/pith/XQIBPMHPI36J2CTPR2RG2RFRJG.json","view_paper":"https://pith.science/paper/XQIBPMHP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.06747&json=true","fetch_graph":"https://pith.science/api/pith-number/XQIBPMHPI36J2CTPR2RG2RFRJG/graph.json","fetch_events":"https://pith.science/api/pith-number/XQIBPMHPI36J2CTPR2RG2RFRJG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XQIBPMHPI36J2CTPR2RG2RFRJG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XQIBPMHPI36J2CTPR2RG2RFRJG/action/storage_attestation","attest_author":"https://pith.science/pith/XQIBPMHPI36J2CTPR2RG2RFRJG/action/author_attestation","sign_citation":"https://pith.science/pith/XQIBPMHPI36J2CTPR2RG2RFRJG/action/citation_signature","submit_replication":"https://pith.science/pith/XQIBPMHPI36J2CTPR2RG2RFRJG/action/replication_record"}},"created_at":"2026-05-18T01:16:28.232115+00:00","updated_at":"2026-05-18T01:16:28.232115+00:00"}