4281 search results - page 660 / 857 » How to Disembed a Program |
128
Voted
TACAS
2010
Springer
15 years 9 months ago
2010
Springer
Ranking function synthesis is a key aspect to the success of modern termination provers for imperative programs. While it is wellknown how to generate linear ranking functions for ...
103
Voted
PPPJ
2009
ACM
15 years 9 months ago
2009
ACM
Dynamic object reclassification allows changes to the type of an object at runtime. This paper makes the case for object evolution, a restriction of general reclassification by ...
116
Voted
IISWC
2009
IEEE
15 years 9 months ago
2009
IEEE
Abstract—Dynamic runtimes can simplify parallel programming by automatically managing concurrency and locality without further burdening the programmer. Nevertheless, implementin...
110
Voted
LICS
2009
IEEE
15 years 9 months ago
2009
IEEE
We show how to reason about “step-indexed” logitions in an abstract way, avoiding the tedious, error-prone, and proof-obscuring step-index arithmetic that seems superficially...
119
Voted
CIE
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. We prove a uniformly computable version of de Finetti’s theorem on exchangeable sequences of real random variables. In the process, we develop machinery for computably ...