SAS
2001
Springer
13 years 12 months ago
2001
Springer
SAS
2001
Springer
13 years 12 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 12 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 12 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 12 months ago
2001
Springer
SAS
2001
Springer
13 years 12 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 12 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...
MMMACNS
2001
Springer
13 years 12 months ago
2001
Springer
The history of the application of formal methods to cryptographic protocol analysis spans nearly twenty years, and recently has been showing signs of new maturity and consolidatio...
IFL
2001
Springer
13 years 12 months ago
2001
Springer
Map- and fold-like skeletons are a suitable abstractions to guide parallel program execution in functional array processing. However, when it comes to achieving high performance, i...
IFL
2001
Springer
13 years 12 months ago
2001
Springer
Abstract. J. Launchbury gave an operational semantics for lazy evaluation and showed that it is sound and complete w.r.t. a denotational s of the language. P. Sestoft then introduc...