33 papers:
CASE-2015-BasileCC #identification #modelling #petri net #realtime- Real time identification of Time Petri net faulty models (FB, PC, JC), pp. 280–285.
ICSE-v2-2015-Schwartz-Narbonne #c #named #source code- VERMEER: A Tool for Tracing and Explaining Faulty C Programs (DSN, CO, MS, TW), pp. 737–740.
ICST-2015-NardoPB #analysis #generative #modelling #mutation testing #testing- Generating Complex and Faulty Test Data through Model-Based Mutation Analysis (DDN, FP, LCB), pp. 1–10.
DATE-2014-KeramidasMKN #predict- Spatial pattern prediction based management of faulty data caches (GK, MM, AK, DN), pp. 1–6.
ICSME-2014-AbreuCFMPS14a #detection #fault #locality #smell- FaultySheet Detective: When Smells Meet Fault Localization (RA, JC, JPF, PM, AP, JS), pp. 625–628.
ICST-2014-MoonKKY #fault #locality #source code- Ask the Mutants: Mutating Faulty Programs for Fault Localization (SM, YK, MK, SY), pp. 153–162.
AdaEurope-2013-XueN- Measuring the Odds of Statements Being Faulty (XX, ASN), pp. 109–126.
SEKE-2013-WangGZZX #array #combinator #generative #interactive #testing- Generating Partial Covering Array for Locating Faulty Interactions in Combinatorial Testing (ZW, TG, WZ, WZ, BX), pp. 578–583.
SAT-2012-ZhangMZ #constraints #identification #interactive #optimisation #theorem proving- Faulty Interaction Identification via Constraint Solving and Optimization (JZ, FM, ZZ), pp. 186–199.
DATE-2011-BaiDDC #network #program transformation #programming #runtime- Simplified programming of faulty sensor networks via code transformation and run-time interval computation (LSB, RPD, PAD, PHC), pp. 88–93.
ESOP-2010-MeolaW #fault tolerance #logic #reasoning #source code- Faulty Logic: Reasoning about Fault Tolerant Programs (MLM, DW), pp. 468–487.
ICST-2010-DebroyW #automation #source code #using- Using Mutation to Automatically Suggest Fixes for Faulty Programs (VD, WEW), pp. 65–74.
ICALP-A-2008-RegevS #quantum- Impossibility of a Quantum Speed-Up with a Faulty Oracle (OR, LS), pp. 773–781.
ASE-2007-JiangS #control flow #debugging #predict #statistics- Context-aware statistical debugging: from bug predictors to faulty control flow paths (LJ, ZS), pp. 184–193.
FoSSaCS-2006-OuaknineW #logic #metric #on the #turing machine- On Metric Temporal Logic and Faulty Turing Machines (JO, JW), pp. 217–230.
SEFM-2006-AlpuenteBFR #automation- A Semi-Automatic Methodology for Repairing FaultyWeb Sites (MA, DB, MF, DR), pp. 31–40.
ICFP-2006-WalkerMLRA #static typing #type system #λ-calculus- Static typing for a faulty λ calculus (DW, LWM, JL, GAR, DIA), pp. 38–49.
ASE-2005-GuptaHZG #using- Locating faulty code using failure-inducing chops (NG, HH, XZ, RG), pp. 263–272.
FoSSaCS-2003-AbdullaR #communication #probability #verification- Verification of Probabilistic Systems with Faulty Communication (PAA, AMR), pp. 39–53.
LOPSTR-2003-AlexandreBD #induction #proving #synthesis- Predicate Synthesis from Inductive Proof Attempt of Faulty Conjectures (FA, KB, MD), pp. 20–33.
SAC-2002-FuC #network #polynomial- Cycle embedding in faulty hierarchical cubic networks (JSF, GHC), pp. 860–864.
ICML-2001-SandM #estimation #modelling #using- Repairing Faulty Mixture Models using Density Estimation (PS, AWM), pp. 457–464.
ASE-2000-Monroy #abduction #recursion- The Use of Abduction and Recursion-Editor Techniques for the Correction of Faulty Conjectures (RM), pp. 91–100.
ICALP-2000-AlonKKMS #scalability- Scalable Secure Storage when Half the System Is Faulty (NA, HK, MK, DM, JPS), pp. 576–587.
ICDAR-1999-KlinkJ #named- MergeLayouts: Overcoming Faulty Segmentations by a Comprehensive Voting of Commercial OCR Devices (SK, TJ), pp. 386–389.
ICALP-1996-ChlebusGI #simulation- Shared-Memory Simulations on a Faulty-Memory DMM (BSC, AG, PI), pp. 586–597.
CADE-1996-Protzen- Patching Faulty Conjectures (MP), pp. 77–91.
ICALP-1994-Siegelmann #network #on the #power of #probability- On The Computational Power of Probabilistic and Faulty Neural Networks (HTS), pp. 23–34.
SEKE-1993-Porter #classification #component #predict- Developing and Analyzing Classification Rules for Predicting Faulty Software Components (AAP), pp. 453–461.
STOC-1992-AumannB #array- Computing with Faulty Arrays (YA, MBO), pp. 162–169.
STOC-1989-HastadLN #performance #using- Fast Computation Using Faulty Hypercubes (Extended Abstract) (JH, FTL, MN), pp. 251–263.
STOC-1986-Cleve #security- Limits on the Security of Coin Flips when Half the Processors Are Faulty (Extended Abstract) (RC), pp. 364–369.
PODS-1983-FischerLP #distributed #process- Impossibility of Distributed Consensus with One Faulty Process (MJF, NAL, MP), pp. 1–7.