590 search results - page 47 / 118 » Non-Failure Analysis for Logic Programs |
SAC
2008
ACM
13 years 8 months ago
2008
ACM
se a new abstraction for pointer analysis that represents reads and writes to memory instead of traditional points-to relations. Compared to points-to graphs, our Assign-Fetch Gra...
CCS
2005
ACM
14 years 2 months ago
2005
ACM
We study formal security properties of network-attached storage (NAS) in an applied pi calculus. We model NAS as an implementation of a specification based on traditional central...
FOSSACS
2009
Springer
14 years 3 months ago
2009
Springer
Standard analysis on recursive data structures restrict their attention to shape properties (for instance, a program that manipulates a list returns a list), excluding properties t...
IWMM
2009
Springer
14 years 3 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
14 years 2 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...