Sciweavers

203 search results - page 13 / 41
» How Program History Can Improve Code Completion
Sort
View
IWPC
2006
IEEE
15 years 3 months ago
Dynamic Data Structure Analysis for Java Programs
Analysis of dynamic data structure usage is useful for both program understanding and for improving the accuracy of other program analyses. Static analysis techniques, however, su...
Sokhom Pheng, Clark Verbrugge
ICFP
2004
ACM
15 years 9 months ago
Scrap more boilerplate: reflection, zips, and generalised casts
Writing boilerplate code is a royal pain. Generic programming promises to alleviate this pain by allowing the programmer to write a generic "recipe" for boilerplate code...
Ralf Lämmel, Simon L. Peyton Jones
90
Voted
SPDP
1993
IEEE
15 years 1 months ago
Architectural Support for Block Transfers in a Shared-Memory Multiprocessor
This paper examines how the performance of a shared-memory multiprocessor can be improved by including hardware support for block transfers. A system similar to the Hector multipr...
Steven J. E. Wilton, Zvonko G. Vranesic
84
Voted
PPPJ
2003
ACM
15 years 2 months ago
A stochastic approach to automated design improvement
The object-oriented approach to software development facilitates and encourages programming practices that increase reusability, correctness and maintainability in code. This is a...
Mark Kent O'Keeffe, Mel Ó Cinnéide
ICPP
1998
IEEE
15 years 1 months ago
Concurrent SSA Form in the Presence of Mutual Exclusion
Most current compiler analysis techniques are unable to cope with the semantics introduced by explicit parallel and synchronization constructs in parallel programs. In this paper ...
Diego Novillo, Ronald C. Unrau, Jonathan Schaeffer