{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004608056,0.0007922729,0.000656686,0.001099,0.0004627538,0.0008999046,0.001336608,0.0007767954,0.002184711],"category_scores_gemma":[0.01089902,0.0008550187,0.001254795,0.0009886808,0.001802593,0.002672653,0.002018751,0.001603354,0.0003602415],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007657033,"about_ca_system_score_gemma":0.001421502,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002726599,"about_ca_topic_score_gemma":0.00356846,"domain_scores_codex":[0.9961146,0.002250539,0.0002073137,0.0004128949,0.0008083218,0.000206284],"domain_scores_gemma":[0.9939432,0.004221958,0.0003597009,0.001087012,0.000310679,0.00007740547],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004593137,0.000119901,0.002548929,0.0005110673,0.0001137812,0.0003859928,0.001028404,0.5219169,0.01898466,0.1827517,0.001386504,0.2697928],"study_design_scores_gemma":[0.00005366267,0.0001523077,0.0002752227,0.00007249025,0.0000481343,0.0001617645,0.00007434269,0.8968845,0.01175712,0.08572771,0.004767566,0.00002518955],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00673517,0.0001417753,0.9920886,0.00005305376,0.00000925038,0.00005066434,0.00001715145,0.0004673077,0.0004370471],"genre_scores_gemma":[0.2181792,0.0003476463,0.7801663,0.00006446375,0.00001877323,0.0001502942,0.0001028067,0.0001516164,0.0008190333],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004608056,"threshold_uncertainty_score":0.02437001,"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."}}