Thesis Topic Details
Topic ID: |
3021 | |
Title: |
Dynamic Program Analysis for finding Data Races and Deadlocks in Concurrent Java Programs | |
Supervisor: |
Jingling Xue | |
Research Area: |
Programming Languages, Compiler | |
| Associated Staff | ||
|---|---|---|
Assessor: |
Yi Lu | |
| Topic Details | ||
Status: |
Active | |
Type: |
R & D | |
Programs: |
CS CE SE | |
Group Suitable: |
No | |
Industrial: |
No | |
Pre-requisites: |
Good knowledge about programming languages and virtual machines and good software development skills with large-scale systems | |
Description: |
Presently, a number of dynamic program analysis techniques have been proposed to detect data races in concurrent Java programs. RaceTack (http://www.cs.ucsb.edu/~htzheng/teach/cs595s06/slides/sosp05-RaceTrack.pdf) and Goldilocks (http://portal.acm.org/citation.cfm?id=1250762) are two recent representative solutions for hunting data races at run time. The aim of this project is to re-implement one of these in either IBM Jikes VM or OpenJDK VM with some improvements wherever appropriate. At the end of this project, you will have developed some insightful understanding about Java, OO, VM and multi-threaded programs and sharpened your programming skills with large-scale software systems. |
|
Comments: |
-- | |
| Past Student Reports | ||
| No Reports Available. Contact the supervisor for more information.
Check out all available reports in the CSE Thesis Report Library. NOTE: only current CSE students can login to view and select reports to download. |
||