You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
16 lines
627 B
16 lines
627 B
6 years ago
|
(*
|
||
6 years ago
|
* Copyright (c) Facebook, Inc. and its affiliates.
|
||
6 years ago
|
*
|
||
|
* This source code is licensed under the MIT license found in the
|
||
|
* LICENSE file in the root directory of this source tree.
|
||
|
*)
|
||
|
|
||
|
(** Frame Inference Solver over Symbolic Heaps *)
|
||
|
|
||
|
val infer_frame : Sh.t -> Var.Set.t -> Sh.t -> Sh.t option
|
||
|
(** If [infer_frame p xs q] is [Some r], then [p ⊢ ∃xs. q * r]. The
|
||
|
vocabulary of [r] is the vocabulary of [q] union [xs]. A goal is for [r]
|
||
|
to be strong enough that for every model of [r], there exists an
|
||
|
extension of it satisfying [q], such that the combination (with [xs]
|
||
|
projected out) satisfies [p]. *)
|