package mopsa
MOPSA: A Modular and Open Platform for Static Analysis using Abstract Interpretation
Install
Dune Dependency
Authors
Maintainers
Sources
mopsa-analyzer-v1.1.tar.gz
md5=fdee20e988343751de440b4f6b67c0f4
sha512=f5cbf1328785d3f5ce40155dada2d95e5de5cce4f084ea30cfb04d1ab10cc9403a26cfb3fa55d0f9da72244482130fdb89c286a9aed0d640bba46b7c00e09500
doc/src/reduction/eval.ml.html
Source file eval.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
(****************************************************************************) (* *) (* 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/>. *) (* *) (****************************************************************************) (** Reduction rules for abstract evaluations *) open Core.All (** Manager used by reduction rules *) type 'a eval_reduction_man = { get_man : 't. 't id -> ('a, 't) man; (** Get the manger of a domain *) } module type EVAL_REDUCTION = sig val name : string (** Name of the reduction rule *) val reduce : expr -> ('a,'b) man -> 'a eval_reduction_man -> 'a flow -> expr list -> 'a flow -> 'a eval option (** [reduce e results man input_flow output_flow] reduces a product evaluation *) end (** {2 Registration} *) (** **************** *) (** Registered eval reductions *) let eval_reductions : (module EVAL_REDUCTION) list ref = ref [] (** Register a new eval reduction *) let register_eval_reduction rule = eval_reductions := rule :: !eval_reductions (** Find an eval reduction by its name *) let find_eval_reduction name = List.find (fun v -> let module V = (val v : EVAL_REDUCTION) in compare V.name name = 0 ) !eval_reductions let eval_reductions () = List.map (fun v -> let module D = (val v : EVAL_REDUCTION) in D.name ) !eval_reductions
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>