University of Minnesota
Software Engineering Center
/

You are here

Hung T. Pham

Education: 
  • PhD in Computer Science, University of Minnesota, 03/2014.
  • MS in Computer Science, University of Minnesota, 2012.
  • BS in Information Technology, Vietnam National University, Hanoi, 2008.
Biography: 
Hung Pham was a PhD student in computer science at the University of Minnesota. His research interests are in software verification methods and their applications in real-world software development processes.

Recent Publications

Test Case Generation for Adequacy of Floating-point to Fixed-point Conversion

Porting an application written for personal computer to embedded devices requires conversion of floating-point numbers and operations into fixed-point ones. Testing the conversion hence requires the latter be as close as possible to the former. The closeness is orthogonal to code coverage and requires different strategies to generate a test suite that reveals the gap between the two functions. We introduce a new test adequacy criterion and propose several metrics to quantify the closeness of two functions.

Analyzing RBAC Security Policy of Implementation Using AST

Security policy is a critical property in software applications which require high levels of safety and security. It has to be clearly specified in requirement documents and its implementation must be conformed to the specification. In this paper, we propose an approach to check if the implementation is in accordance with its security policy specification. We use the Abstract Syntax Tree (AST), another manner of expressing the program, to analyze the source code and specify user permission policy in software systems by Role-Based Access Control (RBAC).

A Fast Algorithm to Compute Heap Memory Bounds of Java Card Applets

In this paper, we present an approach to find upper bounds of heap space for Java Card applets. Our method first transforms an input bytecode stream into a control flow graph (CFG), and then collapses cycles of the CFG to produce a directed acyclic graph (DAG). Based on the DAG, we propose a linear-time algorithm to solve the problem of finding the single-source largest path in it. We also have implemented a prototype tool, tested it on several sample applications, and then compared the bounds found by our tool with the actual heap bounds of the programs.

Pages