Sciweavers

1760 search results - page 20 / 352
» A System to Mark Programs Automatically
Sort
View
IWPC
1999
IEEE
14 years 1 months ago
The SPARAMAT Approach to Automatic Comprehension of Sparse Matrix Computations
Automatic program comprehension is particularly useful when applied to sparse matrix codes, since it allows to abstract e.g. from specific sparse matrix storage formats used in th...
Christoph W. Keßler, Craig Smith
CORR
2000
Springer
103views Education» more  CORR 2000»
13 years 8 months ago
Automatic Termination Analysis of Programs Containing Arithmetic Predicates
For logic programs with arithmetic predicates, showing termination is not easy, since the usual order for the integers is not well-founded. A new method, easily incorporated in th...
Nachum Dershowitz, Naomi Lindenstrauss, Yehoshua S...
KBSE
2005
IEEE
14 years 2 months ago
Timna: a framework for automatically combining aspect mining analyses
To realize the benefits of Aspect Oriented Programming (AOP), developers must refactor active and legacy code bases into an AOP language. When refactoring, developers first need...
David Shepherd, Jeffrey Palm, Lori L. Pollock, Mar...
ICS
2007
Tsinghua U.
14 years 3 months ago
Automatic nonblocking communication for partitioned global address space programs
Overlapping communication with computation is an important optimization on current cluster architectures; its importance is likely to increase as the doubling of processing power ...
Wei-Yu Chen, Dan Bonachea, Costin Iancu, Katherine...
CORR
2000
Springer
138views Education» more  CORR 2000»
13 years 8 months ago
Towards rule-based visual programming of generic visual systems
This paper illustrates how the diagram programming language DIAPLAN can be used to program visual systems. DIAPLAN is a visual rulebased language that is founded on the computation...
Berthold Hoffmann, Mark Minas