Office: LWSN 3133
E-mail: anavabi at cs dot purdue dot edu
Background
I am a Ph.D. student in the Computer Science Department at Purdue University. My advisor is Suresh Jagannathan. I have received my Masters in Computer Science from Purdue University and my B.S. in Computer Science from University of Arizona.
Research Interests
- programming language abstractions for concurrent programming
- static and dynamic program analysis
- software transactional memory
- compiler optimizations
- functional programming
Conference Papers
Armand Navabi and Suresh Jagannathan. Exceptionally Safe Futures. 11th International Conference on Coordination Models and Languages (Coordination'09). [pdf]
Xiangyu Zhang, Armand Navabi, Suresh Jagannathan. Alchemist: A Transparent Dependence Distance Profiling Infrastructure. IEEE/ACM International Symposium on Code Generation and Optimization (CGO'09). [pdf]
Armand Navabi, Xiangyu Zhang, Suresh Jagannathan. Quasi-static scheduling for safe futures. ACM SIGPLAN Principles and Practice of Parallel Computing (PPoPP'08), pages 23-32, 2008. [pdf]
Ginger Myles, Christian S. Collberg, Zachary V. Heidepriem, Armand Navabi. The evaluation of two software watermarking algorithms. Software - Practice and Experience (SPE), Volume 35, 2005. [pdf]
Xiangyu Zhang, Armand Navabi, Suresh Jagannathan. Alchemist: A Transparent Dependence Distance Profiling Infrastructure. IEEE/ACM International Symposium on Code Generation and Optimization (CGO'09). [pdf]
Armand Navabi, Xiangyu Zhang, Suresh Jagannathan. Quasi-static scheduling for safe futures. ACM SIGPLAN Principles and Practice of Parallel Computing (PPoPP'08), pages 23-32, 2008. [pdf]
Ginger Myles, Christian S. Collberg, Zachary V. Heidepriem, Armand Navabi. The evaluation of two software watermarking algorithms. Software - Practice and Experience (SPE), Volume 35, 2005. [pdf]