2736 search results - page 455 / 548 » Understanding programmer language |
129
click to vote
SIGSOFT
2007
ACM
16 years 3 months ago
2007
ACM
The standard language for describing the asymptotic behavior of algorithms is theoretical computational complexity. We propose a method for describing the asymptotic behavior of p...
137
click to vote
SIGSOFT
2006
ACM
16 years 3 months ago
2006
ACM
Fixing runtime bugs in long running programs using trace based analyses such as dynamic slicing was believed to be prohibitively expensive. In this paper, we present a novel execu...
162
Voted
PPOPP
2009
ACM
16 years 3 months ago
2009
ACM
Recent advances in polyhedral compilation technology have made it feasible to automatically transform affine sequential loop nests for tiled parallel execution on multi-core proce...
117
Voted
PPOPP
2009
ACM
16 years 3 months ago
2009
ACM
Researchers in transactional memory (TM) have proposed open nesting as a methodology for increasing the concurrency of transactional programs. The idea is to ignore "low-leve...
108
Voted
CAV
2009
Springer
16 years 3 months ago
2009
Springer
Abstract. Contract-based property checkers hold the potential for precise, scalable, and incremental reasoning. However, it is difficult to apply such checkers to large program mod...