{"paper":{"title":"Model and Program Repair via SAT Solving","license":"","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Jad Saklawi, Paul C. Attie","submitted_at":"2007-10-17T16:56:56Z","abstract_excerpt":"We consider the following \\emph{model repair problem}: given a finite Kripke structure $M$ and a specification formula $\\eta$ in some modal or temporal logic, determine if $M$ contains a substructure $M'$ (with the same initial state) that satisfies $\\eta$. Thus, $M$ can be ``repaired'' to satisfy the specification $\\eta$ by deleting some transitions.\n  We map an instance $(M, \\eta)$ of model repair to a boolean formula $\\repfor(M,\\eta)$ such that $(M, \\eta)$ has a solution iff $\\repfor(M,\\eta)$ is satisfiable. Furthermore, a satisfying assignment determines which transitions must be removed f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0710.3332","kind":"arxiv","version":4},"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/0710.3332/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"}