#### Filter Results:

- Full text PDF available (13)

#### Publication Year

2007

2014

- This year (0)
- Last 5 years (3)
- Last 10 years (15)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Ali Ayad, Claude Marché
- IJCAR
- 2010

In the context of deductive program verification, supporting floatingpoint computations is tricky. We propose an expressive language to formally specify behavioral properties of such programs. We give a first-order axiomatization of floating-point operations which allows to reduce verification to checking the validity of logic formulas, in a suitable form… (More)

- Patra Charalampaki, Robert Reisch, +4 authors Christian Wüster
- Journal of clinical neuroscience : official…
- 2007

OBJECTIVE
Microsurgical transsphenoidal surgery for pituitary tumors has been standard therapy for decades and was established by Harvey Cushing in the early twentieth century. Today, endoscopy is increasingly accepted in the therapy of pituitary lesions. In this retrospective study, we analysed the surgical technique and outcome of 50 patients with… (More)

- Ali Ayad
- 2009

This paper presents an implementation of an extension of the ACSL specification language in the Frama-C tool in order to prove the correctness of floating-point C programs. This implementation is essentially based on the two Why models of floating-point arithmetic of [5]: the first model supposes that there is no overflow during the program execution and is… (More)

- Ali Ayad, Claude Marché
- 2009

We propose an expressive language to specify formally behavioral properties of programs involving floating-point computations. We present a deductive verification technique, which allows to prove formally that a given program meets its specifications, using either SMT-class automatic theorem provers or general interactive proof assistants. Experiments using… (More)

- Ali AYAD
- 2007

We present three algorithms in this paper: the first algorithm solves zero-dimensional parametric homogeneous polynomial systems with single exponential time in the number n of the unknowns, it decomposes the parameters space into a finite number of constructible sets and computes the finite number of solutions by parametric rational representations… (More)

Tilmicosin was administered intravenously and subcutaneously at a dose rate of 10 mg/kg bwt to determine its concentration in blood and bronchial secretion as well as its kinetic behavior in healthy and Pasteurella haemolytica type A1-infected calves. Sever acute bronchopneumonia was induced in 10 calves by inoculating them intra-tracheally with P.… (More)

- Ali Ayad
- 2009

This paper provides an overview on existing algorithms for factoring polynomials over global fields with their complexity analysis from our experiments on the subject. It relies on our studies of the complexity of factoring parametric multivariate polynomials that is used for solving parametric polynomial systems in our PhD thesis. It is intended to be… (More)

- Ali Ayad
- 2010

We prove that the binary complexity of solving ordinary polynomial differential equations in terms of Puiseux series is single exponential in the number of terms in the series. Such a bound was given in 1990 by Grigoriev for Riccatti differential polynomials associated to ordinary linear differential operators. In this paper, we get the same bound for… (More)

- Ali AYAD
- 2007

We prove that the binary complexity of solving ordinary polynomial differential equations in terms of Puiseux series is single exponential in the number of terms in the series. Such a bound was given by Grigoriev [10] for Riccatti differential polynomials associated to ordinary linear differential operators. In this paper, we get the same bound for… (More)

This paper presents a lecture on existing algorithms for solving polynomial systems with their complexity analysis from our experiments on the subject. It is based on our studies of the complexity of solving parametric polynomial systems. It is intended to be useful to two groups of people: those who wish to know what work has been done and those who would… (More)