562 search results - page 91 / 113 » Concurrent Turing Machines |
133
Voted
EUROSYS
2009
ACM
16 years 19 days ago
2009
ACM
Memory transactions, similar to database transactions, allow a programmer to focus on the logic of their program and let the system ensure that transactions are atomic and isolate...
141
Voted
VEE
2005
ACM
15 years 9 months ago
2005
ACM
Modern transactional response-time sensitive applications have run into practical limits on the size of garbage collected heaps. The heap can only grow until GC pauses exceed the ...
166
Voted
GSEM
2004
Springer
15 years 9 months ago
2004
Springer
Occam is a parallel processing language designed by a team at INMOS in conjunction with the design of the transputer processor, and based on Sir T. Hoare's ideas of Communica...
144
Voted
JCSS
2008
15 years 3 months ago
2008
Given a Boolean function f, we study two natural generalizations of the certificate complexity C (f): the randomized certificate complexity RC (f) and the quantum certificate comp...
117
Voted
SIGSOFT
2009
ACM
16 years 4 months ago
2009
ACM
A program is reentrant if distinct executions of that program on distinct inputs cannot affect each other. Reentrant programs have the desirable property that they can be deployed...