Sciweavers

68 search results - page 3 / 14
» Applying Static Analysis Techniques for Inferring Terminatio...
Sort
View
ESOP
2005
Springer
13 years 11 months ago
Determinacy Inference for Logic Programs
This paper presents a determinacy inference analysis for logic programs. The analysis infers determinacy conditions that, if satisfied by a call, ensures that it computes at most ...
Lunjin Lu, Andy King
FM
2009
Springer
92views Formal Methods» more  FM 2009»
14 years 9 days ago
Field-Sensitive Value Analysis by Field-Insensitive Analysis
Shared and mutable data-structures pose major problems in static analysis and most analyzers are unable to keep track of the values of numeric variables stored in the heap. In this...
Elvira Albert, Puri Arenas, Samir Genaim, Germ&aac...
WFLP
2009
Springer
239views Algorithms» more  WFLP 2009»
14 years 10 days ago
Fast and Accurate Strong Termination Analysis with an Application to Partial Evaluation
A logic program strongly terminates if it terminates for any selection rule. Clearly, considering a particular selection rule—like Prolog’s leftmost selection rule—allows one...
Michael Leuschel, Salvador Tamarit, Germán ...
PASTE
2004
ACM
13 years 11 months ago
Resolving and applying constraint queries on context-sensitive analyses
A context-sensitive analysis is an analysis in which program elements are assigned sets of properties that depend upon the context in which they occur. For analyses on imperative ...
James Ezick
SAC
2010
ACM
14 years 17 days ago
Dual analysis for proving safety and finding bugs
Program bugs remain a major challenge for software developers and various tools have been proposed to help with their localization and elimination. Most present-day tools are base...
Corneliu Popeea, Wei-Ngan Chin