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...
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...
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...
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...
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...