46 papers:
STOC-2015-BackursI #distance #edit distance- Edit Distance Cannot Be Computed in Strongly Subquadratic Time (unless SETH is false) (AB, PI), pp. 51–58.
FM-2015-ChimdyalwarDCVC #abstraction #bound #model checking #static analysis #using- Eliminating Static Analysis False Positives Using Loop Abstraction and Bounded Model Checking (BC, PD, AC, SV, AC), pp. 573–576.
ICSE-v2-2015-HerzigN #detection #empirical #using- Empirically Detecting False Test Alarms Using Association Rules (KH, NN), pp. 39–48.
ICPR-2014-BalntasTM #detection- Improving Object Tracking with Voting from False Positive Detections (VB, LT, KM), pp. 1928–1933.
PPoPP-2014-LiuTHB #detection #named #predict- PREDATOR: predictive false sharing detection (TL, CT, ZH, EDB), pp. 3–14.
ASE-2012-ThungLLJRD #debugging #detection #empirical #fault #tool support #what- To what extent could we detect field defects? an empirical study of false negatives in static bug finding tools (FT, L, DL, LJ, FR, PTD), pp. 50–59.
ICSE-2012-PradelG #automation #debugging #detection #generative #mining #specification #testing- Leveraging test generation and specification mining for automated bug detection without false positives (MP, TRG), pp. 288–298.
ISSTA-2012-GrossFZ #search-based #testing- Search-based system testing: high coverage, no false alarms (FG, GF, AZ), pp. 67–77.
VLDB-2012-LiuZW11 #mining- Controlling False Positives in Association Rule Mining (GL, HZ, LW), pp. 145–156.
OOPSLA-2011-LiuB #automation #detection #named #precise- SHERIFF: precise detection and automatic mitigation of false sharing (TL, EDB), pp. 3–18.
ASPLOS-2011-HayashizakiWISN #performance- Improving the performance of trace-based systems by false loop filtering (HH, PW, HI, MJS, TN), pp. 405–418.
DAC-2010-Coudert #algorithm #performance #verification- An efficient algorithm to verify generalized false paths (OC), pp. 188–193.
ICGT-2010-Esparza #concurrent #tool support- A False History of True Concurrency: From Petri to Tools (JE), pp. 1–2.
DAC-2009-TsaiH- A false-path aware formal static timing analyzer considering simultaneous input transitions (ST, CYH), pp. 25–30.
TACAS-2009-GouesW #mining #specification- Specification Mining with Few False Positives (CLG, WW), pp. 292–306.
ASE-2008-PostSKG #abstract interpretation #bound #model checking- Reducing False Positives by Combining Abstract Interpretation and Bounded Model Checking (HP, CS, AK, TG), pp. 188–197.
STOC-2008-LovettMS- Inverse conjecture for the gowers norm is false (SL, RM, AS), pp. 547–556.
KDD-2008-WuLCC #learning #symmetry- Asymmetric support vector machines: low false-positive learning under the user tolerance (SHW, KPL, CMC, MSC), pp. 749–757.
IFM-2007-CalameIPS #debugging- Bug Hunting with False Negatives (JRC, NI, JvdP, NS), pp. 98–117.
DHM-2007-LiWW- The Effects of the False Vocal Fold Gaps in a Model of the Larynx on Pressures Distributions and Flows (SL, MW, SW), pp. 147–156.
DATE-2006-FeyGD #verification- Avoiding false negatives in formal verification for protocol-driven blocks (GF, DG, RD), pp. 1225–1226.
SAT-2006-BuningZ #quantifier- Minimal False Quantified Boolean Formulas (HKB, XZ), pp. 339–352.
SAS-2005-JungKSY #analysis #c #statistics- Taming False Alarms from a Domain-Unaware C Analyzer by a Bayesian Statistical Post Analysis (YJ, JK, JS, KY), pp. 203–217.
KDD-2005-HershkopS #email #modelling #reduction- Combining email models for false positive reduction (SH, SJS), pp. 98–107.
DATE-v2-2004-GlebovGZOPB #analysis- False-Noise Analysis for Domino Circuits (AG, SG, VZ, CO, RP, MRB), pp. 784–789.
DATE-v2-2004-RanKWM #analysis- Eliminating False Positives in Crosstalk Noise Analysis (YR, AK, YW, MMS), pp. 1192–1197.
VLDB-2004-YuCLZ #data type #mining #transaction- False Positive or False Negative: Mining Frequent Itemsets from High Speed Transactional Data Streams (JXY, ZC, HL, AZ), pp. 204–215.
DAC-2002-LiouKWC #analysis #performance #statistics #testing #validation- False-path-aware statistical timing analysis and efficient path selection for delay testing and timing validation (JJL, AK, LCW, KTC), pp. 566–569.
DAC-2002-ZengAA #identification #using- False timing path identification using ATPG techniques and delay-based information (JZ, MSA, JAA), pp. 562–565.
DATE-2002-ArrigoniDPLW #scheduling- False Path Elimination in Quasi-Static Scheduling (GA, LD, CP, LL, YW), pp. 964–970.
DAC-2001-ArunachalamBP #analysis #interactive- False Coupling Interactions in Static Timing Analysis (RA, RDB, LTP), pp. 726–731.
DATE-2001-ZengABA #identification- Full chip false timing path identification: applications to the PowerPCTM microprocessors (JZ, MSA, JB, JAA), pp. 514–519.
CAV-2001-MoondanosSHK #divide and conquer #equivalence #logic #named #verification- CLEVER: Divide and Conquer Combinational Logic Equivalence VERification with False Negative Elimination (JM, CJHS, ZH, DK), pp. 131–143.
DAC-2000-BlaauwPD #graph- Removing user specified false paths from timing graphs (DB, RP, AD), pp. 270–273.
DAC-1999-RaimiA #detection- Detecting False Timing Paths: Experiments on PowerPC Microprocessors (RR, JAA), pp. 737–741.
SAC-1999-JinH #array #clustering #problem- False Sharing Problems in Cluster-Based Disk Arrays (HJ, KH), pp. 461–465.
DAC-1997-KukimotoB #analysis #detection- Exact Required Time Analysis via False Path Detection (YK, RKB), pp. 220–225.
PPoPP-1997-AmzaCRZ #distributed #memory management #trade-off- Trade-offs Between False Sharing and Aggregation in Software Distributed Shared Memory (CA, ALC, KR, WZ), pp. 90–99.
STOC-1996-KushilevitzLO #communication #complexity- The Linear-Array Conjecture in Communication Complexity is False (EK, NL, RO), pp. 1–10.
HPDC-1996-FreehA #distributed #memory management- Dynamically Controlling False Sharing in Distributed Shared Memory (VWF, GRA), pp. 403–411.
ICDAR-v1-1995-LiangLY #query- False hits of tri-syllabic queries in a Chinese signature file (TL, SYL, WPY), pp. 159–162.
PPoPP-1995-JeremiassenE #data transformation #memory management #multi- Reducing False Sharing on Shared Memory Multiprocessors through Compile Time Data Transformations (TEJ, SJE), pp. 179–188.
DAC-1993-HuangPS #approach #approximate #heuristic #polynomial #problem- A Polynomial-Time Heuristic Approach to Approximate a Solution to the False Path Problem (STH, TMP, JMS), pp. 118–122.
DAC-1992-ChenDC- Circuit Enhancement by Eliminating Long False Paths (HCC, DHCD, SWC), pp. 249–252.
PLDI-1992-PughW #data flow #dependence #using- Eliminating False Data Dependences using the Omega Test (WP, DW), pp. 140–151.
DAC-1989-DuYG #analysis #on the #problem- On the General False Path Problem in Timing Analysis (DHCD, SHY, SG), pp. 555–560.