Sciweavers

797 search results - page 106 / 160
» Eliminating Proofs from Programs
Sort
View
POPL
2011
ACM
13 years 23 days ago
The essence of compiling with traces
The technique of trace-based just-in-time compilation was introduced by Bala et al. and was further developed by Gal et al. It currently enjoys success in Mozilla Firefox’s Java...
Shu-yu Guo, Jens Palsberg
PODC
2009
ACM
14 years 7 months ago
Memory models: a case for rethinking parallel languages and hardware
The era of parallel computing for the masses is here, but writing correct parallel programs remains far more difficult than writing sequential programs. Aside from a few domains,...
Sarita V. Adve
PLDI
2009
ACM
14 years 4 months ago
Parallelizing sequential applications on commodity hardware using a low-cost software transactional memory
Multicore designs have emerged as the mainstream design paradigm for the microprocessor industry. Unfortunately, providing multiple cores does not directly translate into performa...
Mojtaba Mehrara, Jeff Hao, Po-Chun Hsu, Scott A. M...
BMCBI
2010
138views more  BMCBI 2010»
13 years 10 months ago
Sigma-2: Multiple sequence alignment of non-coding DNA via an evolutionary model
Background: While most multiple sequence alignment programs expect that all or most of their input is known to be homologous, and penalise insertions and deletions, this is not a ...
Gayathri Jayaraman, Rahul Siddharthan
TELETRAFFIC
2007
Springer
14 years 4 months ago
On the Interaction Between Internet Applications and TCP
Abstract. We focus in this paper on passive traffic measurement techniques that collect traces of TCP packets and analyze them to derive, for example, round-trip times or aggregate...
Matti Siekkinen, Guillaume Urvoy-Keller, Ernst W. ...