Category: Computation & Complexity
Theoretical and empirical analysis of algorithms, state spaces, and computational bounds.
-
Memory Allocation Overhead: Quantitative Evaluation of jemalloc vs mimalloc Under Severe Cache Contention
Quantitative evaluation of jemalloc versus mimalloc under high-concurrency cache contention, analyzing fragmentation, RSS footprints, and CPU cycles.
By Read Investigation → -
The Naked Compiler — Experiment 5: Quantitative Measurement of Branch Mispredictions in Binary Analysis
Empirical evaluation of branch predictor saturation under path explosion during symbolic execution, measuring cycle latencies and state divergence across x86_64, AArch64, and RV64GC.
By Read Investigation → -
The Naked Compiler — Experiment 4: 9,712 Stripped Safety Guards Across 3 Major Codebases
Cross-codebase automated binary audit quantifying 9,712 stripped safety guards across FRRouting, GCC 15.2, and the Linux kernel 6.8 with empirical reachability proofs.
By Read Investigation → -
Debt Collector Series: CLI Integration
Empirical binary analysis and systems evaluation: Debt Collector Series: CLI Integration. Analyzing compiler optimization artifacts, memory bounds, and software security invariants.
By Read Investigation → -
Debt Collector Series: Scan a directory
Empirical binary analysis and systems evaluation: Debt Collector Series: Scan a directory. Analyzing compiler optimization artifacts, memory bounds, and software security invariants.
By Read Investigation → -
Debt Collector Series: §10 The Solution: Debt-Managed Engineering
Empirical binary analysis and systems evaluation: Debt Collector Series: §10 The Solution: Debt-Managed Engineering. Analyzing compiler optimization artifacts, memory bounds, and software security invariants.
By Read Investigation → -
Debt Collector Series: §8 Reporting — Visualization & Output
Empirical binary analysis and systems evaluation: Debt Collector Series: §8 Reporting — Visualization Output. Analyzing compiler optimization artifacts, memory bounds, and software security invariants.
By Read Investigation → -
Debt Collector Series: §7 AttackGraph — Formal Exploit Chain Model
Empirical binary analysis and systems evaluation: Debt Collector Series: §7 AttackGraph — Formal Exploit Chain Model. Analyzing compiler optimization artifacts, memory bounds, and software security invariants.
By Read Investigation → -
Debt Collector Series: §4 Wasm Fuzzer — Guided Mutation Engine
Empirical binary analysis and systems evaluation: Debt Collector Series: §4 Wasm Fuzzer — Guided Mutation Engine. Analyzing compiler optimization artifacts, memory bounds, and software security invariants.
By Read Investigation → -
Debt Collector Series: §3 UMM — Universal Memory Mapper
Empirical binary analysis and systems evaluation: Debt Collector Series: §3 UMM — Universal Memory Mapper. Analyzing compiler optimization artifacts, memory bounds, and software security invariants.
By Read Investigation →