4940 search results - page 359 / 988 » On the Complexity of Universal Programs |
144
Voted
EDBT
2009
ACM
16 years 1 months ago
2009
ACM
A runtime approach to model-generic translation of schema and data is proposed. It is based on our previous work on MIDST, a platform conceived to perform translations in an off-...
169
click to vote
ICALP
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. We introduce a new theoretical model of ad hoc mobile computing in which agents have severely restricted memory, highly unpredictable movement and no initial knowledge of...
137
click to vote
TACAS
2009
Springer
16 years 1 months ago
2009
Springer
ional Predicate Abstraction from Game Semantics Adam Bakewell and Dan R. Ghica University of Birmingham, U.K. We introduce a technique for using conventional predicate abstraction ...
175
click to vote
CONCUR
2007
Springer
16 years 27 days ago
2007
Springer
Abstract. Reactive Systems `a la Leifer and Milner allow to derive from a reaction semantics definition an LTS equipped with a bisimilarity relation which is a congruence. This th...
183
click to vote
ICALP
2007
Springer
16 years 26 days ago
2007
Springer
Motivated by the challenging task of designing “secure” vote storage mechanisms, we study information storage mechanisms that operate in extremely hostile environments. In suc...