2137 search results - page 318 / 428 » Proving Abstract Non-interference |
129
click to vote
STACS
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. The dynamic page migration problem [4] is defined in a distributed network of n mobile nodes sharing one indivisible memory page of size D. During runtime, the nodes can...
92
Voted
TACAS
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. The automatic synthesis of programs from their specifications has been a dream of many researchers for decades. If we restrict to open finite-state reactive systems, th...
158
click to vote
TGC
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. In the age of the world-wide web and mobile computing, programming communication-centric software is essential. Thus, programmers and program designers are exposed to new...
107
click to vote
UC
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. We study computational complexity of counting the fixed point configurations (FPs) in certain classes of graph automata viewed as discrete dynamical systems. We prove t...
106
click to vote
WDAG
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. The vast majority of papers on distributed computing assume that processes are assigned unique identifiers before computation begins. But is this assumption necessary? W...