Sciweavers

SAS
2004
Springer
239views Formal Methods» more  SAS 2004»
14 years 3 months ago
Bottom-Up and Top-Down Context-Sensitive Summary-Based Pointer Analysis
Erik M. Nystrom, Hong-Seok Kim, Wen-mei W. Hwu
SAS
2004
Springer
136views Formal Methods» more  SAS 2004»
14 years 3 months ago
Constraint-Based Linear-Relations Analysis
Abstract. Linear-relations analysis of transition systems discovers linear invariant relationships among the variables of the system. These relationships help establish important s...
Sriram Sankaranarayanan, Henny B. Sipma, Zohar Man...
SAS
2004
Springer
134views Formal Methods» more  SAS 2004»
14 years 3 months ago
Towards Declarative Programming for Web Services
ness Refinement in Abstract Symbolic Trajectory Evaluation . . . . 38 Mila Dalla Preda Constraint-Based Linear-Relations Analysis . . . . . . . . . . . . . . . . . . . . . . . . ....
Sheila A. McIlraith
SAS
2004
Springer
109views Formal Methods» more  SAS 2004»
14 years 3 months ago
Pointer-Range Analysis
Array-Range Analysis computes at compile time the range of possible index values for each array-index expression in a program. This information can be used to detect potential out-...
Suan Hsi Yong, Susan Horwitz
SAS
2004
Springer
123views Formal Methods» more  SAS 2004»
14 years 3 months ago
Non-termination Inference for Constraint Logic Programs
Termination has been a subject of intensive research in the logic programming community for the last two decades. Most works deal with proving universal left termination of a given...
Étienne Payet, Frédéric Mesna...
Formal Methods
Top of PageReset Settings