{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:5EACDXR5RT65QXLJM7ADNH3N6K","short_pith_number":"pith:5EACDXR5","schema_version":"1.0","canonical_sha256":"e90021de3d8cfdd85d6967c0369f6df28fc5e7eaee544dd3caaa9e8c86522f6a","source":{"kind":"arxiv","id":"2404.16075","version":2},"attestation_state":"computed","paper":{"title":"Validating Traces of Distributed Programs Against TLA+ Specifications","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SE"],"primary_cat":"cs.PL","authors_text":"Benjamin Loillier, Horatiu Cirstea, Markus A. Kuppe, Stephan Merz","submitted_at":"2024-04-24T01:33:07Z","abstract_excerpt":"TLA+ is a formal language for specifying systems, including distributed algorithms, that is supported by powerful verification tools. In this work we present a framework for relating traces of distributed programs to high-level specifications written in TLA+. The problem is reduced to a constrained model checking problem, realized using the TLC model checker. Our framework consists of an API for instrumenting Java programs in order to record traces of executions, of a collection of TLA+ operators that are used for relating those traces to specifications, and of scripts for running the model ch"},"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":"2404.16075","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2024-04-24T01:33:07Z","cross_cats_sorted":["cs.SE"],"title_canon_sha256":"cbfc691e991c9d649bdf75c892cb3805e588f5d2c1bc1a72d28e49d28eb655aa","abstract_canon_sha256":"ca47bd87de1046564aaad36f2996ab3e332bb173e76dc2f50141302240884e56"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:08:12.181014Z","signature_b64":"j38Ld6R1ye0ITRPkrmM/t87kkxgYeXmNv3hc7gcF88daa237ySQZrnxixgscvFOFRzFgLZqfySyF+dt6pu10CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e90021de3d8cfdd85d6967c0369f6df28fc5e7eaee544dd3caaa9e8c86522f6a","last_reissued_at":"2026-07-05T09:08:12.180545Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:08:12.180545Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Validating Traces of Distributed Programs Against TLA+ Specifications","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SE"],"primary_cat":"cs.PL","authors_text":"Benjamin Loillier, Horatiu Cirstea, Markus A. Kuppe, Stephan Merz","submitted_at":"2024-04-24T01:33:07Z","abstract_excerpt":"TLA+ is a formal language for specifying systems, including distributed algorithms, that is supported by powerful verification tools. In this work we present a framework for relating traces of distributed programs to high-level specifications written in TLA+. The problem is reduced to a constrained model checking problem, realized using the TLC model checker. Our framework consists of an API for instrumenting Java programs in order to record traces of executions, of a collection of TLA+ operators that are used for relating those traces to specifications, and of scripts for running the model ch"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.16075","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2404.16075/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2404.16075","created_at":"2026-07-05T09:08:12.180599+00:00"},{"alias_kind":"arxiv_version","alias_value":"2404.16075v2","created_at":"2026-07-05T09:08:12.180599+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.16075","created_at":"2026-07-05T09:08:12.180599+00:00"},{"alias_kind":"pith_short_12","alias_value":"5EACDXR5RT65","created_at":"2026-07-05T09:08:12.180599+00:00"},{"alias_kind":"pith_short_16","alias_value":"5EACDXR5RT65QXLJ","created_at":"2026-07-05T09:08:12.180599+00:00"},{"alias_kind":"pith_short_8","alias_value":"5EACDXR5","created_at":"2026-07-05T09:08:12.180599+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.05792","citing_title":"Can LLMs Write Correct TLA+ Specifications? Evaluating Natural-Language-to-TLA+ Generation","ref_index":8,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5EACDXR5RT65QXLJM7ADNH3N6K","json":"https://pith.science/pith/5EACDXR5RT65QXLJM7ADNH3N6K.json","graph_json":"https://pith.science/api/pith-number/5EACDXR5RT65QXLJM7ADNH3N6K/graph.json","events_json":"https://pith.science/api/pith-number/5EACDXR5RT65QXLJM7ADNH3N6K/events.json","paper":"https://pith.science/paper/5EACDXR5"},"agent_actions":{"view_html":"https://pith.science/pith/5EACDXR5RT65QXLJM7ADNH3N6K","download_json":"https://pith.science/pith/5EACDXR5RT65QXLJM7ADNH3N6K.json","view_paper":"https://pith.science/paper/5EACDXR5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2404.16075&json=true","fetch_graph":"https://pith.science/api/pith-number/5EACDXR5RT65QXLJM7ADNH3N6K/graph.json","fetch_events":"https://pith.science/api/pith-number/5EACDXR5RT65QXLJM7ADNH3N6K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5EACDXR5RT65QXLJM7ADNH3N6K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5EACDXR5RT65QXLJM7ADNH3N6K/action/storage_attestation","attest_author":"https://pith.science/pith/5EACDXR5RT65QXLJM7ADNH3N6K/action/author_attestation","sign_citation":"https://pith.science/pith/5EACDXR5RT65QXLJM7ADNH3N6K/action/citation_signature","submit_replication":"https://pith.science/pith/5EACDXR5RT65QXLJM7ADNH3N6K/action/replication_record"}},"created_at":"2026-07-05T09:08:12.180599+00:00","updated_at":"2026-07-05T09:08:12.180599+00:00"}