{"id":"W2026007917","doi":"10.1145/2228360.2228530","title":"Path directed abstraction and refinement in SAT-based design debugging","year":2012,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Debugging; Computer science; Abstraction; Window (computing); Path (computing); Overhead (engineering); Spurious relationship; Algorithmic program debugging; Task (project management); Nexus (standard); Domain (mathematical analysis); Parallel computing; Programming language; Algorithm; Embedded system; Operating system","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009146558,0.00005757289,0.00005521539,0.00008293603,0.00003741116,0.0000358688,0.0001086589,0.00003015146,0.00001247539],"category_scores_gemma":[0.00007145089,0.00005097612,0.000008112343,0.0001848568,0.00001012601,0.0004908068,0.00002826577,0.00005872052,0.00001442033],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005457065,"about_ca_system_score_gemma":0.00001790326,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004939727,"about_ca_topic_score_gemma":0.000003624997,"domain_scores_codex":[0.999359,0.0001087964,0.0001333502,0.0001273248,0.0001062351,0.0001653099],"domain_scores_gemma":[0.9996176,0.00008425368,0.00004634796,0.0001874642,0.00001796967,0.00004639777],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004731023,0.0004377019,0.03801567,0.0000737729,0.00001187913,0.000003757161,0.001961305,0.001185469,0.03829148,0.05660245,0.0007979582,0.8625712],"study_design_scores_gemma":[0.0002652938,0.00003973479,0.397947,0.00001959425,0.000002520138,0.000003924176,0.00001640932,0.5648457,0.03540065,0.0003340492,0.0009861963,0.0001390012],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02895268,0.00006093663,0.9692048,0.0001245918,0.0001695683,0.0001066419,9.832154e-8,0.0001960962,0.001184532],"genre_scores_gemma":[0.4602308,0.00000220717,0.5396594,0.00006848795,0.000009247847,0.00001063144,4.606672e-7,0.000001802855,0.00001689796],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8624322,"threshold_uncertainty_score":0.2078746,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0535848862172849,"score_gpt":0.2957310289933185,"score_spread":0.2421461427760336,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}