448 search results - page 52 / 90 » Dynamic Algorithms for the Dyck Languages |
SIGSOFT
2005
ACM
15 years 10 months ago
2005
ACM
We develop a method for matching dynamic histories of program executions of two program versions. The matches produced can be useful in many applications including software piracy...
ECOOP
2000
Springer
15 years 2 months ago
2000
Springer
The support for precise exceptions in Java, combined with frequent checks for runtime exceptions, leads to severe limitations on the compiler’s ability to perform program optimiz...
ESOP
2005
Springer
15 years 3 months ago
2005
Springer
Program slicing is a well-known methodology that aims at identifying the program statements that (potentially) affect the values computed at some point of interest. Within imperat...
ASPLOS
2008
ACM
14 years 11 months ago
2008
ACM
Many code analysis techniques for optimization, debugging, or parallelization need to perform runtime disambiguation of sets of addresses. Such operations can be supported efficie...
IWMM
2004
Springer
15 years 3 months ago
2004
Springer
We document the design and implementation of a “production” incremental garbage collector for GHC 6.2. It builds on our earlier work (Non-stop Haskell) that exploited GHC’s ...