Sciweavers

3708 search results - page 354 / 371
» Programming with C Exceptions
Sort
View
78 views 79 votes 15 years 22 days ago  IJSN 2006»
: Detectors are system components that identify whether the system is in a particular state. Detectors can be used to ensure arbitrary safety properties for systems, that is, they ...
87 views 121 votes 14 years 11 months ago  OL 2010»
Abstract. We consider the system of m linear equations in n integer variables Ax = d and give sufficient conditions for the uniqueness of its integer solution x ∈ {−1,1}n by r...
549 views 128 votes 14 years 10 months ago  IJACTAICIT 2010»
The MTS-88.c trainer is a training system targeting students in the microprocessors course. It has a built in single-line assembler allowing the users to enter programs in assembl...
89 views 104 votes 14 years 7 months ago  SIAMJO 2010»
Necessary first-order sequential optimality conditions provide adequate theoretical tools to justify stopping criteria for nonlinear programming solvers. These conditions are sati...
308 views 185 votes 16 years 12 months ago
Still and multi-media images are subject to transformations for compression, steganographic embedding and digital watermarking. In a major program of activities we are engaged in t...
118 views 97 votes 15 years 6 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 90 votes 15 years 6 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 79 votes 15 years 5 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 78 votes 15 years 5 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 129 votes 15 years 4 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...