Demo Data from EDBT 2026 / reviewers in the wild / expert
Abhik Paul
dblp:332/4336
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2022
—ORCID · unresolved
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 1 · 1 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Software engineering, system software, and programming languages
1 paper |
Compilers and program optimization · 100% | |
| Network and information security
1 paper |
Privacy and data protection · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Compilers and program optimization › compiler security
compiler optimization security |
0.6 | 1 | 2022 | Quantifying Information Leakage for Security Verification of Compiler Optimizations · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2022 |
Compilers and program optimization › verified compilation
translation validation |
0.6 | 1 | 2022 | Quantifying Information Leakage for Security Verification of Compiler Optimizations · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2022 |
Privacy and data protection › information leakage
side-channel privacy leakage |
0.2 | 1 | 2022 | Quantifying Information Leakage for Security Verification of Compiler Optimizations · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2022 |
Methods — techniques the papers use, named apart from their topics
static taint analysis · 1.1leak propagation vector · 1.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2022 | Quantifying Information Leakage for Security Verification of Compiler OptimizationsabstractCompiler optimizations can be functionally correct but not secure. In this work, we attempt to quantify the information leakage in a program for the security verification of compiler optimizations. Our work has the following contributions. We demonstrate that static taint analysis is applicable for security verification of compile optimizations. We develop a completely automated approach for quantifying the information leak in a program in the context of compiler optimizations. Our method avoids many false-positives scenarios due to implicit flow. It can handle leaks in a loop and propagates leaks over paths using the leak propagation vector. With our quantification parameters, we verify the relative security of source and transformed programs considering the optimizations phase of a compiler as a black box. Our experimental evaluations on benchmarks for various compiler optimizations in SPARK show that the SPARK compiler is actually leaky. Priyanka Panigrahi, Abhik Paul, Chandan Karfa |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. | 2 |