{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:XRRBPOIZP7UT4QPSYJC7RYJZPK","short_pith_number":"pith:XRRBPOIZ","schema_version":"1.0","canonical_sha256":"bc6217b9197fe93e41f2c245f8e1397a9ba9cc717917c318450a3e780dc46c33","source":{"kind":"arxiv","id":"1807.09047","version":1},"attestation_state":"computed","paper":{"title":"Bounded Synthesis of Reactive Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.FL","authors_text":"Bernd Finkbeiner, Carsten Gerstacker, Felix Klein","submitted_at":"2018-07-24T11:36:31Z","abstract_excerpt":"Most algorithms for the synthesis of reactive systems focus on the construction of finite-state machines rather than actual programs. This often leads to badly structured, unreadable code. In this paper, we present a bounded synthesis approach that automatically constructs, from a given specification in linear-time temporal logic (LTL), a program in Madhusudan's simple imperative language for reactive programs. We develop and compare two principal approaches for the reduction of the synthesis problem to a Boolean constraint satisfaction problem. The first reduction is based on a generalization"},"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":"1807.09047","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2018-07-24T11:36:31Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"72dcfc665aa4f3d6f8e23e36e43d1d9575a5b4bafc372b6c61f46a31c476150e","abstract_canon_sha256":"a6488c1cd0a227ef5b7945bc8c8b52854da9433cef67c7825adf330294450693"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:56.941889Z","signature_b64":"H6YFgA4ORBTDkon/bNmR/iPZW5KDEmxZ2ATx+1K4K7QshkxTz45+BSqDh0iMBssvm3yKe4yWcx9HnHoMML9JCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bc6217b9197fe93e41f2c245f8e1397a9ba9cc717917c318450a3e780dc46c33","last_reissued_at":"2026-05-18T00:09:56.941397Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:56.941397Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bounded Synthesis of Reactive Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.FL","authors_text":"Bernd Finkbeiner, Carsten Gerstacker, Felix Klein","submitted_at":"2018-07-24T11:36:31Z","abstract_excerpt":"Most algorithms for the synthesis of reactive systems focus on the construction of finite-state machines rather than actual programs. This often leads to badly structured, unreadable code. In this paper, we present a bounded synthesis approach that automatically constructs, from a given specification in linear-time temporal logic (LTL), a program in Madhusudan's simple imperative language for reactive programs. We develop and compare two principal approaches for the reduction of the synthesis problem to a Boolean constraint satisfaction problem. The first reduction is based on a generalization"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.09047","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":"1807.09047","created_at":"2026-05-18T00:09:56.941477+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.09047v1","created_at":"2026-05-18T00:09:56.941477+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.09047","created_at":"2026-05-18T00:09:56.941477+00:00"},{"alias_kind":"pith_short_12","alias_value":"XRRBPOIZP7UT","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_16","alias_value":"XRRBPOIZP7UT4QPS","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_8","alias_value":"XRRBPOIZ","created_at":"2026-05-18T12:33:01.666342+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/XRRBPOIZP7UT4QPSYJC7RYJZPK","json":"https://pith.science/pith/XRRBPOIZP7UT4QPSYJC7RYJZPK.json","graph_json":"https://pith.science/api/pith-number/XRRBPOIZP7UT4QPSYJC7RYJZPK/graph.json","events_json":"https://pith.science/api/pith-number/XRRBPOIZP7UT4QPSYJC7RYJZPK/events.json","paper":"https://pith.science/paper/XRRBPOIZ"},"agent_actions":{"view_html":"https://pith.science/pith/XRRBPOIZP7UT4QPSYJC7RYJZPK","download_json":"https://pith.science/pith/XRRBPOIZP7UT4QPSYJC7RYJZPK.json","view_paper":"https://pith.science/paper/XRRBPOIZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.09047&json=true","fetch_graph":"https://pith.science/api/pith-number/XRRBPOIZP7UT4QPSYJC7RYJZPK/graph.json","fetch_events":"https://pith.science/api/pith-number/XRRBPOIZP7UT4QPSYJC7RYJZPK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XRRBPOIZP7UT4QPSYJC7RYJZPK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XRRBPOIZP7UT4QPSYJC7RYJZPK/action/storage_attestation","attest_author":"https://pith.science/pith/XRRBPOIZP7UT4QPSYJC7RYJZPK/action/author_attestation","sign_citation":"https://pith.science/pith/XRRBPOIZP7UT4QPSYJC7RYJZPK/action/citation_signature","submit_replication":"https://pith.science/pith/XRRBPOIZP7UT4QPSYJC7RYJZPK/action/replication_record"}},"created_at":"2026-05-18T00:09:56.941477+00:00","updated_at":"2026-05-18T00:09:56.941477+00:00"}