M
Mayur Naik
Researcher at University of Pennsylvania
Publications - 93
Citations - 7980
Mayur Naik is an academic researcher from University of Pennsylvania. The author has contributed to research in topics: Program analysis & Computer science. The author has an hindex of 32, co-authored 80 publications receiving 7203 citations. Previous affiliations of Mayur Naik include Georgia Institute of Technology & Intel.
Papers
More filters
Proceedings ArticleDOI
CloneCloud: elastic execution between mobile device and cloud
TL;DR: The design and implementation of CloneCloud is presented, a system that automatically transforms mobile applications to benefit from the cloud that enables unmodified mobile applications running in an application-level virtual machine to seamlessly off-load part of their execution from mobile devices onto device clones operating in a computational cloud.
Journal ArticleDOI
Scalable statistical bug isolation
TL;DR: A statistical debugging algorithm that isolates bugs in programs containing multiple undiagnosed bugs and identifies predictors that are associated with individual bugs that reveal both the circumstances under which bugs occur as well as the frequencies of failure modes, making it easier to prioritize debugging efforts.
Proceedings ArticleDOI
Dynodroid: an input generation system for Android apps
TL;DR: Dynodroid views an app as an event-driven program that interacts with its environment by means of a sequence of events through the Android framework, and monitors the reaction of an app upon each event in a lightweight manner, using it to guide the generation of the next event to the app.
Book
Effective static race detection for Java
TL;DR: A novel technique for static race detection in Java programs, comprised of a series of stages that employ a combination of static analyses to successively reduce the pairs of memory accesses potentially involved in a race.
Proceedings ArticleDOI
Automated concolic testing of smartphone apps
TL;DR: The approach is based on concolic testing and generates sequences of events automatically and systematically and alleviates the path-explosion problem by checking a condition on program executions that identifies subsumption between different event sequences.