Stem counterexampl$ (all stems)

68 papers:

PLDI-2015-GonnordMR #ranking #synthesis #using

Synthesis of ranking functions using extremal counterexamples (LG, DM, GR), pp. 608–618.

PLDI-2015-IsradisaikulM #parsing

Finding counterexamples from parsing conflicts (CI, ACM), pp. 555–564.

PLDI-2015-NguyenH #higher-order #source code

Relatively complete counterexamples for higher-order programs (PCN, DVH), pp. 446–456.

FM-2015-QuatmannJDWAKB

Counterexamples for Expected Rewards (TQ, NJ, CD, RW, EÁ, JPK, BB), pp. 435–452.

CAV-2015-BrazdilCCFK #learning #markov #process

Counterexample Explanation by Learning Small Strategies in Markov Decision Processes (TB, KC, MC, AF, JK), pp. 158–177.

CAV-2015-ChenHWZ #generative #invariant #polynomial

Counterexample-Guided Polynomial Loop Invariant Generation by Lagrange Interpolation (YFC, CDH, BYW, LZ), pp. 658–674.

CAV-2015-ReynoldsDKTB #quantifier #smt #synthesis

Counterexample-Guided Quantifier Instantiation for Synthesis in SMT (AR, MD, VK, CT, CWB), pp. 198–216.

ICST-2015-CastillosWW #approach

Show Me New Counterexamples: A Path-Based Approach (KCC, HW, VW), pp. 1–10.

SFM-2014-AbrahamBDJKW #bibliography #generative #markov #modelling

Counterexample Generation for Discrete-Time Markov Models: An Introductory Survey (EÁ, BB, CD, NJ, JPK, RW), pp. 65–121.

FSE-2014-CordyHLSDL #abstraction #behaviour #modelling #product line #refinement

Counterexample guided abstraction refinement of product-line behavioural models (MC, PH, AL, PYS, BD, ML), pp. 190–201.

CAV-2014-BirgmeierBW #abstraction #induction

Counterexample to Induction-Guided Abstraction-Refinement (CTIGAR) (JB, ARB, GW), pp. 831–848.

DAC-2013-WuWLH #algorithm #generative #model checking #satisfiability

