328 search results - page 25 / 66 » Simple Termination Revisited |
JACM
2006
13 years 7 months ago
2006
We revisit the problem of conveying classical messages by transmitting quantum states, and derive new, optimal bounds on the number of quantum bits required for this task. Much of...
COGSR
2011
13 years 2 months ago
2011
Experiments on visual search have demonstrated the existence of a relatively large and reliable memory for which objects have been fixated; an indication of this memory is that re...
ICALP
2009
Springer
14 years 7 months ago
2009
Springer
Abstract. We describe a simple, conceptual forward analysis procedure for complete WSTS S. This computes the clover of a state s0, i.e., a finite description of the closure of the ...
VMCAI
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. In this paper we analyze the complexity of checking safety and termination properties, for a very simple, yet non-trivial, class of programs with singly-linked list data ...
CSL
2004
Springer
13 years 11 months ago
2004
Springer
We consider a scenario where (functional) programs in pre-compiled form are exchanged among untrusted parties. Our contribution is a system of annotations for the code that can be ...