Open Access. Powered by Scholars. Published by Universities.®

Computer Engineering Commons

Open Access. Powered by Scholars. Published by Universities.®

Computer Science and Engineering: Theses, Dissertations, and Student Research

Computer Sciences

Program analysis

Publication Year

Articles 1 - 2 of 2

Full-Text Articles in Computer Engineering

Gaindroid: General Automated Incompatibility Notifier For Android Applications, Bruno Vieira Resende E Silva Apr 2019

Gaindroid: General Automated Incompatibility Notifier For Android Applications, Bruno Vieira Resende E Silva

Computer Science and Engineering: Theses, Dissertations, and Student Research

With the ever-increasing popularity of mobile devices over the last decade, mobile apps and the frameworks upon which they are built frequently change. This rapid evolution leads to a confusing jumble of devices and applications utilizing differing features even within the same framework. For Android apps and devices, representing over 80% of the market share, mismatches between the version of the Android operating system installed on a device and the version of the app installed, can lead to several run-time crashes, providing a poor user experience.

This thesis presents GAINDroid, an analysis approach, backed with a classloader based program analyzer ...


Solving The Search For Source Code, Kathryn T. Stolee Aug 2013

Solving The Search For Source Code, Kathryn T. Stolee

Computer Science and Engineering: Theses, Dissertations, and Student Research

Programmers frequently search for source code to reuse using keyword searches. When effective and efficient, a code search can boost programmer productivity, however, the search effectiveness depends on the programmer's ability to specify a query that captures how the desired code may have been implemented. Further, the results often include many irrelevant matches that must be filtered manually. More semantic search approaches could address these limitations, yet existing approaches either do not scale, are not flexible enough to find approximate matches, or require complex specifications.

We propose a novel approach to semantic search that addresses some of these limitations ...