108 search results - page 15 / 22 » User-Definable Resource Bounds Analysis for Logic Programs |
IWMM
2007
Springer
14 years 26 days ago
2007
Springer
This article presents a heap space analysis for (sequential) Java bytecode. The analysis generates heap space cost relations which define at compile-time the heap consumption of ...
POPL
2012
ACM
12 years 2 months ago
2012
ACM
Interpolation is an important technique in verification and static analysis of programs. In particular, interpolants extracted from proofs of various properties are used in invar...
HOTOS
2009
IEEE
13 years 10 months ago
2009
IEEE
In this paper, we propose FLUXO, a system that separates an Internet service's logical functionality from the architectural decisions made to support performance, scalability...
PPDP
2009
Springer
14 years 1 months ago
2009
Springer
We propose a novel type-based model checking algorithm for higher-order recursion schemes. As shown by Kobayashi, verification problems of higher-order functional programs can ea...
SIGSOFT
2002
ACM
14 years 7 months ago
2002
ACM
Program slicing is a potentially useful analysis for aiding program understanding. However, slices of even small programs are often too large to be generally useful. Imprecise poi...