Sciweavers

4716 search results - page 38 / 944
» Iterative-free program analysis
Sort
View
POPL
2008
ACM
14 years 10 months ago
Relevance heuristics for program analysis
Relevance heuristics allow us to tailor a program analysis to a particular property to be verified. This in turn makes it possible to improve the precision of the analysis where n...
Kenneth L. McMillan
PLDI
2010
ACM
14 years 2 months ago
Resolving and exploiting the k-CFA paradox: illuminating functional vs. object-oriented program analysis
Low-level program analysis is a fundamental problem, taking the shape of “flow analysis” in functional languages and “points-to” analysis in imperative and object-oriente...
Matthew Might, Yannis Smaragdakis, David Van Horn
ICLP
2005
Springer
14 years 3 months ago
Nondeterminism Analysis of Functional Logic Programs
Abstract. Information about the nondeterminism behavior of a functional logic program is important for various reasons. For instance, a nondeterministic choice in I/O operations re...
Bernd Braßel, Michael Hanus
CAV
2007
Springer
112views Hardware» more  CAV 2007»
14 years 3 months ago
Context-Bounded Analysis of Multithreaded Programs with Dynamic Linked Structures
Bounded context switch reachability analysis is a useful and efficient approach for detecting bugs in multithreaded programs. In this paper, we address the application of this app...
Ahmed Bouajjani, Séverine Fratani, Shaz Qad...
IWMM
2009
Springer
122views Hardware» more  IWMM 2009»
14 years 4 months ago
Parametric heap usage analysis for functional programs
This paper presents an analysis that derives a formula describing the worst-case live heap space usage of programs in a functional language with automated memory management (garba...
Leena Unnikrishnan, Scott D. Stoller