My name is Ali Kheradmand. I am currently a senior B.Sc. student at Computer Engineering Department of Sharif University of Technology, Tehran, Iran.

My research interests chiefly include Computer Networks, Software Engineering, and Algorithms. Please refer to research section for more information.


  • Sharif University of Technology
    Tehran, Iran (2010 - present)
    B.Sc. in Computer Engineering (Current GPA: 18.70/20)
  • Shahid Ejei High School
    Isfahan, Iran, 2006 - 2010
    Affiliated with the National Organization for the Development of Exceptional Talents (NODET)
    Diploma in Physics and Mathematics Discipline (GPA: 19.62/20)
  • Young Scholars Club
    Tehran, Iran, 2008 - 2009
    The sole authority and regulating body for scienti c Olympiads in Iran
    Silver Medal in Iranian National Olympiad in Informatics (INOI)

Research Interests

  • Software and its Engineering
    • Operating Systems
    • Programming Languages
  • Computer Networks
    • Network Protocol Design
    • Network Architecture
  • Design and Analysis of Algorithms

Research Experience

  • Dependable Systems Laboratory headed by Prof. George Candea
    Ecole Polytechnique Federale de Lausanne, Lausanne, Switzerland (July 2013 - Sep. 2013)
    Research Intern under supervision of Prof. Candea and B. Kasikci

    My research internship in DSLab was mainly focused on data race and deadlock detection. During the first half of the internship, I worked on data race detection. The RaceMob system, a crowdsourced data race detector developed in DSLab, used Relay, a complete static data race detector for its static detection phase. Unfortunately, Relay does not scale to large programs. I wanted to improve scalability of RaceMob by employing RacerX static data race detection part instead. The idea was to implement the core lockset analysis algorithm without its unsound filters in combinations with accurate interprocedural alias analysis. However, caching in RacerX which is essential for its scalibility, prevented us from achieving the goal. Apparently, two executions that both start from the same statement within the CFG with the same lockset, will not always produce the same result.
    During the second half, I worked on Deadlock Probability Enhancer (Deapen) project. Deapen is a tool that increases probability of deadlock manifestation in multithreaded programs without changing their formal semantics and requiring not perturnbation to the runtime and the testing infrastructure. It collects information about locking behavior of the target program and inteferes with thread scheduling in order to give rise to thread interleavings that are more probable to deadlock. I designed, implemented, and evaluated Deapen. Early results suggest that despite being yet inchoate, Deapen can be effective in deadlock detection. We submitted a paper on this project to WoDet 2014 (it is accepted). Prototype of Deapen is openly available at GitHub.

  • Performance Evaluation and Software Engineering Laboratory headed by Dr. Jafar Habibi
    Sharif University of Technology, Tehran, Iran (June 2011 - June 2013)
    Research Assistant under supervision of A. Shamsaei

    At the beginning, my time was devoted to study of routing, collection, and dissemination protocols in Wireless Sensor Networks (WSN). The goal of the research was to support data collection and over-the-air programming in WSNs that run different set of applications and keep traffic of each set chiefly within the set. I designed and implemented a protocol (ERMulE) that works similar to CTP Noe protocol in data collection and similar to Deluge protocol in dissemination of binary images within each set of nodes running same application. However, it occasionally uses nodes out of the set when beneficial by caching packets or using them as intermediate hops.

  • Member of Sharif Theory Group under supervision of Dr. Zarrabi-Zadeh
    Sharif University of Technology, Tehran, Iran (Oct. 2012 - Feb. 2013)
    Studying approximation and randomized algorithms

    Constituted of motivated students, this group studies approximation and randomized algorithms based on two famous books in the field: The Design of Approximation Algorithms (by David P. Williamson, David B. Shmoys) and Randomized Algorithms (by Rajeev Motwani, Prabhakar Raghavan). In the group's weekly meetings, members present chapters of the books in turn-based fashion. Members also pick open questions in the field and collaboratively try to solve them.


  • Ranked 2nd in terms of cumulative GPA among Computer Hardware Engineering students, 2010 beginners, Sharif University of Technology, 2013
  • Awarded Summer@EPFL scholarship from Dependable Systems Laboratory (DSLab) at Ecole Polytechnique Federale de Lausanne (EPFL), summer 2013
  • Ranked 4th in terms of cumulative GPA among all Computer Engineering students – including Software, Hardware and Information Technology majors, 2010 beginners, Sharif University of Technology, 2012
  • Finalist in Bayan Programming Contest among more than 2000 skilled contestants, Sep. 2011.
  • Recognized as a Scientific Elite and recipient of the grant for undergraduate studies from the Iranian National Elites Foundation for outstanding academic success, 2010 - present
  • Top 0.3% student of the nationwide entrance exam of Iranian Universities among over 400,000 participants, June 2010
  • Silver Medal in the Iranian National Olympiad in Informatics (INOI), March 2009