A counterexample-guided interpolant generation algorithm for SAT-based model checking (CYW, CAW, CYL, CY(H), p. 6.

ESOP-2013-SeghirK

Counterexample-Guided Precondition Inference (MNS, DK), pp. 451–471.

ICSE-2013-TianD #detection #model checking

Detecting spurious counterexamples efficiently in abstract model checking (CT, ZD), pp. 202–211.

SPLC-2013-FilhoABN #case study #generative #modelling #product line

Generating counterexamples of model-based software product lines: an exploratory study (JBFF, OB, MA, BB, JLN), pp. 72–81.

CAV-2013-KroeningLW #approximate #c #detection #performance #source code

Under-Approximating Loops in C Programs for Fast Counterexample Detection (DK, ML, GW), pp. 381–396.

DATE-2012-MitraBD #formal method #mining #ranking

Formal methods for ranking counterexamples through assumption mining (SM, AB, PD), pp. 911–916.

ITiCSE-2012-MI #algorithm

A method to construct counterexamples for greedy algorithms (JM, SI), pp. 238–243.

FM-2012-AartsHKOV #abstraction #automaton #learning #refinement

Automata Learning through Counterexample Guided Abstraction Refinement (FA, FH, HK, PO, FWV), pp. 10–27.

CAV-2012-FredriksonJJRPSY #abstraction #performance #policy #refinement #runtime #using

Efficient Runtime Policy Enforcement Using Counterexample-Guided Abstraction Refinement (MF, RJ, SJ, TWR, PAP, HS, VY), pp. 548–563.

SAT-2012-JanotaKMC #refinement

Solving QBF with Counterexample Guided Refinement (MJ, WK, JMS, EMC), pp. 114–128.

DATE-2011-BradyHS

Counterexample-guided SMT-driven optimal buffer sizing (BAB, DEH, SAS), pp. 329–334.

SAC-2011-CollavizzaVRDG #constraints #generative

A dynamic constraint-based BMC strategy for generating counterexamples (HC, NLV, MR, SD, TG), pp. 1633–1638.

ASE-2010-NgocO #fault #using

Checking roundoff errors using counterexample-guided narrowing (DTBN, MO), pp. 301–304.

SAS-2010-MalkisPR #abstraction #refinement #thread

Thread-Modular Counterexample-Guided Abstraction Refinement (AM, AP, AR), pp. 356–372.

FLOPS-2010-SeidelV #automation #generative #theorem

Automatically Generating Counterexamples to Naive Free Theorems (DS, JV), pp. 175–190.

SEFM-2010-WeitlNF #logic

Structured Counterexamples for the Temporal Description Logic ALCCTL (FW, SN, BF), pp. 232–243.

POPL-2010-PodelskiW

Counterexample-guided focus (AP, TW), pp. 249–260.

POPL-2010-Terauchi #dependent type

Dependent types from counterexamples (TT), pp. 119–130.

ICST-2010-Irfan #state machine #testing

State Machine Inference in Testing Context with Long Counterexamples (MNI), pp. 508–511.

CAV-2009-BeerBCOT #using

Explaining Counterexamples Using Causality (IB, SBD, HC, AO, RJT), pp. 94–108.

VMCAI-2009-WimmerBB #bound #generative #markov #model checking #using

Counterexample Generation for Discrete-Time Markov Chains Using Bounded Model Checking (RW, BB, BB), pp. 366–380.

ASE-2008-HartKGCL #abstraction #proving #refinement

Augmenting Counterexample-Guided Abstraction Refinement with Proof Templates (TEH, KK, AG, MC, DL), pp. 387–390.

SEFM-2008-EdelkampS #ltl #model checking

Flash-Efficient LTL Model Checking with Minimal Counterexamples (SE, DS), pp. 73–82.

SEFM-2008-HansenG

Cheap and Small Counterexamples (HH, JG), pp. 53–62.

CAV-2008-KashyapG #using

Producing Short Counterexamples Using “Crucial Events” (SK, VKG), pp. 491–503.

TACAS-2007-HanK #model checking #probability

Counterexamples in Probabilistic Model Checking (TH, JPK), pp. 72–86.

ICALP-2007-ODonnellW #approximate

Approximation by DNF: Examples and Counterexamples (RO, KW), pp. 195–206.

AMOST-2007-WijesekeraASF #model checking #specification #testing

Relating counterexamples to test cases in CTL model checking specifications (DW, PA, LS, GF), pp. 75–84.

CAV-2007-Segelken #abstraction #automaton #hybrid #linear #model checking #modelling

Abstraction and Counterexample-Guided Construction of ω-Automata for Model Checking of Step-Discrete Linear Hybrid Models (MS), pp. 433–448.

CAV-2007-WangYGI #precise #reachability #using

Using Counterexamples for Improving the Precision of Reachability Computation with Polyhedra (CW, ZY, AG, FI), pp. 352–365.

TACAS-2006-GulavaniR #abstract interpretation #refinement

Counterexample Driven Refinement for Abstract Interpretation (BSG, SKR), pp. 474–488.

TACAS-2006-KonigK #abstraction #analysis #graph transformation #refinement

Counterexample-Guided Abstraction Refinement for the Analysis of Graph Transformation Systems (BK, VK), pp. 197–211.

CAV-2006-KroeningW #abstraction

Counterexamples with Loops for Predicate Abstraction (DK, GW), pp. 152–165.

DATE-2005-ShenQL #algorithm #analysis #performance

A Faster Counterexample Minimization Algorithm Based on Refutation Analysis (SS, YQ, SL), pp. 672–677.

FASE-2005-ChechikG #framework #generative

A Framework for Counterexample Generation and Exploration (MC, AG), pp. 220–236.

TACAS-2005-SchuppanB #ltl #model checking

Shortest Counterexamples for Symbolic Model Checking of LTL with Past (VS, AB), pp. 493–509.

CADE-2005-Zhang

Computer Search for Counterexamples to Wilkie’s Identity (JZ0), pp. 441–451.

VMCAI-2005-ShenQL #incremental #satisfiability

Minimizing Counterexample with Unit Core Extraction and Incremental SAT (SS, YQ, SL), pp. 298–312.

FSE-2004-ChakiGS

Explaining abstract counterexamples (SC, AG, OS), pp. 73–82.

FSE-2004-TanACZL

Heuristic-guided counterexample search in FLAVERS (JT, GSA, LAC, SZ, SL), pp. 201–210.

ICSE-2004-BeyerCM #generative #testing

Generating Tests from Counterexamples (DB, AC, TAH, RJ, RM), pp. 326–335.

CAV-2004-GroceKL #comprehension

Understanding Counterexamples with explain (AG, DK, FL), pp. 453–456.

TACAS-2003-ClarkeFHKST #abstraction #hybrid #refinement #verification

Verification of Hybrid Systems Based on Counterexample-Guided Abstraction Refinement (EMC, AF, ZH, BHK, OS, MT), pp. 192–207.

TACAS-2003-GlusmanKMFV #abstraction #evaluation #industrial #multi #refinement

Multiple-Counterexample Guided Iterative Abstraction Refinement: An Industrial Evaluation (MG, GK, SMH, RF, MYV), pp. 176–191.

TACAS-2003-McMillanA #abstraction #automation

Automatic Abstraction without Counterexamples (KLM, NA), pp. 2–17.

ICALP-2003-HenzingerJM

Counterexample-Guided Control (TAH, RJ, RM), pp. 886–902.

FME-2003-GurfinkelC #generative #model checking #multi

Generating Counterexamples for Multi-valued Model-Checking (AG, MC), pp. 503–521.

POPL-2003-BallNR #fault

From symptom to cause: localizing errors in counterexample traces (TB, MN, SKR), pp. 97–105.

CADE-2003-Clarke #abstraction #model checking #refinement #satisfiability

SAT-Based Counterexample Guided Abstraction Refinement in Model Checking (EMC), p. 1.

CAV-2003-ShohamG #abstraction #framework #game studies

A Game-Based Framework for CTL Counterexamples and 3-Valued Abstraction-Refinement (SS, OG), pp. 275–287.

LICS-2002-ClarkeJLV #model checking

Tree-Like Counterexamples in Model Checking (EMC, SJ, YL, HV), pp. 19–29.

SAS-2001-GiacobazziQ #model checking

Incompleteness, Counterexamples, and Refinements in Abstract Model-Checking (RG, EQ), pp. 356–373.

WLC-2000-KoshibaH #consistency

A Note on Finding One-Variable Patterns Consistent with Examples and Counterexamples (TK, KH), pp. 253–265.

CAV-2000-ClarkeGJLV #abstraction #refinement

Counterexample-Guided Abstraction Refinement (EMC, OG, SJ, YL, HV), pp. 154–169.

ISSTA-1996-JacksonD #design #detection

Elements of Style: Analyzing a Software Design Feature with a Counterexample Detector (DJ, CD), pp. 239–249.

DAC-1995-ClarkeGMZ #generative #model checking #performance

Efficient Generation of Counterexamples and Witnesses in Symbolic Model Checking (EMC, OG, KLM, XZ), pp. 427–432.

ALP-1992-MiddeldorpH

Counterexamples to Completeness Results for Basic Narrowing (Extended Abstract) (AM, EH), pp. 244–258.