Sciweavers

SAS
2001
Springer
116views Formal Methods» more  SAS 2001»
14 years 5 months ago
Applying Static Analysis Techniques for Inferring Termination Conditions of Logic Programs
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...
Frédéric Mesnard, Ulrich Neumerkel
SAS
2001
Springer
14 years 5 months ago
Solving Regular Tree Grammar Based Constraints
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...
Yanhong A. Liu, Ning Li, Scott D. Stoller
SAS
2001
Springer
14 years 5 months ago
Using Slicing to Identify Duplication in Source Code
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...
Raghavan Komondoor, Susan Horwitz
SAS
2001
Springer
117views Formal Methods» more  SAS 2001»
14 years 5 months ago
Finite-Tree Analysis for Constraint Logic-Based Languages
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...
Roberto Bagnara, Roberta Gori, Patricia M. Hill, E...
SAS
2001
Springer
166views Formal Methods» more  SAS 2001»
14 years 5 months ago
Estimating the Impact of Scalable Pointer Analysis on Optimization
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...
Manuvir Das, Ben Liblit, Manuel Fähndrich, Ja...
MMMACNS
2001
Springer
14 years 5 months ago
Open Issues in Formal Methods for Cryptographic Protocol Analysis
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...
Catherine Meadows
IFL
2001
Springer
146views Formal Methods» more  IFL 2001»
14 years 5 months ago
Optimizations on Array Skeletons in a Shared Memory Environment
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...
Clemens Grelck
IFL
2001
Springer
14 years 5 months ago
Proving the Correctness of the STG Machine
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...
Alberto de la Encina, Ricardo Pena