756 search results - page 106 / 152 » Using Logic Programs to Reason about Infinite Sets |
188
click to vote
FUIN
2007
15 years 3 months ago
2007
Abstract. Consider an agent executing a plan with nondeterministic actions, in a dynamic environment, which might fail. Suppose that she is given a description of this action domai...
129
click to vote
NFM
2011
14 years 10 months ago
2011
Program verifiers based on first-order theorem provers model the program heap as a collection of mutable maps. In such verifiers, preserving unmodified facts about the heap acr...
167
click to vote
FLOPS
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. This paper describes how high level implementations of (needed) narrowing into Prolog can be improved by analysing definitional trees. First, we introduce a refined repre...
128
click to vote
ICECCS
2007
IEEE
15 years 7 months ago
2007
IEEE
In recent years, separation logic has emerged as a contender for formal reasoning of heap-manipulating imperative programs. Recent works have focused on specialised provers that a...
107
click to vote
SAC
2008
ACM
15 years 2 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...