164 search results - page 26 / 33 » A Decidable Fragment of Separation Logic |
MST
2006
13 years 7 months ago
2006
We consider the transition graphs of regular ground tree (or term) rewriting systems. The vertex set of such a graph is a (possibly infinite) set of trees. Thus, with a finite tree...
LICS
2010
IEEE
13 years 6 months ago
2010
IEEE
We define tree automata with global constraints (TAGC), generalizing the well-known class of tree automata with global equality and disequality constraints [14] (TAGED). TAGC can...
IAT
2006
IEEE
14 years 1 months ago
2006
IEEE
In this paper, we tackle learning in distributed systems and the fact that learning does not necessarily involve the participation of agents directly in the inductive process itse...
WWW
2007
ACM
14 years 8 months ago
2007
ACM
XACML has emerged as a popular access control language on the Web, but because of its rich expressiveness, it has proved difficult to analyze in an automated fashion. In this pape...
POPL
2006
ACM
14 years 8 months ago
2006
ACM
We define a type system, which may also be considered as a simple Hoare logic, for a fragment of an assembly language that deals with code pointers and jumps. The typing is aimed ...