51 search results - page 3 / 11 » Constraint Graph Analysis of Multithreaded Programs |
PLDI
2004
ACM
13 years 11 months ago
2004
ACM
Many program analyses can be reduced to graph reachability problems involving a limited form of context-free language reachability called Dyck-CFL reachability. We show a new redu...
OOPSLA
2001
Springer
13 years 10 months ago
2001
Springer
The goal of points-to analysis for Java is to determine the set of objects pointed to by a reference variable or a reference object field. This information has a wide variety of ...
CC
2012
Springer
12 years 1 months ago
2012
Springer
Pointer analysis is one of the most important static analyses during compilation. While several enhancements have been made to scale pointer analysis, the work on parallelizing the...
IRAL
2000
ACM
13 years 9 months ago
2000
ACM
We propose a method to create process flow graphs automatically from textbooks for cooking programs. This is realized by understanding context by narrowing down the domain to cook...
CORR
2011
Springer
12 years 9 months ago
2011
Springer
We present an approximation scheme for optimizing certain Quadratic Integer Programming problems with positive semidefinite objective functions and global linear constraints. Thi...