Add to ORKGAbstract—A fast and portable verification method is proposed for computing tight and componentwise error bounds for approximate solutions of linear systems. This method requires no switch of rounding mode so that it is applicable in Java keeping the portability. Finally numer-ical examples are presented to show the efficiency of this method. 1
Current verification condition (VC) generation algorithms, such as weakest preconditions, yield a VC...
Interval arithmetic is a means to compute verified results. However, a naive use of interval arithme...
In software component verification, one of the challenges is model checking of isolated components. ...
AbstractRecent development of Java's optimization techniques makes Java one of the most useful progr...
International audienceSolving numerically a linear system can be performed very efficiently, using o...
Abstract. In this paper we describe some of the principles of methods for the verified solution of l...
International audienceThe problem considered in this talk is to solve and mainly to refine an approx...
International audienceWe propose a relaxed method to certify the solution of a linear system Ax=b. T...
This paper is concerned with the problem of verifying the accuracy of an approximate solution of a s...
Abstract. This paper presents a new multithreaded approach for the problem of solving dense linear s...
The Reliable Computing journal has no more paper publication, only free, electronic publication.Inte...
Abstract. Validated solution of a problem means to compute error bounds for a solution in finite pre...
Abstract—This paper is concerned with the problem of verifying an accuracy of a computed solution of...
For software components to be reused with confidence, they must be correct. Unlike testing, formal v...
This paper presents a first attempt at implementing an algorithm with result verification for linear...
Current verification condition (VC) generation algorithms, such as weakest preconditions, yield a VC...
Interval arithmetic is a means to compute verified results. However, a naive use of interval arithme...
In software component verification, one of the challenges is model checking of isolated components. ...
AbstractRecent development of Java's optimization techniques makes Java one of the most useful progr...
International audienceSolving numerically a linear system can be performed very efficiently, using o...
Abstract. In this paper we describe some of the principles of methods for the verified solution of l...
International audienceThe problem considered in this talk is to solve and mainly to refine an approx...
International audienceWe propose a relaxed method to certify the solution of a linear system Ax=b. T...
This paper is concerned with the problem of verifying the accuracy of an approximate solution of a s...
Abstract. This paper presents a new multithreaded approach for the problem of solving dense linear s...
The Reliable Computing journal has no more paper publication, only free, electronic publication.Inte...
Abstract. Validated solution of a problem means to compute error bounds for a solution in finite pre...
Abstract—This paper is concerned with the problem of verifying an accuracy of a computed solution of...
For software components to be reused with confidence, they must be correct. Unlike testing, formal v...
This paper presents a first attempt at implementing an algorithm with result verification for linear...
Current verification condition (VC) generation algorithms, such as weakest preconditions, yield a VC...
Interval arithmetic is a means to compute verified results. However, a naive use of interval arithme...
In software component verification, one of the challenges is model checking of isolated components. ...