{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:ZYPVCAA3ZBGPJ3HW3XBH37MFQ7","short_pith_number":"pith:ZYPVCAA3","schema_version":"1.0","canonical_sha256":"ce1f51001bc84cf4ecf6ddc27dfd8587d8c108b2f1d03d4aeef65a8bb877e1bf","source":{"kind":"arxiv","id":"1207.5384","version":1},"attestation_state":"computed","paper":{"title":"Lattice based Least Fixed Point Logic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Flemming Nielson, Hanne Riis Nielson, Piotr Filipiuk","submitted_at":"2012-07-23T13:15:24Z","abstract_excerpt":"As software systems become more complex, there is an increasing need for new static analyses. Thanks to the declarative style, logic programming is an attractive formalism for specifying them. However, prior work on using logic programming for static analysis focused on analyses defined over some powerset domain, which is quite limiting. In this paper we present a logic that lifts this restriction, called Lattice based Least Fixed Point Logic (LLFP), that allows interpretations over any complete lattice satisfying Ascending Chain Condition. The main theoretical contribution is a Moore Family r"},"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":"1207.5384","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-07-23T13:15:24Z","cross_cats_sorted":[],"title_canon_sha256":"55ac1f27059414fbf67811bc95cbdace114bf50ce26cbbbe0cb04bc5e6225ef6","abstract_canon_sha256":"1e91837d67c007d3600bb9ae97e909ee71640ed50751f783c216dd9d32a5958a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:50:23.698211Z","signature_b64":"JgQauRY78NbAXVrds87cKuf4jFD/3zUz7SnciLIrE1UPg31Rt/01e4b33lTDLPtdZqATsRDCepo2XRvgADV7CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ce1f51001bc84cf4ecf6ddc27dfd8587d8c108b2f1d03d4aeef65a8bb877e1bf","last_reissued_at":"2026-05-18T03:50:23.697500Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:50:23.697500Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lattice based Least Fixed Point Logic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Flemming Nielson, Hanne Riis Nielson, Piotr Filipiuk","submitted_at":"2012-07-23T13:15:24Z","abstract_excerpt":"As software systems become more complex, there is an increasing need for new static analyses. Thanks to the declarative style, logic programming is an attractive formalism for specifying them. However, prior work on using logic programming for static analysis focused on analyses defined over some powerset domain, which is quite limiting. In this paper we present a logic that lifts this restriction, called Lattice based Least Fixed Point Logic (LLFP), that allows interpretations over any complete lattice satisfying Ascending Chain Condition. The main theoretical contribution is a Moore Family r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.5384","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":"1207.5384","created_at":"2026-05-18T03:50:23.697607+00:00"},{"alias_kind":"arxiv_version","alias_value":"1207.5384v1","created_at":"2026-05-18T03:50:23.697607+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.5384","created_at":"2026-05-18T03:50:23.697607+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZYPVCAA3ZBGP","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZYPVCAA3ZBGPJ3HW","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZYPVCAA3","created_at":"2026-05-18T12:27:30.460161+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/ZYPVCAA3ZBGPJ3HW3XBH37MFQ7","json":"https://pith.science/pith/ZYPVCAA3ZBGPJ3HW3XBH37MFQ7.json","graph_json":"https://pith.science/api/pith-number/ZYPVCAA3ZBGPJ3HW3XBH37MFQ7/graph.json","events_json":"https://pith.science/api/pith-number/ZYPVCAA3ZBGPJ3HW3XBH37MFQ7/events.json","paper":"https://pith.science/paper/ZYPVCAA3"},"agent_actions":{"view_html":"https://pith.science/pith/ZYPVCAA3ZBGPJ3HW3XBH37MFQ7","download_json":"https://pith.science/pith/ZYPVCAA3ZBGPJ3HW3XBH37MFQ7.json","view_paper":"https://pith.science/paper/ZYPVCAA3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1207.5384&json=true","fetch_graph":"https://pith.science/api/pith-number/ZYPVCAA3ZBGPJ3HW3XBH37MFQ7/graph.json","fetch_events":"https://pith.science/api/pith-number/ZYPVCAA3ZBGPJ3HW3XBH37MFQ7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZYPVCAA3ZBGPJ3HW3XBH37MFQ7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZYPVCAA3ZBGPJ3HW3XBH37MFQ7/action/storage_attestation","attest_author":"https://pith.science/pith/ZYPVCAA3ZBGPJ3HW3XBH37MFQ7/action/author_attestation","sign_citation":"https://pith.science/pith/ZYPVCAA3ZBGPJ3HW3XBH37MFQ7/action/citation_signature","submit_replication":"https://pith.science/pith/ZYPVCAA3ZBGPJ3HW3XBH37MFQ7/action/replication_record"}},"created_at":"2026-05-18T03:50:23.697607+00:00","updated_at":"2026-05-18T03:50:23.697607+00:00"}