1445 search results - page 129 / 289 » Uniformly Hard Languages |
136
click to vote
PPOPP
2005
ACM
15 years 9 months ago
2005
ACM
In this paper, we develop a new language construct to address one of the pitfalls of parallel programming: precise handling of events across parallel components. The construct, te...
139
click to vote
PLDI
2003
ACM
15 years 9 months ago
2003
ACM
As more complex DSP algorithms are realized in practice, an increasing need for high-level stream abstractions that can be compiled without sacrificing efficiency. Toward this en...
141
click to vote
ACMSE
2009
ACM
15 years 7 months ago
2009
ACM
Most recent graphics courses are what we would call topdown courses. Courses that focus on using graphical packages to implement and teach graphics. The course discussed in this p...
257
click to vote
POPL
2009
ACM
16 years 4 months ago
2009
ACM
Garbage collectors are notoriously hard to verify, due to their lowlevel interaction with the underlying system and the general difficulty in reasoning about reachability in graph...
148
Voted
ICWS
2009
IEEE
16 years 1 months ago
2009
IEEE
Professional mashups that include complex choreographies, data mediation, and result publishing within Web pages are still affected by implementation and design practices that rel...