[infer][PR] fixed spelling

Summary: Closes https://github.com/facebook/infer/pull/779

Reviewed By: jeremydubreil, jvillard

Differential Revision: D6172472

Pulled By: ddino

fbshipit-source-id: 8682491
master
anuolu 7 years ago committed by Facebook Github Bot
parent 2defebe9e7
commit 2ba4d7b0f1

@ -2417,7 +2417,7 @@ and sigma_imply tenv calc_index_frame calc_missing subs prop1 sigma2 : subst2 *
Sil.Hpointsto (root, sexp, const_string_texp)
in
let mk_constant_class_hpred s =
(* creat an hpred from a constant class *)
(* create an hpred from a constant class *)
let root = Exp.Const (Const.Cclass (Ident.string_to_name s)) in
let sexp =
(* TODO: add appropriate fields *)

@ -95,11 +95,11 @@ val check_implication_for_footprint :
frame)] where [sub] is a substitution which instantiates the
primed vars of [p1] and [p2], which are assumed to be disjoint. *)
(** {2 Cover: miminum set of pi's whose disjunction is equivalent to true} *)
(** {2 Cover: minimum set of pi's whose disjunction is equivalent to true} *)
val find_minimum_pure_cover :
Tenv.t -> (Sil.atom list * 'a) list -> (Sil.atom list * 'a) list option
(** Find miminum set of pi's in [cases] whose disjunction covers true *)
(** Find minimum set of pi's in [cases] whose disjunction covers true *)
(** {2 Compute various lower or upper bounds} *)

@ -1100,7 +1100,7 @@ let pp_rearrangement_error message prop lexp =
L.d_ln ()
(** do re-arrangment for an iter whose current element is a pointsto *)
(** do re-arrangement for an iter whose current element is a pointsto *)
let iter_rearrange_ptsto pname tenv orig_prop iter lexp inst =
if Config.trace_rearrange then (
L.d_increase_indent 1 ;

@ -179,7 +179,7 @@ val get_ret_type : summary -> Typ.t
(** Get the return type of the procedure *)
val get_formals : summary -> (Mangled.t * Typ.t) list
(** Get the formal paramters of the procedure *)
(** Get the formal parameters of the procedure *)
val get_phase : summary -> phase
(** Return the current phase for the proc *)

Loading…
Cancel
Save