172 search results - page 27 / 35 » Automatic Termination Analysis of Logic Programs |
IWMM
2009
Springer
15 years 4 months ago
2009
Springer
The peak heap consumption of a program is the maximum size of the live data on the heap during the execution of the program, i.e., the minimum amount of heap space needed to run t...
PLDI
2006
ACM
15 years 3 months ago
2006
ACM
Type systems for secure information flow are useful for efficiently checking that programs have secure information flow. They are, however, conservative, so that they often rej...
107
click to vote
OOPSLA
2007
Springer
15 years 3 months ago
2007
Springer
Java bug finders perform static analysis to find implementation mistakes that can lead to exploits and failures; Java compilers perform static analysis for optimization. If Java...
PPDP
2009
Springer
15 years 4 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...
PLDI
2003
ACM
15 years 2 months ago
2003
ACM
In prior work [15] we studied a language construct restrict that allows programmers to specify that certain pointers are not aliased to other pointers used within a lexical scope....