Sciweavers

3404 search results - page 298 / 681
» C Programming Tutorial
Sort
View
103
Voted
FM
1999
Springer
88views Formal Methods» more  FM 1999»
15 years 8 months ago
Refinement Semantics and Loop Rules
Refinement semantics is an alternative to least fixpoint semantics that is more useful for programming. From it we derive a variety of rules for w h i l e-loops, for-loops, and loo...
Eric C. R. Hehner, Andrew M. Gravell
152
Voted
SOSL
1993
15 years 7 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
140
Voted
CF
2006
ACM
15 years 7 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
114
Voted
SERVICES
2008
86views more  SERVICES 2008»
15 years 5 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
94
Voted
ANLP
2000
95views more  ANLP 2000»
15 years 5 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...