package frama-c
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>
Platform dedicated to the analysis of source code written in C
Install
dune-project
Dependency
Authors
-
MMichele Alberti
-
TThibaud Antignac
-
GGergö Barany
-
PPatrick Baudin
-
NNicolas Bellec
-
TThibaut Benjamin
-
AAllan Blanchard
-
LLionel Blatter
-
FFrançois Bobot
-
RRichard Bonichon
-
VVincent Botbol
-
QQuentin Bouillaguet
-
DDavid Bühler
-
ZZakaria Chihani
-
SSylvain Chiron
-
LLoïc Correnson
-
JJulien Crétin
-
PPascal Cuoq
-
ZZaynah Dargaye
-
BBasile Desloges
-
JJean-Christophe Filliâtre
-
PPhilippe Herrmann
-
MMaxime Jacquemin
-
BBenjamin Jorge
-
FFlorent Kirchner
-
AAlexander Kogtenkov
-
RRemi Lazarini
-
TTristan Le Gall
-
KKilyan Le Gallic
-
JJean-Christophe Léchenet
-
MMatthieu Lemerre
-
DDara Ly
-
DDavid Maison
-
CClaude Marché
-
AAndré Maroneze
-
TThibault Martin
-
FFonenantsoa Maurica
-
MMelody Méaulle
-
BBenjamin Monate
-
YYannick Moy
-
PPierre Nigron
-
AAnne Pacalet
-
VValentin Perrelle
-
GGuillaume Petiot
-
DDario Pinto
-
VVirgile Prevosto
-
AArmand Puccetti
-
FFélix Ridoux
-
VVirgile Robles
-
JJan Rochel
-
MMuriel Roger
-
CCécile Ruet-Cros
-
JJulien Signoles
-
FFabien Siron
-
NNicolas Stouls
-
HHugo Thievenaz
-
KKostyantyn Vorobyov
-
BBoris Yakobowski
Maintainers
Sources
frama-c-32.0-beta-Germanium.tar.gz
sha256=868d57ef8007fe6c0836cd151d8c294003af34aa678285eff9547662cad36aa3
doc/src/frama-c-region.core/logic.ml.html
Source file logic.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 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278(**************************************************************************) (* *) (* SPDX-License-Identifier LGPL-2.1 *) (* Copyright (C) *) (* CEA (Commissariat à l'énergie atomique et aux énergies alternatives) *) (* *) (**************************************************************************) open Cil_types open Cil_datatype open Spec open Memory open Ldomain (* -------------------------------------------------------------------------- *) (* --- Process ACSL region annotations --- *) (* -------------------------------------------------------------------------- *) let rec add_path (m:map) (p:path): node = match p.step with | Var x -> add_cvar m x | Field(lv,fd) -> Memory.add_field (add_path m lv) fd | Index(lv,_) -> Memory.add_index (add_path m lv) lv.typ | Star e | Cast(_,e) -> add_pointer m e | Shift _ | AddrOf _ -> Options.error ~source:(fst p.loc) "Unexpected expression (l-value expected)" ; Memory.fresh m and add_pointer (m:map) (p:path): Memory.node = match add_exp m p with | None -> Memory.fresh m | Some r -> r and add_exp (m:map) (p:path): Memory.node option = match p.step with | (Var _ | Field _ | Index _ | Star _ | Cast _) -> let r = add_path m p in add_value r p.typ | AddrOf p -> Some (add_path m p) | Shift p -> add_exp m p let add_region (m: map) (r : Spec.region) = let rs = List.map (add_path m) r.rpath in merge_all @@ match r.rname with | None -> rs | Some a -> add_label m a :: rs (* -------------------------------------------------------------------------- *) (* --- Process ACSL logic terms & predicates --- *) (* -------------------------------------------------------------------------- *) type result = node option type env = { map : map ; result : result ; formal : domain Varinfo.Map.t ; property : Property.t ; } let fresh env () = Memory.fresh env.map let merge a b = Memory.merge a b ; min a b let pointer (d:domain) : node = match Ldomain.pointed merge d with | Some p -> p | None -> Options.abort "Not a pointer value" type lv_value = | VAL of domain | VAR of varinfo let logic_var env lv = match lv.lv_origin with | None -> VAL (Memory.add_logic_var env.map lv) | Some x -> if x.vformal then try VAL (Varinfo.Map.find x env.formal) with Not_found -> VAR x else VAR x let rec load env lv (ty:typ) r : domain = match Ast_types.unroll_node ty with | TArray(te,_) -> let r' = Memory.add_index r ty in let ofs = TIndex (Logic_const.trange (None,None), TNoOffset) in let lv = Logic_const.addTermOffsetLval ofs lv in array (load env lv te r') | TComp { cfields } -> let add_field d fd = let ofs = TField (fd,TNoOffset) in let lv = Logic_const.addTermOffsetLval ofs lv in merge_domain d @@ Ldomain.field fd @@ load env lv fd.ftype @@ Memory.add_field r fd in List.fold_left add_field pure @@ Option.value ~default:[] cfields | _ -> let acs = Access.Term (env.property, lv) in Memory.add_read r acs ; Ldomain.scalar @@ Memory.add_value r ty let rterm = ref (fun _ _ -> assert false) let rec addr_offset (env:env) (ty:typ) (r:node) = function | TNoOffset -> r | TModel _ -> Options.not_yet_implemented "Model field" | TField (f,offset) -> addr_offset env f.ftype (Memory.add_field r f) offset | TIndex(k,offset) -> ignore @@ !rterm env k ; let te = Ast_types.direct_element_type ty in addr_offset env te (Memory.add_index r ty) offset let rec term_offset (env:env) (d:domain) = function | TNoOffset -> d | TModel _ -> Options.not_yet_implemented "Model field" | TField (f,offset) -> term_offset env (Ldomain.get_field merge d f) offset | TIndex(k,offset) -> ignore @@ !rterm env k ; term_offset env (Ldomain.get_index merge d) offset let get_result env = match env.result with | None -> Memory.add_result env.map | Some r -> r let add_term_lval (env:env) lv = let (lhost,loffset) = lv in let lvh = (lhost,TNoOffset) in match lhost with | TResult ty -> load env lvh ty @@ addr_offset env ty (get_result env) loffset | TMem e -> let rh = pointer (!rterm env e) in let te = Logic_typing.ctype_of_pointed e.term_type in load env lvh te @@ addr_offset env te rh loffset | TVar v -> begin match logic_var env v with | VAL d -> term_offset env d loffset | VAR x -> let rh = Memory.add_cvar env.map x in load env lvh x.vtype @@ addr_offset env x.vtype rh loffset end let add_addr_lval (env:env) (lhost,loffset) : node = match lhost with | TResult ty -> addr_offset env ty (get_result env) loffset | TMem e -> let rh = pointer (!rterm env e) in let te = Logic_typing.ctype_of_pointed e.term_type in addr_offset env te rh loffset | TVar lv -> begin match logic_var env lv with | VAL d -> let te = Logic_utils.logicCType lv.lv_type in addr_offset env te (pointer d) loffset | VAR x -> addr_offset env x.vtype (Memory.add_cvar env.map x) loffset end let rec add_loffset (env:env) loffest d = match loffest with | TNoOffset -> d | TField(fd,offset) -> Ldomain.field fd @@ add_loffset env offset d | TModel _ -> Options.abort "Region.Logic.add_loffset: TModel not implemented" | TIndex(_,offset) -> Ldomain.array @@ add_loffset env offset d let call (env:env) (l:logic_info) (ds:domain list) : domain = let sigma = ref Ldomain.empty in let unify = Ldomain.unify merge sigma in List.iter2 (fun x -> unify (Memory.add_logic_var env.map x)) l.l_profile ds ; Ldomain.subst !sigma @@ Memory.add_logic_info env.map l let iadd_logic_var m v = ignore @@ add_logic_var m v let rec add_term (env:env) (t:term) : domain = match t.term_node with | TConst _ | TSizeOf _ | TSizeOfE _ | TAlignOf _ | TAlignOfE _ | Tnull | Tempty_set | Ttypeof _ | Ttype _ | Trange _ -> pure | TLval lval -> add_term_lval env lval | TAddrOf lval | TStartOf lval -> ptr @@ add_addr_lval env lval | Tif (b,ct,cf) -> iadd_term env b ; let dt = add_term env ct in let df = add_term env cf in merge_domain dt df | TUnOp(_,t) | TCast(_,_,t) | Tat(t,_) -> add_term env t | TBinOp ((PlusPI|MinusPI),t1,t2) -> let d1 = add_term env t1 in let d2 = add_term env t2 in merge_domain d1 d2 | TBinOp(_,t1,t2) -> iadd_term env t1 ; iadd_term env t2 ; pure | Tbase_addr(_,t) | Toffset (_,t) | Tblock_length(_,t) -> iadd_term env t ; pure | TUpdate(lv,o,v) -> merge_domain (add_term env lv) @@ add_loffset env o @@ add_term env v | Tunion ts | Tinter ts -> List.fold_left (fun d t -> merge_domain d @@ add_term env t) pure ts | Tcomprehension(t,q,p) -> Option.iter (add_predicate env) p ; List.iter (iadd_logic_var env.map) q ; add_term env t | Tapp(f,_,ts) -> call env f @@ List.map (add_term env) ts | Tlambda(q,t) -> Ldomain.arrow (List.map (Memory.add_logic_var env.map) q) @@ add_term env t | Tlet({ l_body ; l_var_info=v },b) -> begin match l_body with | LBterm a -> let dv = add_logic_var env.map v in let da = add_term env a in let sigma = ref Ldomain.empty in Ldomain.unify merge sigma da dv ; Ldomain.subst !sigma @@ add_term env b | LBpred p -> iadd_logic_var env.map v ; add_predicate env p ; add_term env t | _ -> Options.abort "Logic.add_term: Tlet without term nor predicate" end | TDataCons(c,ts) -> let ds = List.map (add_term env) ts in let args = List.map (of_ltype (fresh env)) c.ctor_params in let sigma = ref Ldomain.empty in List.iter2 (unify merge sigma) ds args ; match c.ctor_type.lt_def with | Some (LTsyn lt) -> of_ltype (fresh env) lt | None | Some (LTsum _) -> pure and iadd_term env t = ignore @@ add_term env t and add_predicate (env:env) (p:predicate) = match p.pred_content with | Pfalse | Ptrue -> () | Pseparated ts -> List.iter (iadd_term env) ts | Prel(_,t1,t2) | Pfresh(_,_,t1,t2) -> iadd_term env t1 ; iadd_term env t2 | Pand(p1,p2) | Por(p1,p2) | Pxor(p1,p2) | Piff(p1,p2) | Pimplies(p1,p2) -> add_predicate env p1 ; add_predicate env p2 ; | Pnot p | Pat(p,_) -> add_predicate env p | Pif(c,pt,pf) -> iadd_term env c ; add_predicate env pt ; add_predicate env pf ; | Pobject_pointer(_,t) | Pvalid(_,t) | Pvalid_read(_,t) | Paligned(t, _) | Pvalid_function t | Pinitialized(_,t) | Pdangling(_,t) | Pallocable(_,t) | Pfreeable(_,t) -> iadd_term env t | Pforall (q,p) | Pexists (q,p) -> List.iter (iadd_logic_var env.map) q ; add_predicate env p | Plet({ l_var_info = v ; l_body = LBterm t ; },p2) -> let dv = add_logic_var env.map v in let dt = add_term env t in let sigma = ref empty in Ldomain.unify merge sigma dt dv ; add_predicate env p2 | Plet({ l_var_info = v ; l_body = LBpred p1 ; },p2) -> iadd_logic_var env.map v ; add_predicate env p1 ; add_predicate env p2 | Plet({ l_body = LBnone ; },p2) -> add_predicate env p2 | Plet _ -> Options.abort "Logic.add_predicate: (%a) not yet implemented" Printer.pp_predicate p | Papp(f,_,ts) -> ignore @@ call env f @@ List.map (add_term env) ts let () = rterm := add_term (* -------------------------------------------------------------------------- *) (* --- Process ACSL logic --- *) (* -------------------------------------------------------------------------- *) let add_logic_info_body (env:env) (l:logic_info) : domain = match l.l_body with | LBnone -> pure | LBpred p -> add_predicate env p ; pure | LBterm t -> add_term env t | LBreads ts -> List.iter (fun t -> iadd_term env t.it_content) ts ; pure | LBinductive l -> List.iter (fun (_,_,_,t) -> add_predicate env t) l ; pure
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>