#### Filter Results:

#### Publication Year

2007

2012

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

- Patra Charalampaki, Robert Reisch, Ali Ayad, Jens Conrad, Stefan Welschehold, Axel Perneczky +1 other
- 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)

In the context of deductive program verification, supporting floating-point 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)

- Ali Ayad, Claude Marché
- 2009

We propose an expressive language to specify formally behavioral properties of programs involving floating-point computations. We present a de-ductive 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… (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
- 2009

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 para-metric 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)

- Ali Ayad, Keshlaf, Steve Riddle
- 2010

— The level of complexity and risks associated with software have been increasing in line with the growth of the software industry. Modern software development, with an emphasis on web and distributed development, presents specific challenges and risk areas to the software industry which need to be considered and managed. In this paper we survey a number of… (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
- 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)

- 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)

In this paper we deal with the solvability of the infinite system of differential equations x (t) = ∆(λ)x(t) + b with x(0) = a, where ∆(λ) is the triangle defined by the infinite matrix whose the nonzero entries are [∆(λ)] nn = λ n and [∆(λ)] n,n−1 = λ n−1 for all n ∈ N, for a given sequence λ and a, b are two given infinite column matrices. We use a new… (More)