1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
|
/**************************************************************************/
/* */
/* The Why platform for program certification */
/* */
/* Copyright (C) 2002-2011 */
/* */
/* Jean-Christophe FILLIATRE, CNRS & Univ. Paris-sud 11 */
/* Claude MARCHE, INRIA & Univ. Paris-sud 11 */
/* Yannick MOY, Univ. Paris-sud 11 */
/* Romain BARDOU, Univ. Paris-sud 11 */
/* */
/* Secondary contributors: */
/* */
/* Thierry HUBERT, Univ. Paris-sud 11 (former Caduceus front-end) */
/* Nicolas ROUSSET, Univ. Paris-sud 11 (on Jessie & Krakatoa) */
/* Ali AYAD, CNRS & CEA Saclay (floating-point support) */
/* Sylvie BOLDO, INRIA (floating-point support) */
/* Jean-Francois COUCHOT, INRIA (sort encodings, hyps pruning) */
/* Mehdi DOGGUY, Univ. Paris-sud 11 (Why GUI) */
/* */
/* This software is free software; you can redistribute it and/or */
/* modify it under the terms of the GNU Lesser General Public */
/* License version 2.1, with the special exception on linking */
/* described in file LICENSE. */
/* */
/* This software is distributed in the hope that it will be useful, */
/* but WITHOUT ANY WARRANTY; without even the implied warranty of */
/* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. */
/* */
/**************************************************************************/
//@+ CheckArithOverflow = no
/*@ lemma real_add_int :
@ (\forall integer x y; (real) (x + y) == (real) x + (real) y);
@*/
/*@ lemma real_mul_int :
@ (\forall integer x y; (real) (x * y) == (real) x * (real) y);
@*/
/*@ lemma mul_add_distr1 :
@ (\forall real x y z; x * (y + z) == (x * y) + (x * z));
@*/
/*@ lemma add_comm :
@ (\forall real x y; x + y == y + x);
@*/
/*@ lemma add_assoc :
@ (\forall real x y z; x + (y + z) == (x + y) + z);
@*/
/* @ lemma PRECISION_property :
@ 0.01 * (real) DecimalAbstractReal.PRECISION == 1.0;
@*/
/* @ lemma PRECISION_property :
@ 0.01 * (real) 100 == 1.0;
@*/
/*@ lemma PRECISION_property_real :
@ 0.01 * 100.0 == 1.0;
@*/
/*@ logic real amount_real_value{L}(DecimalAbstractReal x) =
@ (real) x.intPart + 0.01 * (real) x.decPart ;
@*/
/*@ logic integer amount_cent_value{L}(DecimalAbstractReal x) =
@ DecimalAbstractReal.PRECISION * x.intPart + x.decPart ;
@*/
public class DecimalAbstractReal {
/** minimal fraction of currency = 1/PRECISION */
public static final short PRECISION = 100;
short intPart;
short decPart;
//@ invariant decimal: 0 <= decPart && decPart < 100;
// bug: should be PRECISION ;
/*@ requires a != null;
@ assigns intPart, decPart;
@ behavior real_value:
@ ensures
@ amount_real_value(this) ==
@ \old(amount_real_value(this)) + \old(amount_real_value(a));
@ behavior cent_value:
@ ensures
@ amount_cent_value(this) ==
@ \old(amount_cent_value(this)) + \old(amount_cent_value(a));
@
@*/
public void add(DecimalAbstractReal a) {
short d = (short)(decPart + a.decPart);
short i = (short)(intPart + a.intPart);
if (d >= PRECISION) {
d -= PRECISION;
i++;
}
intPart = i;
decPart = d;
}
/*@ requires a != null && a != this;
@ assigns intPart, decPart;
@ behavior real_value:
@ ensures
@ amount_real_value(this) ==
@ \old(amount_real_value(this)) + amount_real_value(a);
@ behavior cent_value:
@ ensures
@ amount_cent_value(this) ==
@ \old(amount_cent_value(this)) + amount_cent_value(a);
@
@*/
public void add2(DecimalAbstractReal a) {
short d = (short)(decPart + a.decPart);
short i = (short)(intPart + a.intPart);
if (d >= PRECISION) {
d -= PRECISION;
i++;
}
intPart = i;
decPart = d;
}
}
|
