54 search results - page 10 / 11 » Transformation to Dynamic Single Assignment Using a Simple D... |
SIGSOFT
2007
ACM
14 years 8 months ago
2007
ACM
Asynchronous systems components are hard to write, hard to reason about, and (not coincidentally) hard to mechanically verify. In order to achieve high performance, asynchronous c...
BMCBI
2010
13 years 7 months ago
2010
Background: Several tools have been developed to explore and search Gene Ontology (GO) databases allowing efficient GO enrichment analysis and GO tree visualization. Nevertheless,...
POPL
2010
ACM
14 years 5 months ago
2010
ACM
We describe a new automatic static analysis for determining upper-bound functions on the use of quantitative resources for strict, higher-order, polymorphic, recursive programs de...
POPL
1994
ACM
13 years 11 months ago
1994
ACM
An important implementation decision in polymorphically typed functional programming languages is whether to represent data in boxed or unboxed form and when to transform them fro...
INFOCOM
2010
IEEE
13 years 6 months ago
2010
IEEE
—There exists a certain level of ambiguity regarding whether network coding can further improve download performance in P2P content distribution systems, as compared to commonly ...