Sciweavers

3708 search results - page 355 / 371
» Programming with C Exceptions
Sort
View
118 views 113 votes 15 years 7 months ago  UM 2005»
Abstract. A promising approach towards evaluating adaptive systems is to decompose the adaptation process and evaluate the system in a “piece-wise” manner. This paper presents ...
137 views 101 votes 15 years 7 months ago  EUROPAR 2003»
I propose a set of criteria which distinguish a grand challenge in science or engineering from the many other kinds of short-term or long-term research problems that engage the int...
92 views 91 votes 15 years 6 months ago  IPPS 2000»
We argue that mutable programs are an important class of future applications. The field of software agents is an important beneficiary of mutability. We evaluate existing mutabl...
88 views 91 votes 15 years 6 months ago  FM 1999»
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...
156 views 140 votes 15 years 6 months ago  SOSL 1993»
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...
145 views 127 votes 15 years 6 months ago  CF 2006»
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...
86 views 107 votes 15 years 3 months ago  SERVICES 2008»
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...
95 views 80 votes 15 years 3 months ago  ANLP 2000»
ARBITER is a Prolog program that extracts assertions about macromolecular binding relationships from biomedical text. We describe the domain knowledge and the underspecified lingu...
93 views 107 votes 15 years 2 months ago  IPL 2006»
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...
122 views 210 votes 16 years 2 months ago  POPL 2003»
We present an interprocedural and compositional algorithm for finding pairs of compatible allocation sites, which have the property that no object allocated at one site is live at...