1494 search results - page 139 / 299 » Less Extreme Programming |
125
click to vote
ESOP
2004
Springer
15 years 8 months ago
2004
Springer
t) Peter W. O’Hearn Queen Mary, University of London In the 1960s Dijkstra suggested that, in order to limit the complexity of potential process interactions, concurrent programs...
125
click to vote
CPHYSICS
2007
15 years 2 months ago
2007
During the last decade, several quantum information protocols, such as quantum key distribution, teleportation or quantum computation, have attracted a lot of interest. Despite th...
130
Voted
PLDI
2011
ACM
14 years 5 months ago
2011
ACM
The most intuitive memory consistency model for shared-memory multi-threaded programming is sequential consistency (SC). However, current concurrent programming languages support ...
115
click to vote
GPCE
2007
Springer
15 years 9 months ago
2007
Springer
Multiple dispatch – the selection of a function to be invoked based on the dynamic type of two or more arguments – is a solution to several classical problems in object-orient...
149
click to vote
DSN
2006
IEEE
15 years 6 months ago
2006
IEEE
In this paper, we propose a novel technique to detect all dangling pointer uses at run-time that is efficient enough for production use in server codes. One idea (previously used ...