Sciweavers

1710 search results - page 188 / 342
» High-Level Programs and Program Conditions
Sort
View
SAC
2006
ACM
15 years 7 months ago
Provably faithful evaluation of polynomials
We provide sufficient conditions that formally guarantee that the floating-point computation of a polynomial evaluation is faithful. To this end, we develop a formalization of ï¬...
Sylvie Boldo, César Muñoz
HASE
2007
IEEE
15 years 5 months ago
Multiple Pre/Post Specifications for Heap-Manipulating Methods
Automated verification plays an important role for high assurance software. This typically uses a pair of pre/post conditions as a formal (but possibly partial) specification of e...
Wei-Ngan Chin, Cristina David, Huu Hai Nguyen, She...
ACSD
2001
IEEE
134views Hardware» more  ACSD 2001»
15 years 5 months ago
Embedding Imperative Synchronous Languages in Interactive Theorem Provers
We present a new way to define the semantics of imperative synchronous languages by means of separating the control and the data flow. The control flow is defined by predicates th...
Klaus Schneider
AUTOMATICA
2008
60views more  AUTOMATICA 2008»
15 years 1 months ago
Control of nonstationary LPV systems
This paper considers control of nonstationary linear parameter-varying systems, and is motivated by interest in the control of nonlinear systems along prespecified trajectories. I...
Mazen Farhood, Geir E. Dullerud
EOR
2007
113views more  EOR 2007»
15 years 1 months ago
Duality for location problems with unbounded unit balls
Abstract. Given an optimization problem with a composite of a convex and componentwise increasing function with a convex vector function as objective function, by means of the conj...
Gert Wanka, Radu Ioan Bot, Emese Vargyas