Sciweavers

375 search results - page 20 / 75
» Making Abstract Machines Less Abstract
Sort
View
OOPSLA
2009
Springer
15 years 4 months ago
A concurrent dynamic analysis framework for multicore hardware
Software has spent the bounty of Moore’s law by solving harder problems and exploiting abstractions, such as highlevel languages, virtual machine technology, binary rewritdynami...
Jungwoo Ha, Matthew Arnold, Stephen M. Blackburn, ...
68
Voted
DAC
1999
ACM
15 years 11 months ago
Constraint Driven Code Selection for Fixed-Point DSPs
Abstract? Fixed-point DSPs are a class of embedded processors with highly irregular architectures. This irregularity makes it difficult to generate high-quality machine code from p...
Steven Bashford, Rainer Leupers
ICCL
1992
IEEE
15 years 2 months ago
An automatically generated and provably correct compiler for a subset of Ada
We describe the automatic generation of a provably correct compiler for a non-trivial subset of Ada. The compiler is generated from an emantic description; it emits absolute code ...
Jens Palsberg
ECML
2007
Springer
15 years 2 months ago
Seeing the Forest Through the Trees: Learning a Comprehensible Model from an Ensemble
Abstract. Ensemble methods are popular learning methods that usually increase the predictive accuracy of a classifier though at the cost of interpretability and insight in the deci...
Anneleen Van Assche, Hendrik Blockeel
ASPDAC
1995
ACM
130views Hardware» more  ASPDAC 1995»
15 years 1 months ago
Design for testability using register-transfer level partial scan selection
Abstract - An approach to top down design for testability using register-transfer level(RTL) partial scan selection is described. We propose a scan selection technique based on tes...
Akira Motohara, Sadami Takeoka, Toshinori Hosokawa...