Sciweavers

367 search results - page 52 / 74
» Relating Full Abstraction Results for Different Programming ...
Sort
View
DAC
1999
ACM
14 years 9 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
LREC
2010
159views Education» more  LREC 2010»
13 years 10 months ago
Consistent and Flexible Integration of Morphological Annotation in the Arabic Treebank
tions arise for standoff annotation when the annotation is not on the source text itself, but on a more abstract representation. This is particularly the case in a language such a...
Seth Kulick, Ann Bies, Mohamed Maamouri
ESOP
2009
Springer
14 years 3 months ago
An Interval-Based Inference of Variant Parametric Types
Abstract. Variant parametric types (VPT) represent the successful result of combining subtype polymorphism with parametric polymorphism to support a more flexible subtyping for Ja...
Florin Craciun, Wei-Ngan Chin, Guanhua He, Shengch...
SAS
1994
Springer
159views Formal Methods» more  SAS 1994»
14 years 26 days ago
Iterative Fixed Point Computation for Type-Based Strictness Analysis
Amtoft has formulated an "on-line" constraint normalization method for solving a strictness inference problem inspired by Wright. From the syntactic form of the normaliz...
Fritz Henglein
ASPLOS
2011
ACM
13 years 12 days ago
On-the-fly elimination of dynamic irregularities for GPU computing
The power-efficient massively parallel Graphics Processing Units (GPUs) have become increasingly influential for scientific computing over the past few years. However, their ef...
Eddy Z. Zhang, Yunlian Jiang, Ziyu Guo, Kai Tian, ...