package codex

You can search for identifiers within the package.

in-package search v0.2.0

The Codex library for building static analysers based on abstract interpretation

Install

dune-project

Dependency

codex.top Edit opam file Versions (1)

Authors

Maintainers

M

Matthieu Lemerre <matthieu.lemerre@cea.fr>

Sources

1.0-rc4.tar.gz

md5=bc7266a140c6886add673ede90e335d3

sha512=8da42c0ff2c1098c5f9cb2b5b43b306faf7ac93b8f5ae00c176918cee761f249ff45b29309f31a05bbcf6312304f86a0d5a000eb3f1094d3d3c2b9b4c7f5c386

doc/src/codex.lattices/prod_Lattice.ml.html

Source file `prod_Lattice.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
(**************************************************************************)
(*  This file is part of the Codex semantics library.                     *)
(*                                                                        *)
(*  Copyright (C) 2013-2025                                               *)
(*    CEA (Commissariat à l'énergie atomique et aux énergies              *)
(*         alternatives)                                                  *)
(*                                                                        *)
(*  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, version 2.1.                                              *)
(*                                                                        *)
(*  It 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.                   *)
(*                                                                        *)
(*  See the GNU Lesser General Public License version 2.1                 *)
(*  for more details (enclosed in the file LICENSE).                      *)
(*                                                                        *)
(**************************************************************************)

(* Product with intersection semantics: elements are in the
   intersections of the concretizations. *)

open Lattice_sig;;
  
module Prod2(L1:JOIN_SEMI_LATTICE)(L2:JOIN_SEMI_LATTICE)
  :JOIN_SEMI_LATTICE with type t = L1.t * L2.t =
struct
  include Datatype_sig.Prod2(L1)(L2);;
  let includes (a1,a2) (b1,b2) = L1.includes a1 b1 && L2.includes a2 b2
  let widen ~previous:(a1,a2) (b1,b2) = (L1.widen ~previous:a1 b1),(L2.widen ~previous:a2 b2)
  let includes_or_widen ~previous next =
    if includes previous next then (true,previous)
    else (false,widen ~previous next)
  ;;
  let join (a1,a2) (b1,b2) = (L1.join a1 b1, L2.join a2 b2)
end

module Prod2_With_Bottom(L1:JOIN_SEMI_LATTICE_WITH_BOTTOM)(L2:JOIN_SEMI_LATTICE_WITH_BOTTOM) = struct
  include Datatype_sig.Prod2(L1)(L2);;
  let includes (a1,a2) (b1,b2) = L1.includes a1 b1 && L2.includes a2 b2
  let widen ~previous:(a1,a2) (b1,b2) = (L1.widen ~previous:a1 b1),(L2.widen ~previous:a2 b2)
  let includes_or_widen ~previous next =
    if includes previous next then (true,next)
    else (false,widen ~previous next)
  ;;

  let join (a1,a2) (b1,b2) = (L1.join a1 b1, L2.join a2 b2)
  let bottom () = L1.bottom (), L2.bottom ()
  let is_bottom (a,b) = L1.is_bottom a || L2.is_bottom b
end

module Prod2_With_Inter_Bottom
    (L1:JOIN_SEMI_LATTICE_WITH_INTER_BOTTOM)
    (L2:JOIN_SEMI_LATTICE_WITH_INTER_BOTTOM) = struct
  include Prod2_With_Bottom(L1)(L2);;
  let inter (a1,a2) (b1,b2) = (L1.inter a1 b1, L2.inter a2 b2)
end