{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:IXNCR24VICQZNFBUPEBBXK7ANS","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"21191cdd6118822a0f5d7da3d99ab6d7a54a42bcb4eac5eba4bea86bf3f5a629","cross_cats_sorted":["cs.SE"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2024-11-20T08:35:29Z","title_canon_sha256":"bf1ea798c9e2e1526fc66dd6e287762e83d413399ec907125280e5e533a8e25a"},"schema_version":"1.0","source":{"id":"2411.13125","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.13125","created_at":"2026-07-05T09:38:05Z"},{"alias_kind":"arxiv_version","alias_value":"2411.13125v1","created_at":"2026-07-05T09:38:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.13125","created_at":"2026-07-05T09:38:05Z"},{"alias_kind":"pith_short_12","alias_value":"IXNCR24VICQZ","created_at":"2026-07-05T09:38:05Z"},{"alias_kind":"pith_short_16","alias_value":"IXNCR24VICQZNFBU","created_at":"2026-07-05T09:38:05Z"},{"alias_kind":"pith_short_8","alias_value":"IXNCR24V","created_at":"2026-07-05T09:38:05Z"}],"graph_snapshots":[{"event_id":"sha256:aeb04c0a00b3ab65dbb302cb870f36a54fd5fec157b19ec1117a9caef7ad81aa","target":"graph","created_at":"2026-07-05T09:38:05Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2411.13125/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We present an expressive logic over trace formulas, based on binary state predicates, chop, and least fixed-points, for precise specification of programs with recursive procedures. Both, programs and trace formulas, are equipped with a direct-style, fully compositional, denotational semantics that on programs coincides with the standard SOS of recursive programs. We design a compositional proof calculus for proving finite-trace program properties, and prove soundness as well as (relative) completeness. We show that each program can be mapped to a semantics-preserving trace formula and, vice ve","authors_text":"Dilian Gurov, Reiner H\\\"ahnle","cross_cats":["cs.SE"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2024-11-20T08:35:29Z","title":"An Expressive Trace Logic for Recursive Programs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.13125","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:6908460066d74a2098549be81c59605b75e50cad959cbc30ddad91f5f1024cdc","target":"record","created_at":"2026-07-05T09:38:05Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"21191cdd6118822a0f5d7da3d99ab6d7a54a42bcb4eac5eba4bea86bf3f5a629","cross_cats_sorted":["cs.SE"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2024-11-20T08:35:29Z","title_canon_sha256":"bf1ea798c9e2e1526fc66dd6e287762e83d413399ec907125280e5e533a8e25a"},"schema_version":"1.0","source":{"id":"2411.13125","kind":"arxiv","version":1}},"canonical_sha256":"45da28eb9540a196943479021babe06caa3b7003523e55d5351f881f58ed507c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"45da28eb9540a196943479021babe06caa3b7003523e55d5351f881f58ed507c","first_computed_at":"2026-07-05T09:38:05.462240Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:38:05.462240Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6K/LG+pGYHJsB/NsRzugGla/1IGExKJvY6WfF4NxJPQ89QzAcHxc6QlM3CLOiPz7NlHyd3T3WNX/8WwcultLBg==","signature_status":"signed_v1","signed_at":"2026-07-05T09:38:05.462719Z","signed_message":"canonical_sha256_bytes"},"source_id":"2411.13125","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6908460066d74a2098549be81c59605b75e50cad959cbc30ddad91f5f1024cdc","sha256:aeb04c0a00b3ab65dbb302cb870f36a54fd5fec157b19ec1117a9caef7ad81aa"],"state_sha256":"f6e494a3d86f016968c0a241795977047276b7f07f197a8010763542baf2cfc1"}