150 search results - page 27 / 30 » Counting Results in Weak Formalisms |
SIROCCO
2003
13 years 10 months ago
2003
In this work, we embark on a study of the possibility (or impossibility), and the corresponding costs, of devising concurrent, low-contention implementations of atomic Read-Modify...
CONCUR
2010
Springer
13 years 10 months ago
2010
Springer
Boolean notions of correctness are formalized by preorders on systems. Quantitative measures of correctness can be formalized by realvalued distance functions between systems, wher...
PVLDB
2010
13 years 7 months ago
2010
Ontology-based data access is a powerful form of extending database technology, where a classical extensional database (EDB) is enhanced by an ontology that generates new intensio...
POPL
2010
ACM
14 years 6 months ago
2010
ACM
The method of logical relations is a classic technique for proving the equivalence of higher-order programs that implement the same observable behavior but employ different intern...
IPPS
2008
IEEE
14 years 3 months ago
2008
IEEE
Buffered crossbar switches are a special type of combined input-output queued switches with each crosspoint of the crossbar having small on-chip buffers. The introduction of cross...