Sciweavers

138 search results - page 19 / 28
» Issues of the Automatic Generation of HPF Loop Programs
Sort
View
ESOP
2006
Springer
13 years 11 months ago
Inference of User-Defined Type Qualifiers and Qualifier Rules
Abstract. In previous work, we described a new approach to supporting userdefined type qualifiers, which augment existing types to specify and check additional properties of intere...
Brian Chin, Shane Markstrum, Todd D. Millstein, Je...
CASES
2007
ACM
13 years 11 months ago
SCCP/x: a compilation profile to support testing and verification of optimized code
Embedded systems are often used in safety-critical environments. Thus, thorough testing of them is mandatory. A quite active research area is the automatic test-case generation fo...
Raimund Kirner
IPPS
2000
IEEE
13 years 11 months ago
Augmenting Modern Superscalar Architectures with Configurable Extended Instructions
The instruction sets of general-purpose microprocessors are designed to offer good performance across a wide range of programs. The size and complexity of the instruction sets, how...
Xianfeng Zhou, Margaret Martonosi
PEPM
1993
ACM
13 years 11 months ago
Binding-Time Analysis and the Taming of C Pointers
The aim of binding-time analysis is to determine when variables, expressions, statements, etc. in a program can be evaluated by classifying these into static (compile-time) and dy...
Lars Ole Andersen
CHI
2010
ACM
14 years 15 days ago
FrameWire: a tool for automatically extracting interaction logic from paper prototyping tests
Paper prototyping offers unique affordances for interface design. However, due to its spontaneous nature and the limitations of paper, it is difficult to distill and communicate a...
Yang Li, Xiang Cao, Katherine Everitt, Morgan Dixo...