package mopsa

  1. Overview
  2. Docs
package mopsa
Legend:
Page
Library
Module
Module type
Parameter
Class
Class type
Source

Source file simplified_value.ml

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
(****************************************************************************)
(*                                                                          *)
(* This file is part of MOPSA, a Modular Open Platform for Static Analysis. *)
(*                                                                          *)
(* Copyright (C) 2017-2019 The MOPSA Project.                               *)
(*                                                                          *)
(* This program is free software: you can redistribute it and/or modify     *)
(* it under the terms of the GNU Lesser General Public License as published *)
(* by the Free Software Foundation, either version 3 of the License, or     *)
(* (at your option) any later version.                                      *)
(*                                                                          *)
(* This program 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.  See the            *)
(* GNU Lesser General Public License for more details.                      *)
(*                                                                          *)
(* You should have received a copy of the GNU Lesser General Public License *)
(* along with this program.  If not, see <http://www.gnu.org/licenses/>.    *)
(*                                                                          *)
(****************************************************************************)

(** Simplified signature of a value abstraction. *)

open Core.All
open Value


(*==========================================================================*)
(**                          {2 Value domain}                               *)
(*==========================================================================*)

module type SIMPLIFIED_VALUE =
sig

  (** {2 Header of the abstraction} *)
  (** ***************************** *)

  type t
  (** Type of the abstract value. *)

  val id : t id
  (** Identifier of the value domain *)

  val accept_type : typ -> bool
  (** Predicate of types abstracted by the value domain *)

  val name : string
  (** Name of the value domain *)

  val display : string
  (** Display name used in debug messages *)

  val bottom: t
  (** Least abstract element of the lattice. *)

  val top: t
  (** Greatest abstract element of the lattice. *)


  (** {2 Lattice operators} *)
  (** ********************* *)

  val is_bottom: t -> bool
  (** [is_bottom a] tests whether [a] is bottom or not. *)

  val subset: t -> t -> bool
  (** Partial order relation. [subset a1 a2] tests whether [a1] is
      related to (or included in) [a2]. *)

  val join: t -> t -> t
  (** [join a1 a2] computes an upper bound of [a1] and [a2]. *)

  val meet: t -> t -> t
  (** [meet a1 a2] computes a lower bound of [a1] and [a2]. *)

  val widen: 'a ctx -> t -> t -> t
  (** [widen ctx a1 a2] computes an upper bound of [a1] and [a2] that
      ensures stabilization of ascending chains. *)


  (** {2 Forward semantics} *)
  (** ********************* *)

  val constant : constant -> typ -> t
  val unop : operator -> typ -> t -> typ -> t
  val binop : operator -> typ -> t -> typ -> t -> typ -> t
  val filter : bool -> typ -> t -> t
  val avalue : 'r avalue_kind -> t -> 'r option


  (** {2 Backward semantics} *)
  (** ********************** *)

  val backward_unop  : operator -> typ -> t -> typ -> t -> t
  val backward_binop : operator -> typ -> t -> typ -> t -> typ -> t -> t * t
  val compare : operator -> bool -> typ -> t -> typ -> t -> (t * t)


  (** {2 Pretty printer} *)
  (** ****************** *)

  val print: printer -> t -> unit
  (** Printer of an abstract element. *)

end


let default_backward_unop op t a rt r = a
let default_backward_binop op t1 a1 t2 a2 rt r = (a1,a2)
let default_filter b t a = a
let default_compare op b t1 a1 t2 a2 = (a1,a2)

module DefaultValueFunctions =
struct
  let filter = default_filter
  let backward_unop = default_backward_unop
  let backward_binop = default_backward_binop
  let compare = default_compare
  let avalue avk v = None
end


(*==========================================================================*)
(**                    {2 Lifter to VALUE Signature}                        *)
(*==========================================================================*)

module MakeValue(V:SIMPLIFIED_VALUE) : VALUE with type t = V.t =
struct

  include Value.DefaultValueFunctions

  include V

  let eval man e =
    match ekind e with
    | E_constant c ->
      constant c e.etyp

    | E_unop(op,ee) when accept_type ee.etyp->
      unop op ee.etyp (man.eval ee |> man.get) e.etyp

    | E_binop(op,e1,e2) when accept_type e1.etyp && accept_type e2.etyp ->
      binop op e1.etyp (man.eval e1 |> man.get) e2.etyp (man.eval e2 |> man.get) e.etyp

    | _ -> top

  let backward man e ve r =
    if not (accept_type e.etyp) then ve else
    match ekind e with
    | E_unop(op,ee) when accept_type ee.etyp ->
      let vv,_ = find_vexpr ee ve in
      let vv' = backward_unop op ee.etyp vv e.etyp (man.get r) in
      refine_vexpr ee vv' ve

    | E_binop(op,e1,e2) when accept_type e1.etyp && accept_type e2.etyp ->
      let v1,_ = find_vexpr e1 ve in
      let v2,_ = find_vexpr e2 ve in
      let v1',v2' = backward_binop op e1.etyp v1 e2.etyp v2 e.etyp (man.get r) in
      refine_vexpr e1 v1' ve |>
      refine_vexpr e2 v2'

    | _ -> ve

  let compare man op b e1 v1 e2 v2 =
    compare op b e1.etyp v1 e2.etyp v2

end


(*==========================================================================*)
(**                          {2 Registration}                               *)
(*==========================================================================*)

let register_simplified_value_abstraction dom =
  register_value_abstraction (module MakeValue(val dom : SIMPLIFIED_VALUE))
OCaml

Innovation. Community. Security.

GitHub Discord Twitter Peertube RSS
About
Changelog Releases Industrial Users Academic Users Why OCaml
Ecosystem
Packages Community Events OCaml Planet Jobs
Resources
Install OCaml Get Started Platform Tools Language Manual Standard Library API Books Exercises Papers OCaml Playground Logo
Policies
Carbon Footprint Governance Privacy Code of Conduct