Using PVS to validate the algorithms of an exact arithmetic. (Q1853641)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Using PVS to validate the algorithms of an exact arithmetic. |
scientific article; zbMATH DE number 1857149
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Using PVS to validate the algorithms of an exact arithmetic. |
scientific article; zbMATH DE number 1857149 |
Statements
Using PVS to validate the algorithms of an exact arithmetic. (English)
0 references
21 January 2003
0 references
Cauchy sequences
0 references
Computable reals
0 references
Correctness
0 references
Exact arithmetic
0 references
PVS
0 references
0.838026225566864
0 references
0.8306035995483398
0 references
0.8205671310424805
0 references
0.789935290813446
0 references
0.763475239276886
0 references
