150 search results - page 6 / 30 » A Calculus for Relaxed Memory |
108
click to vote
ESOP
2010
Springer
15 years 8 months ago
2010
Springer
Formal reasoning about concurrent programs is usually done with the assumption that the underlying memory model is sequentially consistent, i.e. the execution outcome is equivalen...
ECCV
2010
Springer
15 years 3 months ago
2010
Springer
Convex relaxations for continuous multilabel problems have attracted a lot of interest recently [1–5]. Unfortunately, in previous methods, the runtime and memory requirements sca...
SPAA
2003
ACM
15 years 3 months ago
2003
ACM
Previous implementations of out-of-core columnsort limit the problem size to N ≤ (M/P)3/2, where N is the number of records to sort, P is the number of processors, and M is the ...
SAS
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. The capability calculus is a framework for statically reasoning about program resources such as deallocatable memory regions. Fractional capabilities, originally proposed...
137
click to vote
FIDJI
2004
Springer
15 years 3 months ago
2004
Springer
We present a calculus for establishing non-interference of several Java threads running in parallel. The proof system is built atop an implemented sequential Java Dynamic Logic cal...