Ange-Thierry Ishimwe
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Ange-Thierry Ishimwe has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
- Tamara Silbergleit Lehman
Electrical, Computer and Energy Engineering Department, University of Colorado Boulder, Boulder, CO, USA
3 shared publications - Joseph Izraelevitz
University of Colorado, Boulder, USA
2 shared publications - Zack McKevitt
University of Colorado Boulder, Boulder, USA
2 shared publications - Ange-Thierry Ishimwe1 shared publication
- Kidus Workneh
University of Colorado, Boulder, Boulder, USA
1 shared publication - Phaedra Sophia Curlin
University of Colorado Boulder, Boulder, United States
1 shared publication
Latest Publications
- Open Access
- 28 January 2026
- Published by Association for Computing Machinery (ACM)
- p. 67-80
SSMR: Statically Detecting Speculation Safe Memory Regions to Mitigate Transient Execution Attacks
- 28 January 2026
- Published by Association for Computing Machinery (ACM)
- p. 67-80
Open AccessSSMR: Statically Detecting Speculation Safe Memory Regions to Mitigate Transient Execution Attacks
- Open Access
PrediPrune: Reducing Verification Overhead in Souper with Machine Learning Driven Pruning
Souper is a powerful enumerative superoptimizer that enhances the runtime performance of programs by optimizing LLVM intermediate representation (IR) code. However, its verification process, which relies on a computationally expensive SMT solver to validate optimization candidates, must explore a large search space. This large search space makes the verification process particularly expensive, increasing the burden to incorporate Souper into compilation tools. We propose PrediPrune, a stochastic candidate pruning strategy that effectively reduces the number of invalid candidates passed to the SMT solver. By utilizing machine learning techniques to predict the validity of candidates based on features extracted from the code, PrediPrune prunes unlikely candidates early, decreasing the verification workload. When combined with the state-of-the-art approach (Dataflow), PrediPrune decreases compilation time by 51% compared to the Baseline and by 12% compared to using only Dataflow, emphasizing the effectiveness of the combined approach that integrates a purely ML-based method (PrediPrune) with a purely non-ML based (Dataflow) method. Additionally, PrediPrune offers a flexible interface to trade-off compilation time and optimization opportunities, allowing end users to adjust the balance according to their needs.
Open AccessPrediPrune: Reducing Verification Overhead in Souper with Machine Learning Driven Pruning
Souper is a powerful enumerative superoptimizer that enhances the runtime performance of programs by optimizing LLVM intermediate representation (IR) code. However, its verification process, which relies on a computationally expensive SMT solver to validate optimization candidates, must explore a large search space. This large search space makes the verification process particularly expensive, increasing the burden to incorporate Souper into compilation tools. We propose PrediPrune, a stochastic candidate pruning strategy that effectively reduces the number of invalid candidates passed to the SMT solver. By utilizing machine learning techniques to predict the validity of candidates based on features extracted from the code, PrediPrune prunes unlikely candidates early, decreasing the verification workload. When combined with the state-of-the-art approach (Dataflow), PrediPrune decreases compilation time by 51% compared to the Baseline and by 12% compared to using only Dataflow, emphasizing the effectiveness of the combined approach that integrates a purely ML-based method (PrediPrune) with a purely non-ML based (Dataflow) method. Additionally, PrediPrune offers a flexible interface to trade-off compilation time and optimization opportunities, allowing end users to adjust the balance according to their needs.
- 31 January 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Computer Architecture Letters
- Vol. 23 (1) , 33-36
Baobab Merkle Tree for Efficient Secure Memory
Secure memory is a natural solution to hardware vulnerabilities in memory, but it faces fundamental challenges of performance and memory overheads. While significant work has gone into optimizing the protocol for performance, far less work has gone into optimizing its memory overhead. In this work, we propose the Baobab Merkle Tree, in which counters are memoized in an on-chip table. The Baobab Merkle Tree reduces spatial overhead of a Bonsai Merkle Tree by 2-4X without incurring performance overhead.
- 31 January 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Computer Architecture Letters
- Vol. 23 (1) , 33-36
Baobab Merkle Tree for Efficient Secure Memory
Secure memory is a natural solution to hardware vulnerabilities in memory, but it faces fundamental challenges of performance and memory overheads. While significant work has gone into optimizing the protocol for performance, far less work has gone into optimizing its memory overhead. In this work, we propose the Baobab Merkle Tree, in which counters are memoized in an on-chip table. The Baobab Merkle Tree reduces spatial overhead of a Bonsai Merkle Tree by 2-4X without incurring performance overhead.