Sciweavers

4940 search results - page 278 / 988
» On the Complexity of Universal Programs
Sort
View
ICSE
2007
IEEE-ACM
16 years 6 months ago
Adaptive Online Program Analysis
Analyzing a program run can provide important insights about its correctness. Dynamic analysis of complex correctness properties, however, usually results in significant run-time ...
Matthew B. Dwyer, Alex Kinneer, Sebastian G. Elbau...
IPPS
2009
IEEE
16 years 1 months ago
A cross-input adaptive framework for GPU program optimizations
Abstract—Recent years have seen a trend in using graphic processing units (GPU) as accelerators for general-purpose computing. The inexpensive, single-chip, massively parallel ar...
Yixun Liu, Eddy Z. Zhang, Xipeng Shen
IPPS
2008
IEEE
16 years 1 months ago
Parallel performance wizard: A performance analysis tool for partitioned global-address-space programming
Given the complexity of parallel programs, developers often must rely on performance analysis tools to help them improve the performance of their code. While many tools support th...
Hung-Hsun Su, Max Billingsley, Alan D. George
IPSN
2005
Springer
16 years 3 days ago
Beyond event handlers: programming wireless sensors with attributed state machines
— Event-driven programming is a popular paradigm for programming sensor nodes. It is based on the specification of actions (also known as event handlers) which are triggered by ...
Oliver Kasten, Kay Römer
IWPC
2002
IEEE
15 years 11 months ago
Building Program Understanding Tools Using Visitor Combinators
Program understanding tools manipulate program represensuch as abstract syntax trees, control-flow graphs, or data-flow graphs. This paper deals with the use of visitor combinat...
Arie van Deursen, Joost Visser