SAS
2001
Springer
13 years 9 months ago
2001
Springer
Abstract. The field of program analysis has focused primarily on sequential programming languages. But multithreading is becoming increasingly important, both as a program structu...
SAS
2001
Springer
13 years 9 months ago
2001
Springer
SAS
2001
Springer
13 years 9 months ago
2001
Springer
Model checking would answer all finite-state verification problems, if it were not for the notorious state-space explosion problem. A problem of practical importance, which attra...
SAS
2001
Springer
13 years 9 months ago
2001
Springer
SAS
2001
Springer
13 years 9 months ago
2001
Springer
We present the implementation of cTI, a system for universal left-termination inference of logic programs, which heavily relies on static analysis techniques. Termination inference...
SAS
2001
Springer
13 years 9 months ago
2001
Springer
This paper describes the precise speci cation, design, analysis, implementation, and measurements of an e cient algorithm for solving regular tree grammar based constraints. The p...
SAS
2001
Springer
13 years 9 months ago
2001
Springer
Programs often have a lot of duplicated code, which makes both understanding and maintenance more difficult. This problem can be alleviated by detecting duplicated code, extracting...
SAS
2001
Springer
13 years 9 months ago
2001
Springer
SAS
2001
Springer
13 years 9 months ago
2001
Springer
Abstract. Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the omission of t...
SAS
2001
Springer
13 years 9 months ago
2001
Springer
This paper addresses the following question: Do scalable control-flow-insensitive pointer analyses provide the level of precision required to make them useful in compiler optimiza...