{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:UMYNIU7LRVELH43XGPN7RGRJRP","short_pith_number":"pith:UMYNIU7L","schema_version":"1.0","canonical_sha256":"a330d453eb8d48b3f37733dbf89a298bc1631ed38912d5bb021bcaefe9021f40","source":{"kind":"arxiv","id":"1606.08707","version":2},"attestation_state":"computed","paper":{"title":"On parametrized verification of asynchronous, shared-memory pushdown systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.FL","authors_text":"Anca Muscholl, Igor Walukiewicz, Marie Fortin","submitted_at":"2016-06-28T13:58:20Z","abstract_excerpt":"We consider the model of parametrized asynchronous shared-memory pushdown systems, as introduced in [Hague'11]. In a series of recent papers it has been shown that reachability in this model is PSPACE-complete [Esparza, Ganty, Majumdar'13] and that liveness is decidable in NEXPTIME [Durand-Gasselin, Esparza, Ganty, Majumdar'15]. We show here that the liveness problem is PSPACE-complete. We also introduce the universal reachability problem. We show that it is decidable, and coNEXPTIME-complete. Finally, using these results, we prove that the verifying regular properties of traces of executions,"},"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":"1606.08707","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2016-06-28T13:58:20Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"eb613308faf86deadcaf191a6655f8c3932047b13227a05dacb0bce3a1f9deb6","abstract_canon_sha256":"5dd38568de5825fd884f1351986bd60933db6cacdcacd8a19355a05cf756191a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:58.846542Z","signature_b64":"RWk28KBlNqbKU2O62IN0qTVVHByFaGpThPTQ9GJ74tPwjm2u5ZqJIz1JEYCyPgBxEt1mZEr7YypeGNLJxGyACg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a330d453eb8d48b3f37733dbf89a298bc1631ed38912d5bb021bcaefe9021f40","last_reissued_at":"2026-05-18T01:10:58.846021Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:58.846021Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On parametrized verification of asynchronous, shared-memory pushdown systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.FL","authors_text":"Anca Muscholl, Igor Walukiewicz, Marie Fortin","submitted_at":"2016-06-28T13:58:20Z","abstract_excerpt":"We consider the model of parametrized asynchronous shared-memory pushdown systems, as introduced in [Hague'11]. In a series of recent papers it has been shown that reachability in this model is PSPACE-complete [Esparza, Ganty, Majumdar'13] and that liveness is decidable in NEXPTIME [Durand-Gasselin, Esparza, Ganty, Majumdar'15]. We show here that the liveness problem is PSPACE-complete. We also introduce the universal reachability problem. We show that it is decidable, and coNEXPTIME-complete. Finally, using these results, we prove that the verifying regular properties of traces of executions,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.08707","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":"1606.08707","created_at":"2026-05-18T01:10:58.846093+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.08707v2","created_at":"2026-05-18T01:10:58.846093+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.08707","created_at":"2026-05-18T01:10:58.846093+00:00"},{"alias_kind":"pith_short_12","alias_value":"UMYNIU7LRVEL","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_16","alias_value":"UMYNIU7LRVELH43X","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_8","alias_value":"UMYNIU7L","created_at":"2026-05-18T12:30:46.583412+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/UMYNIU7LRVELH43XGPN7RGRJRP","json":"https://pith.science/pith/UMYNIU7LRVELH43XGPN7RGRJRP.json","graph_json":"https://pith.science/api/pith-number/UMYNIU7LRVELH43XGPN7RGRJRP/graph.json","events_json":"https://pith.science/api/pith-number/UMYNIU7LRVELH43XGPN7RGRJRP/events.json","paper":"https://pith.science/paper/UMYNIU7L"},"agent_actions":{"view_html":"https://pith.science/pith/UMYNIU7LRVELH43XGPN7RGRJRP","download_json":"https://pith.science/pith/UMYNIU7LRVELH43XGPN7RGRJRP.json","view_paper":"https://pith.science/paper/UMYNIU7L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.08707&json=true","fetch_graph":"https://pith.science/api/pith-number/UMYNIU7LRVELH43XGPN7RGRJRP/graph.json","fetch_events":"https://pith.science/api/pith-number/UMYNIU7LRVELH43XGPN7RGRJRP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UMYNIU7LRVELH43XGPN7RGRJRP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UMYNIU7LRVELH43XGPN7RGRJRP/action/storage_attestation","attest_author":"https://pith.science/pith/UMYNIU7LRVELH43XGPN7RGRJRP/action/author_attestation","sign_citation":"https://pith.science/pith/UMYNIU7LRVELH43XGPN7RGRJRP/action/citation_signature","submit_replication":"https://pith.science/pith/UMYNIU7LRVELH43XGPN7RGRJRP/action/replication_record"}},"created_at":"2026-05-18T01:10:58.846093+00:00","updated_at":"2026-05-18T01:10:58.846093+00:00"}