Sciweavers

382 search results - page 1 / 77
» Reasoning about the Elementary Functions of Complex Analysis
Sort
View
AISC
2000
Springer
13 years 9 months ago
Reasoning about the Elementary Functions of Complex Analysis
There are many problems with the simplification of elementary functions, particularly over the complex plane. Systems tend to make “howlers” or not to simplify enough. In thi...
Robert M. Corless, James H. Davenport, David J. Je...
UC
2009
Springer
13 years 11 months ago
Reasoning about Entanglement and Separability in Quantum Higher-Order Functions
We present a logical approach to the separability analysis issue for a functional quantum computation language. This logic is inspired by previous works on logical analysis of alia...
Frédéric Prost, Chaouki Zerrari
SAC
2006
ACM
13 years 4 months ago
Assisted verification of elementary functions using Gappa
The implementation of a correctly rounded or interval elementary function needs to be proven carefully in the very last details. The proof requires a tight bound on the overall er...
Florent de Dinechin, Christoph Quirin Lauter, Guil...
AML
2008
124views more  AML 2008»
13 years 5 months ago
The elementary computable functions over the real numbers: applying two new techniques
The basic motivation behind this work is to tie together various computational complexity classes, whether over different domains such as the naturals or the reals, or whether def...
Manuel Lameiras Campagnolo, Kerry Ojakian
IPPS
2003
IEEE
13 years 10 months ago
Reasoning about Deadlines in Concurrent Real-Time Programs
We propose a method for the timing analysis of concurrent real-time programs with hard deadlines. We divide the analysis into a machine-independent and a machinedependent task. Th...
Sibylle Peuker, Ian J. Hayes