8 papers:
ICSE-2013-HassanA #data flow #multi- Comparing multi-point stride coverage and dataflow coverage (MMH, JHA), pp. 172–181.
- ICSE-2012-ZhouXZ #bound #named #polynomial #search-based
- Stride: Search-based deterministic replay in polynomial time via bounded linkage (JZ, XX, CZ), pp. 892–902.
PLDI-2003-InagakiOKN- Stride prefetching by dynamically inspecting objects (TI, TO, HK, TN), pp. 269–277.
- PLDI-2002-Wu #performance #source code
- Efficient Discovery of Regular Stride Patterns in Irregular Programs (YW), pp. 210–221.
ICPR-v4-2002-BenAbdelkaderCD #automation #estimation #identification #using- Person Identification Using Automatic Height and Stride Estimation (CB, RC, LSD), pp. 377–380.
CC-2002-WuSKLF- Value-Profile Guided Stride Prefetching for Irregular Code (YW, MJS, RK, WL, JF), pp. 307–324.
HPCA-1995-DahlgrenS #effectiveness #multi- Effectiveness of Hardware-Based Stride and Sequential Prefetching in Shared-Memory Multiprocessors (FD, PS), pp. 68–77.
CLP-1990-Malhotra90 #algorithm #prolog- An Algorithm for Optimal Back-Striding in Prolog (VMM), pp. 147–158.
