Sciweavers

3256 search results - page 296 / 652
» Mixin-Based Programming in C
Sort
View
SOSL
1993
15 years 5 months ago
Verifying Process Algebra Proofs in Type Theory
In this paper we study automatic veri cation of proofs in process algebra. Formulas of process algebra are represented by types in typed -calculus. Inhabitants (terms) of these ty...
M. P. A. Sellink
CF
2006
ACM
15 years 4 months ago
Landing openMP on cyclops-64: an efficient mapping of openMP to a many-core system-on-a-chip
This paper presents our experience mapping OpenMP parallel programming model to the IBM Cyclops-64 (C64) architecture. The C64 employs a many-core-on-a-chip design that integrates...
Juan del Cuvillo, Weirong Zhu, Guang R. Gao
SERVICES
2008
86views more  SERVICES 2008»
15 years 2 months ago
A Reference Curriculum for Service Engineering
Described here is a proposed curriculum design for service engineering based on the six years of experience of a master's program at the School of Software and Microelectroni...
Frank C. Tung
ANLP
2000
95views more  ANLP 2000»
15 years 2 months ago
Extracting Molecular Binding Relationships from Biomedical Text
ARBITER is a Prolog program that extracts assertions about macromolecular binding relationships from biomedical text. We describe the domain knowledge and the underspecified lingu...
Thomas C. Rindflesch, Jayant V. Rajan, Lawrence Hu...
IPL
2006
93views more  IPL 2006»
15 years 1 months ago
A decidable characterization of the classes between lintime and exptime
A language is defined by closure under safe iteration and under a new form of safe diagonalization that, unlike other forms of diagonalization used in literature to define sub-recu...
Salvatore Caporaso