File size: 14,399 Bytes
6851d40 | 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 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 | // RUN: %verify "%s"
include "../Utils/Seq.dfy"
include "../Errors.dfy"
include "../ConcreteSyntax.Spec.dfy"
include "../ConcreteSyntax.SpecProperties.dfy"
include "../Utils/Views.Writers.dfy"
module {:options "-functionSyntax:4"} JSON.ZeroCopy.Serializer {
import opened BoundedInts
import opened Wrappers
import opened Seq = Utils.Seq
import opened Errors
import ConcreteSyntax.Spec
import ConcreteSyntax.SpecProperties
import opened Grammar
import opened Utils.Views.Writers
import opened Vs = Utils.Views.Core // DISCUSS: Module naming convention?
method Serialize(js: JSON) returns (rbs: SerializationResult<array<byte>>)
ensures rbs.Success? ==> fresh(rbs.value)
ensures rbs.Success? ==> rbs.value[..] == Spec.JSON(js)
{
var writer := Text(js);
:- Need(writer.Unsaturated?, OutOfMemory);
var bs := writer.ToArray();
return Success(bs);
}
method SerializeTo(js: JSON, dest: array<byte>) returns (len: SerializationResult<uint32>)
modifies dest
ensures len.Success? ==> len.value as int <= dest.Length
ensures len.Success? ==> dest[..len.value] == Spec.JSON(js)
ensures len.Success? ==> dest[len.value..] == old(dest[len.value..])
ensures len.Failure? ==> unchanged(dest)
{
var writer := Text(js);
:- Need(writer.Unsaturated?, OutOfMemory);
:- Need(writer.length as int <= dest.Length, OutOfMemory);
writer.CopyTo(dest);
return Success(writer.length);
}
function {:opaque} Text(js: JSON) : (wr: Writer)
ensures wr.Bytes() == Spec.JSON(js)
{
JSON(js)
}
function {:opaque} JSON(js: JSON, writer: Writer := Writer.Empty) : (wr: Writer)
ensures wr.Bytes() == writer.Bytes() + Spec.JSON(js)
{
Seq.Assoc2(writer.Bytes(),js.before.Bytes(), Spec.Value(js.t), js.after.Bytes());
writer
.Append(js.before)
.Then(wr => Value(js.t, wr))
.Append(js.after)
}
function {:opaque} {:vcs_split_on_every_assert} Value(v: Value, writer: Writer) : (wr: Writer)
decreases v, 4
ensures wr.Bytes() == writer.Bytes() + Spec.Value(v)
{
match v
case Null(n) => writer.Append(n)
case Bool(b) => var wr := writer.Append(b); wr
case String(str) => var wr := String(str, writer); wr
case Number(num) => assert Grammar.Number(num) == v by { Spec.UnfoldValueNumber(v); } var wr := Number(num, writer); wr
case Object(obj) => assert Grammar.Object(obj) == v; assert Spec.Value(v) == Spec.Value(Grammar.Object(obj)) == Spec.Object(obj); var wr := Object(obj, writer); wr
case Array(arr) => assert Grammar.Array(arr) == v; assert Spec.Value(v) == Spec.Array(arr); var wr := Array(arr, writer); assert wr.Bytes() == writer.Bytes() + Spec.Value(v); wr
}
function {:opaque} String(str: jstring, writer: Writer) : (wr: Writer)
decreases str, 0
ensures wr.Bytes() == writer.Bytes() + Spec.String(str)
{
writer
.Append(str.lq)
.Append(str.contents)
.Append(str.rq)
}
function {:opaque} {:vcs_split_on_every_assert} Number(num: jnumber, writer: Writer) : (wr: Writer)
decreases num, 0
ensures wr.Bytes() == writer.Bytes() + Spec.Number(num)
{
var wr := writer.Append(num.minus).Append(num.num);
var wr := if num.frac.NonEmpty? then
wr.Append(num.frac.t.period).Append(num.frac.t.num)
else wr;
assert wr.Bytes() == writer.Bytes() + Spec.View(num.minus) + Spec.View(num.num) + Spec.Maybe(num.frac, Spec.Frac) by {
assert num.frac.Empty? ==> wr.Bytes() == writer.Bytes() + Spec.View(num.minus) + Spec.View(num.num) + [];
}
var wr := if num.exp.NonEmpty? then
wr.Append(num.exp.t.e).Append(num.exp.t.sign).Append(num.exp.t.num)
else wr;
assert wr.Bytes() == writer.Bytes() + Spec.View(num.minus) + Spec.View(num.num) + Spec.Maybe(num.frac, Spec.Frac) + Spec.Maybe(num.exp, Spec.Exp) by {
if num.exp.NonEmpty? {} else {
assert wr.Bytes() == writer.Bytes() + Spec.View(num.minus) + Spec.View(num.num) + Spec.Maybe(num.frac, Spec.Frac) + [];
}
}
wr
}
// DISCUSS: Can't be opaque, due to the lambda
function StructuralView(st: Structural<View>, writer: Writer) : (wr: Writer)
ensures wr.Bytes() == writer.Bytes() + Spec.Structural(st, Spec.View)
{
writer.Append(st.before).Append(st.t).Append(st.after)
}
lemma StructuralViewEns(st: Structural<View>, writer: Writer)
ensures StructuralView(st, writer).Bytes() == writer.Bytes() + Spec.Structural(st, Spec.View)
{}
lemma {:axiom} Assume(b: bool) ensures b
// FIXME refactor below to merge
lemma BracketedToObject(obj: jobject)
ensures Spec.Bracketed(obj, Spec.Member) == Spec.Object(obj)
{
var rMember := (d: jmember) requires d < obj => Spec.Member(d);
assert Spec.Bracketed(obj, Spec.Member) == Spec.Bracketed(obj, rMember) by {
// We call ``ConcatBytes`` with ``Spec.Member``, whereas the spec calls it
// with ``(d: jmember) requires d in obj.data => Spec.Member(d)``. That's
// why we need an explicit cast, which is performed by the lemma below.
assert SpecProperties.Bracketed_Morphism_Requires(obj, Spec.Member, rMember);
SpecProperties.Bracketed_Morphism(obj, Spec.Member, rMember);
}
calc {
Spec.Bracketed(obj, Spec.Member);
Spec.Bracketed(obj, rMember);
Spec.Object(obj);
}
}
function {:opaque} Object(obj: jobject, writer: Writer) : (wr: Writer)
decreases obj, 3
ensures wr.Bytes() == writer.Bytes() + Spec.Object(obj)
{
var wr := StructuralView(obj.l, writer);
StructuralViewEns(obj.l, writer);
var wr := Members(obj, wr);
var wr := StructuralView(obj.r, wr);
Seq.Assoc2(writer.Bytes(), Spec.Structural<View>(obj.l, Spec.View), Spec.ConcatBytes(obj.data, Spec.Member), Spec.Structural<View>(obj.r, Spec.View));
assert wr.Bytes() == writer.Bytes() + Spec.Bracketed(obj, Spec.Member);
assert Spec.Bracketed(obj, Spec.Member) == Spec.Object(obj) by { BracketedToObject(obj); }
wr
}
lemma BracketedToArray(arr: jarray)
ensures Spec.Bracketed(arr, Spec.Item) == Spec.Array(arr)
{
var rItem := (d: jitem) requires d < arr => Spec.Item(d);
assert Spec.Bracketed(arr, Spec.Item) == Spec.Bracketed(arr, rItem) by {
assert SpecProperties.Bracketed_Morphism_Requires(arr, Spec.Item, rItem);
SpecProperties.Bracketed_Morphism(arr, Spec.Item, rItem);
}
calc {
Spec.Bracketed(arr, Spec.Item);
Spec.Bracketed(arr, rItem);
Spec.Array(arr);
}
}
function {:opaque} Array(arr: jarray, writer: Writer) : (wr: Writer)
decreases arr, 3
ensures wr.Bytes() == writer.Bytes() + Spec.Array(arr)
{
var wr := StructuralView(arr.l, writer);
StructuralViewEns(arr.l, writer);
var wr := Items(arr, wr);
var wr := StructuralView(arr.r, wr);
Seq.Assoc2(writer.Bytes(), Spec.Structural<View>(arr.l, Spec.View), Spec.ConcatBytes(arr.data, Spec.Item), Spec.Structural<View>(arr.r, Spec.View));
assert wr.Bytes() == writer.Bytes() + Spec.Bracketed(arr, Spec.Item);
assert Spec.Bracketed(arr, Spec.Item) == Spec.Array(arr) by { BracketedToArray(arr); }
wr
}
function {:opaque} Members(obj: jobject, writer: Writer) : (wr: Writer)
decreases obj, 2
ensures wr.Bytes() == writer.Bytes() + Spec.ConcatBytes(obj.data, Spec.Member)
{
MembersSpec(obj, obj.data, writer)
} by method {
wr := MembersImpl(obj, writer);
Assume(false); // BUG(https://github.com/dafny-lang/dafny/issues/2180)
}
function {:opaque} Items(arr: jarray, writer: Writer) : (wr: Writer)
decreases arr, 2
ensures wr.Bytes() == writer.Bytes() + Spec.ConcatBytes(arr.data, Spec.Item)
{
ItemsSpec(arr, arr.data, writer)
} by method {
wr := ItemsImpl(arr, writer);
Assume(false); // BUG(https://github.com/dafny-lang/dafny/issues/2180)
}
ghost function MembersSpec(obj: jobject, members: seq<jmember>, writer: Writer) : (wr: Writer)
requires forall j | 0 <= j < |members| :: members[j] < obj
decreases obj, 1, members
ensures wr.Bytes() == writer.Bytes() + Spec.ConcatBytes(members, Spec.Member)
{ // TR elimination doesn't work for mutually recursive methods, so this
// function is only used as a spec for Members.
if members == [] then writer
else
var butLast, last := members[..|members|-1], members[|members|-1];
assert members == butLast + [last];
var wr := MembersSpec(obj, butLast, writer);
var wr := Member(obj, last, wr);
assert wr.Bytes() == writer.Bytes() + (Spec.ConcatBytes(butLast, Spec.Member) + Spec.ConcatBytes([last], Spec.Member)) by {
Seq.Assoc(writer.Bytes(), Spec.ConcatBytes(butLast, Spec.Member), Spec.ConcatBytes([last], Spec.Member));
}
SpecProperties.ConcatBytes_Linear(butLast, [last], Spec.Member);
wr
} // No by method block here, because the loop invariant in the method version
// needs to call MembersSpec and the termination checker gets confused by
// that. Instead, see Members above. // DISCUSS
// DISCUSS: Is there a way to avoid passing the ghost `v` around while
// maintaining the termination argument? Maybe the lambda for elements will be enough?
ghost function SequenceSpec<T>(v: Value, items: seq<T>,
spec: T -> bytes, impl: (Value, T, Writer) --> Writer,
writer: Writer)
: (wr: Writer)
requires forall item, wr | item in items :: impl.requires(v, item, wr)
requires forall item, wr | item in items :: impl(v, item, wr).Bytes() == wr.Bytes() + spec(item)
decreases v, 1, items
ensures wr.Bytes() == writer.Bytes() + Spec.ConcatBytes(items, spec)
{ // TR elimination doesn't work for mutually recursive methods, so this
// function is only used as a spec for Items.
if items == [] then writer
else
var writer := SequenceSpec(v, items[..|items|-1], spec, impl, writer);
assert items == items[..|items|-1] + [items[|items|-1]];
SpecProperties.ConcatBytes_Linear(items[..|items|-1], [items[|items|-1]], spec);
impl(v, items[|items|-1], writer)
} // No by method block here, because the loop invariant in the method version
// needs to call `SequenceSpec` and the termination checker gets confused by
// that. Instead, see `Sequence`Items above. // DISCUSS
ghost function ItemsSpec(arr: jarray, items: seq<jitem>, writer: Writer) : (wr: Writer)
requires forall j | 0 <= j < |items| :: items[j] < arr
decreases arr, 1, items
ensures wr.Bytes() == writer.Bytes() + Spec.ConcatBytes(items, Spec.Item)
{ // TR elimination doesn't work for mutually recursive methods, so this
// function is only used as a spec for Items.
if items == [] then writer
else
var butLast, last := items[..|items|-1], items[|items|-1];
assert items == butLast + [last];
var wr := ItemsSpec(arr, butLast, writer);
var wr := Item(arr, last, wr);
assert wr.Bytes() == writer.Bytes() + (Spec.ConcatBytes(butLast, Spec.Item) + Spec.ConcatBytes([last], Spec.Item)) by {
Seq.Assoc(writer.Bytes(), Spec.ConcatBytes(butLast, Spec.Item), Spec.ConcatBytes([last], Spec.Item));
}
SpecProperties.ConcatBytes_Linear(butLast, [last], Spec.Item);
wr
} // No by method block here, because the loop invariant in the method version
// needs to call ItemsSpec and the termination checker gets confused by
// that. Instead, see Items above. // DISCUSS
method MembersImpl(obj: jobject, writer: Writer) returns (wr: Writer)
decreases obj, 1
ensures wr == MembersSpec(obj, obj.data, writer)
{
wr := writer;
var members := obj.data;
assert wr == MembersSpec(obj, members[..0], writer);
for i := 0 to |members| // FIXME uint32
invariant wr == MembersSpec(obj, members[..i], writer)
{
assert members[..i+1][..i] == members[..i];
wr := Member(obj, members[i], wr);
}
assert members[..|members|] == members;
assert wr == MembersSpec(obj, members, writer);
}
method {:vcs_split_on_every_assert} ItemsImpl(arr: jarray, writer: Writer) returns (wr: Writer)
decreases arr, 1
ensures wr == ItemsSpec(arr, arr.data, writer)
{
wr := writer;
var items := arr.data;
assert wr == ItemsSpec(arr, items[..0], writer);
for i := 0 to |items| // FIXME uint32
invariant wr == ItemsSpec(arr, items[..i], writer)
{
assert items[..i+1][..i] == items[..i] by {
AboutList(items, i, i+1);
}
wr := Item(arr, items[i], wr);
}
assert items[..|items|] == items;
}
lemma AboutList<T>(xs: seq<T>, i: nat, j: nat)
requires i < j <= |xs|
ensures xs[..j][..i] == xs[..i]
{}
function {:opaque} Member(ghost obj: jobject, m: jmember, writer: Writer) : (wr: Writer)
requires m < obj
decreases obj, 0
ensures wr.Bytes() == writer.Bytes() + Spec.Member(m)
{
var wr := String(m.t.k, writer);
var wr := StructuralView(m.t.colon, wr);
var wr := Value(m.t.v, wr);
assert wr.Bytes() == writer.Bytes() + (Spec.String(m.t.k) + Spec.Structural<View>(m.t.colon, Spec.View) + Spec.Value(m.t.v)) by {
Seq.Assoc2( writer.Bytes(), Spec.String(m.t.k), Spec.Structural<View>(m.t.colon, Spec.View), Spec.Value(m.t.v));
}
var wr := if m.suffix.Empty? then wr else StructuralView(m.suffix.t, wr);
assert wr.Bytes() == writer.Bytes() + Spec.KeyValue(m.t) + Spec.CommaSuffix(m.suffix) by {
if m.suffix.Empty? {
Neutral(Spec.KeyValue(m.t));
Seq.Assoc'(writer.Bytes(), Spec.KeyValue(m.t), []);
}
else {
assert Spec.StructuralView(m.suffix.t) == Spec.CommaSuffix(m.suffix);
}
}
assert wr.Bytes() == writer.Bytes() + (Spec.KeyValue(m.t) + Spec.CommaSuffix(m.suffix)) by {
Seq.Assoc(writer.Bytes(), Spec.KeyValue(m.t), Spec.CommaSuffix(m.suffix));
}
wr
}
function {:opaque} Item(ghost arr: jarray, m: jitem, writer: Writer) : (wr: Writer)
requires m < arr
decreases arr, 0
ensures wr.Bytes() == writer.Bytes() + Spec.Item(m)
{
var wr := Value(m.t, writer);
var wr := if m.suffix.Empty? then wr else StructuralView(m.suffix.t, wr);
assert wr.Bytes() == writer.Bytes() + (Spec.Value(m.t) + Spec.CommaSuffix(m.suffix)) by {
Seq.Assoc(writer.Bytes(), Spec.Value(m.t), Spec.CommaSuffix(m.suffix));
}
wr
}
}
|