3825 search results - page 172 / 765 » The Language of Time: A Reader |
171
click to vote
STACS
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. It is well known that one-dimensional cellular automata working on the usual neighborhood are Turing complete, and many acceleration theorems are known. However very litt...
164
click to vote
FLOPS
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. Binding-time polymorphism enables a highly flexible bindingtime analysis for offline partial evaluation. This work provides the tools to translate this flexibility into...
124
click to vote
ATVA
2008
Springer
15 years 8 months ago
2008
Springer
Electronic inter-organizational relationships are governed by contracts regulating their interaction. It is necessary to run-time monitor the contracts, as to guarantee their fulfi...
266
click to vote
JVM
2004
15 years 7 months ago
2004
We are working on scheduling of garbage collector as a concurrent thread for time-constrained applications in Common Language Infrastructure (CLI). We have implemented an increment...
174
click to vote
ENTCS
2007
15 years 6 months ago
2007
In this paper we present our rst approach to model and verify biological systems using ntcc, a concurrent constraint process calculus. We argue that the partial information const...