Sciweavers

7 search results - page 2 / 2
» Program Slicing via FermaT Transformations
Sort
View
SLP
1997
89views more  SLP 1997»
13 years 8 months ago
Program Analysis via Graph Reachability
This paper describes how a number of program-analysis problems can be solved by transforming them to graph-reachability problems. Some of the program-analysis problems that are am...
Thomas W. Reps
POPL
2009
ACM
14 years 2 months ago
Declarative aspects of memory management in the concurrent collections parallel programming model
Concurrent Collections (CnC)[8] is a declarative parallel language that allows the application developer to express their parallel application as a collection of high-level comput...
Zoran Budimlic, Aparna Chandramowlishwaran, Kathle...