{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:7T7CPV5GVYN3SA2IBY23TFFXK3","short_pith_number":"pith:7T7CPV5G","schema_version":"1.0","canonical_sha256":"fcfe27d7a6ae1bb903480e35b994b756e5bc8a9225915cc65e703317c6fe784b","source":{"kind":"arxiv","id":"1709.09006","version":1},"attestation_state":"computed","paper":{"title":"CARET analysis of multithreaded programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.LO","authors_text":"Huu-Vu Nguyen, Tayssir Touili","submitted_at":"2017-09-20T05:58:15Z","abstract_excerpt":"Dynamic Pushdown Networks (DPNs) are a natural model for multithreaded programs with (recursive) procedure calls and thread creation. On the other hand, CARET is a temporal logic that allows to write linear temporal formulas while taking into account the matching between calls and returns. We consider in this paper the model-checking problem of DPNs against CARET formulas. We show that this problem can be effectively solved by a reduction to the emptiness problem of B\\\"uchi Dynamic Pushdown Systems. We then show that CARET model checking is also decidable for DPNs communicating with locks. Our"},"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":"1709.09006","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-09-20T05:58:15Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"c935e4ea14484c5b92bab47bfbb18f85122f567b15067c7637a5e795e242f949","abstract_canon_sha256":"4489a9c37be70d9147c20e5c6bc3208d472967adeecb21facc0030b146084fca"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:34:21.386254Z","signature_b64":"4Yotk7jBjwhd2jk8jxPQrFmlhoXs5xmPOR52ojsawfqvRUHuvqgM3nnJw87xyNzu3oc74lkCrliDpMtsxQK6CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fcfe27d7a6ae1bb903480e35b994b756e5bc8a9225915cc65e703317c6fe784b","last_reissued_at":"2026-05-18T00:34:21.385868Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:34:21.385868Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"CARET analysis of multithreaded programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.LO","authors_text":"Huu-Vu Nguyen, Tayssir Touili","submitted_at":"2017-09-20T05:58:15Z","abstract_excerpt":"Dynamic Pushdown Networks (DPNs) are a natural model for multithreaded programs with (recursive) procedure calls and thread creation. On the other hand, CARET is a temporal logic that allows to write linear temporal formulas while taking into account the matching between calls and returns. We consider in this paper the model-checking problem of DPNs against CARET formulas. We show that this problem can be effectively solved by a reduction to the emptiness problem of B\\\"uchi Dynamic Pushdown Systems. We then show that CARET model checking is also decidable for DPNs communicating with locks. Our"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.09006","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":"1709.09006","created_at":"2026-05-18T00:34:21.385925+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.09006v1","created_at":"2026-05-18T00:34:21.385925+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.09006","created_at":"2026-05-18T00:34:21.385925+00:00"},{"alias_kind":"pith_short_12","alias_value":"7T7CPV5GVYN3","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_16","alias_value":"7T7CPV5GVYN3SA2I","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_8","alias_value":"7T7CPV5G","created_at":"2026-05-18T12:31:05.417338+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/7T7CPV5GVYN3SA2IBY23TFFXK3","json":"https://pith.science/pith/7T7CPV5GVYN3SA2IBY23TFFXK3.json","graph_json":"https://pith.science/api/pith-number/7T7CPV5GVYN3SA2IBY23TFFXK3/graph.json","events_json":"https://pith.science/api/pith-number/7T7CPV5GVYN3SA2IBY23TFFXK3/events.json","paper":"https://pith.science/paper/7T7CPV5G"},"agent_actions":{"view_html":"https://pith.science/pith/7T7CPV5GVYN3SA2IBY23TFFXK3","download_json":"https://pith.science/pith/7T7CPV5GVYN3SA2IBY23TFFXK3.json","view_paper":"https://pith.science/paper/7T7CPV5G","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.09006&json=true","fetch_graph":"https://pith.science/api/pith-number/7T7CPV5GVYN3SA2IBY23TFFXK3/graph.json","fetch_events":"https://pith.science/api/pith-number/7T7CPV5GVYN3SA2IBY23TFFXK3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7T7CPV5GVYN3SA2IBY23TFFXK3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7T7CPV5GVYN3SA2IBY23TFFXK3/action/storage_attestation","attest_author":"https://pith.science/pith/7T7CPV5GVYN3SA2IBY23TFFXK3/action/author_attestation","sign_citation":"https://pith.science/pith/7T7CPV5GVYN3SA2IBY23TFFXK3/action/citation_signature","submit_replication":"https://pith.science/pith/7T7CPV5GVYN3SA2IBY23TFFXK3/action/replication_record"}},"created_at":"2026-05-18T00:34:21.385925+00:00","updated_at":"2026-05-18T00:34:21.385925+00:00"}