On the public citation graph
Whole Execution Traces
0 signed · 91 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-45937-5_4openalex-snapshot
Data Compression Transformations for Dynamically Allocated Data Structures
inferredcites →https://doi.org/10.1109/dcc.1997.581951openalex-snapshot
Linear-time, incremental hierarchy inference for compression
inferredcites →https://doi.org/10.1109/hpca.2001.903264openalex-snapshot
Differential FCM: increasing value prediction accuracy by improving table usage efficiency
inferredcites →https://doi.org/10.1109/iccl.1998.674173openalex-snapshot
Path profile guided partial redundancy elimination using speculation
inferredcites →https://doi.org/10.1109/l-ca.2002.8openalex-snapshot
MinneSPEC: A New SPEC Benchmark Workload for Simulation-Based Computer Architecture Research
inferredcites →https://doi.org/10.1109/micro.1996.566464openalex-snapshot
Exceeding the dataflow limit via value prediction
inferredcites →https://doi.org/10.1109/micro.1997.645793openalex-snapshot
Path-based next trace prediction
inferredcites →https://doi.org/10.1109/micro.1997.645815openalex-snapshot
The predictability of data values
inferredcites →https://doi.org/10.1109/micro.1998.742774openalex-snapshot
Better global scheduling using path profiles
inferredcites →https://doi.org/10.1109/pact.1999.807407openalex-snapshot
Exploring last n value prediction
inferredcites →https://doi.org/10.1109/pact.2003.1238012openalex-snapshot
Compressing extended program traces using value predictors
inferredcites →https://doi.org/10.1145/264107.264207openalex-snapshot
Prefetching using Markov predictors
inferredcites →https://doi.org/10.1145/277650.277653openalex-snapshot
Complete removal of redundant expressions
inferredcites →https://doi.org/10.1145/339647.339676openalex-snapshot
Understanding the backward slices of performance degrading instructions
inferredcites →https://doi.org/10.1145/342001.339676openalex-snapshot
Understanding the backward slices of performance degrading instructions
inferredcites →https://doi.org/10.1145/378795.378835openalex-snapshot
Timestamped whole program path representation and its applications
inferredcites →https://doi.org/10.1145/378795.378840openalex-snapshot
Efficient representations and abstractions for quantifying and exploiting data reference locality
inferredcites →https://doi.org/10.1145/503272.503287openalex-snapshot
An efficient profile-analysis framework for data-layout optimizations
inferredcites →https://doi.org/10.1145/512529.512554openalex-snapshot
Dynamic hot data stream prefetching for general-purpose programs
inferredcites →https://doi.org/10.1145/512553.512554openalex-snapshot
Dynamic hot data stream prefetching for general-purpose programs
inferredcites →https://doi.org/10.1145/581888.581894openalex-snapshot
Frequent value locality and its applications
inferredcites →https://doi.org/10.1145/781027.781076openalex-snapshot
Using SimPoint for accurate and efficient simulation
inferredcites →https://doi.org/10.1145/996841.996855openalex-snapshot
Cost effective dynamic program slicing
inferredcites →https://doi.org/10.5555/266800.266824openalex-snapshot
The predictability of data values
inferredcites →https://doi.org/10.5555/290940.290968openalex-snapshot
Better global scheduling using path profiles
inferredcites →https://doi.org/10.5555/520793.825757openalex-snapshot
Exploring last n value prediction
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-1-4020-5869-1openalex-snapshot
Designing Embedded Processors A Low Power Perspective
inferred← citeshttps://doi.org/10.1007/978-1-4020-5869-1_5openalex-snapshot
Design and Run Time Code Compression for Embedded Systems
inferred← citeshttps://doi.org/10.1007/s00607-018-0591-zopenalex-snapshot
A program slicing-based method for effective detection of coincidentally correct test cases
inferred← citeshttps://doi.org/10.1007/s10664-020-09859-yopenalex-snapshot
CGT-FL: using cooperative game theory to effective fault localization in presence of coincidental correctness
inferred← citeshttps://doi.org/10.1007/s11390-023-1569-7openalex-snapshot
Minimal Context-Switching Data Race Detection with Dataflow Tracking
inferred← citeshttps://doi.org/10.1109/ase.2013.6693065openalex-snapshot
PIEtrace: Platform independent executable trace
inferred← citeshttps://doi.org/10.1109/ase.2013.6693066openalex-snapshot
Improving efficiency of dynamic analysis with dynamic dependence summaries
inferred← citeshttps://doi.org/10.1109/cit.2014.27openalex-snapshot
Mining Periodic Patterns from Nested Event Logs
inferred← citeshttps://doi.org/10.1109/date.2007.364389openalex-snapshot
Instruction Trace Compression for Rapid Instruction Cache Simulation
inferred← citeshttps://doi.org/10.1109/iadcc.2009.4809256openalex-snapshot
Validation of Embedded Software through Static Analysis of Machine Codes
inferred← citeshttps://doi.org/10.1109/icsm.2007.4362621openalex-snapshot
Matching Control Flow of Program Versions
inferred← citeshttps://doi.org/10.1109/icsm.2009.5306329openalex-snapshot
Detecting virus mutations via dynamic matching
inferred← citeshttps://doi.org/10.1109/icst.2012.159openalex-snapshot
Using Mutants to Locate "Unknown" Faults
inferred← citeshttps://doi.org/10.1109/iiswc.2007.4362189openalex-snapshot
Seekable Compressed Traces
inferred← citeshttps://doi.org/10.1109/imccc.2012.203openalex-snapshot
Binary Software Vulnerability Analysis Based on Bidirectional-Slicing
inferred← citeshttps://doi.org/10.1109/ispass.2012.6189205openalex-snapshot
A lightweight hybrid hardware/software approach for object-relative memory profiling
inferred← citeshttps://doi.org/10.1109/l-ca.2006.17openalex-snapshot
A Case for Compressing Traces with BDDs
inferred← citeshttps://doi.org/10.1109/mascots.2005.12openalex-snapshot
Accurate Modeling of Aggressive Speculation in Modern Microprocessor Architectures
inferred← citeshttps://doi.org/10.1109/micro.2010.49openalex-snapshot
SD3: A Scalable Approach to Dynamic Data-Dependence Profiling
inferred← citeshttps://doi.org/10.1109/pact.2009.12openalex-snapshot
Chainsaw: Using Binary Matching for Relative Instruction Mix Comparison
inferred← citeshttps://doi.org/10.1109/saner.2015.7081862openalex-snapshot
TRACERJD: Generic trace-based dynamic dependence analysis with fine-grained logging
inferred← citeshttps://doi.org/10.1109/snpd.2007.178openalex-snapshot
Assessment on Fault-tolerance Performance Using Neural Network Model Based on Ant Colony Optimization Algorithm for Fault Diagnosis in Distribution Systems of Electric Power Systems
inferred← citeshttps://doi.org/10.1109/snpd.2007.183openalex-snapshot
Chinese Question Classification Based on Ensemble Learning
inferred← citeshttps://doi.org/10.1109/synasc.2011.53openalex-snapshot
Using the Executable Semantics for CFG Extraction and Unfolding
inferred← citeshttps://doi.org/10.1109/tc.2012.182openalex-snapshot
SD3: An Efficient Dynamic Data-Dependence Profiling Mechanism
inferred← citeshttps://doi.org/10.1109/trustcom.2011.89openalex-snapshot
Statistical Fault Localization via Semi-dynamic Program Slicing
inferred← citeshttps://doi.org/10.1109/tsc.2014.2360860openalex-snapshot
A Semi-Automatic Approach of Transforming Applications to be Multi-Tenancy Enabled
inferred← citeshttps://doi.org/10.1109/tse.2008.66openalex-snapshot
A Systematic Study of Failure Proximity
inferred← citeshttps://doi.org/10.1109/tse.2017.2688383openalex-snapshot
Reviving Sequential Program Birthmarking for Multithreaded Software Plagiarism Detection
inferred← citeshttps://doi.org/10.1145/1081706.1081738openalex-snapshot
Matching execution histories of program versions
inferred← citeshttps://doi.org/10.1145/1095430.1081738openalex-snapshot
Matching execution histories of program versions
inferred← citeshttps://doi.org/10.1145/1133255.1134002openalex-snapshot
Pruning dynamic slices with confidence
inferred← citeshttps://doi.org/10.1145/1133981.1134002openalex-snapshot
Pruning dynamic slices with confidence
inferred← citeshttps://doi.org/10.1145/1181775.1181786openalex-snapshot
Dynamic slicing long running programs through execution fast forwarding
inferred← citeshttps://doi.org/10.1145/1273463.1273491openalex-snapshot
Enabling tracing Of long-running multithreaded programs via dynamic execution reduction
inferred← citeshttps://doi.org/10.1145/1330017.1330021openalex-snapshot
Dynamic slicing on Java bytecode traces
inferred← citeshttps://doi.org/10.1145/1369396.1369398openalex-snapshot
Formulating and implementing profiling over adaptive ranges
inferred← citeshttps://doi.org/10.1145/1806596.1806617openalex-snapshot
Finding low-utility data structures
inferred← citeshttps://doi.org/10.1145/1806672.1806688openalex-snapshot
Learning universal probabilistic models for fault localization
inferred← citeshttps://doi.org/10.1145/1809028.1806617openalex-snapshot
Finding low-utility data structures
inferred← citeshttps://doi.org/10.1145/1985793.1985938openalex-snapshot
Tracking data structures for postmortem analysis (NIER track)
inferred← citeshttps://doi.org/10.1145/2002951.2002953openalex-snapshot
Detecting algorithms using dynamic analysis
inferred← citeshttps://doi.org/10.1145/2491411.2491416openalex-snapshot
Cachetor: detecting cacheable data to remove bloat
inferred← citeshttps://doi.org/10.1145/2560047openalex-snapshot
Scalable Runtime Bloat Detection Using Abstract Dynamic Slicing
inferred← citeshttps://doi.org/10.1145/2597008.2597143openalex-snapshot
Plagiarism detection for multithreaded software based on thread-aware software birthmarks
inferred← citeshttps://doi.org/10.1145/2610384.2610410openalex-snapshot
SunCat: helping developers understand and predict performance problems in smartphone applications
inferred← citeshttps://doi.org/10.1145/2931037.2931066openalex-snapshot
Efficient flow profiling for detecting performance bugs
inferred← citeshttps://doi.org/10.1145/3649827openalex-snapshot
PROMPT: A Fast and Extensible Memory Profiling Framework
inferred← citeshttps://doi.org/10.1145/3843779.3844631openalex-snapshot
Toward Trace-Guided Automated Program Repair
inferred← citeshttps://doi.org/10.14264/uql.2015.680openalex-snapshot
Denotational trace: a category-theoretic solution to the practical problems of software execution tracing
inferred← citeshttps://doi.org/10.18130/v3479copenalex-snapshot
Trace-Based Dynamic Binary Parallelization
inferred← citeshttps://doi.org/10.4236/jis.2014.52004openalex-snapshot
Detection of Sophisticated Network Enabled Threats via a Novel Micro-Proxy Architecture
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0604043openalex-snapshot
Demand-driven Inlining in a Region-based Optimizer for ILP Architectures
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.