package frama-c
Platform dedicated to the analysis of source code written in C
Install
Dune 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
-
LLoïc Correnson
-
JJulien Crétin
-
PPascal Cuoq
-
ZZaynah Dargaye
-
BBasile Desloges
-
JJean-Christophe Filliâtre
-
PPhilippe Herrmann
-
MMaxime Jacquemin
-
FFlorent Kirchner
-
AAlexander Kogtenkov
-
RRemi Lazarini
-
TTristan Le Gall
-
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
-
JJulien Signoles
-
NNicolas Stouls
-
KKostyantyn Vorobyov
-
BBoris Yakobowski
Maintainers
Sources
frama-c-29.0-Copper.tar.gz
sha256=d2fbb3b8d0ff83945872e9e6fa258e934a706360e698dae3b4d5f971addf7493
doc/src/frama-c-wp.core/mcfg.ml.html
Source file mcfg.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
(**************************************************************************) (* *) (* This file is part of WP plug-in of Frama-C. *) (* *) (* Copyright (C) 2007-2024 *) (* CEA (Commissariat a l'energie atomique et aux energies *) (* 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 licenses/LGPLv2.1). *) (* *) (**************************************************************************) open Cil_types type scope = | SC_Global | SC_Frame_in | SC_Frame_out | SC_Block_in | SC_Block_out type effect_source = | FromCode | FromCall | FromReturn type terminates_source = | Loop | Terminates | Decreases | MissingTerminates | MissingDecreases | Dependencies type goal_source = | Effect of effect_source | Terminates of terminates_source module type Export = sig type pred type decl val export_section : Format.formatter -> string -> unit val export_goal : Format.formatter -> string -> pred -> unit val export_decl : Format.formatter -> decl -> unit end module type Splitter = sig type pred val simplify : pred -> pred val split : bool -> pred -> pred Bag.t end (** * This is what is really needed to propagate something through the CFG. * Usually, the propagated thing should be a predicate, * but it can be more sophisticated like lists of predicates, * or maybe a structure to keep hypotheses and goals separated. * Moreover, proof obligations may also need to be handled. **) module type S = sig type t_env type t_prop val pretty : Format.formatter -> t_prop -> unit val merge : t_env -> t_prop -> t_prop -> t_prop val empty : t_prop (** optionally init env with user logic variables *) val new_env : ?lvars:Cil_types.logic_var list -> kernel_function -> t_env val add_axiom : WpPropId.prop_id -> LogicUsage.logic_lemma -> unit val add_probe : t_env -> ?stmt:stmt -> string -> term -> t_prop -> t_prop val add_hyp : ?for_pid:WpPropId.prop_id -> t_env -> WpPropId.pred_info -> t_prop -> t_prop val add_goal : t_env -> WpPropId.pred_info -> t_prop -> t_prop val add_terminates_subgoal : t_env -> WpPropId.prop_id * 'a -> ?deps:Property.Set.t -> predicate -> stmt -> terminates_source -> t_prop -> t_prop val add_assigns : t_env -> WpPropId.assigns_info -> t_prop -> t_prop (** [use_assigns env hid kind assgn goal] performs the havoc on the goal. * [hid] should be [None] iff [assgn] is [WritesAny], * and tied to the corresponding identified_property otherwise.*) val use_assigns : t_env -> WpPropId.prop_id option -> WpPropId.assigns_desc -> t_prop -> t_prop val label : t_env -> stmt option -> Clabels.c_label -> t_prop -> t_prop val init : t_env -> varinfo -> init option -> t_prop -> t_prop val const : t_env -> varinfo -> t_prop -> t_prop val assign : t_env -> stmt -> lval -> exp -> t_prop -> t_prop val return : t_env -> stmt -> exp option -> t_prop -> t_prop val test : t_env -> stmt -> exp -> t_prop -> t_prop -> t_prop val switch : t_env -> stmt -> exp -> (exp list * t_prop) list -> t_prop -> t_prop val has_init : t_env -> bool val loop_entry : t_prop -> t_prop val loop_step : t_prop -> t_prop (* -------------------------------------------------------------------------- *) (* --- Call Rules --- *) (* -------------------------------------------------------------------------- *) val call_dynamic : t_env -> stmt -> WpPropId.prop_id -> exp -> (kernel_function * t_prop) list -> t_prop val call_goal_precond : t_env -> stmt -> kernel_function -> exp list -> pre: WpPropId.pred_info list -> t_prop -> t_prop val call_terminates : t_env -> stmt -> kind:terminates_source -> ?kf:kernel_function -> exp list -> WpPropId.pred_info -> callee_t:predicate -> t_prop -> t_prop val call_decreases : t_env -> stmt -> ?kf:kernel_function -> exp list -> WpPropId.variant_info -> ?caller_t: predicate -> ?callee_d: variant -> t_prop -> t_prop val call : t_env -> stmt -> lval option -> kernel_function -> exp list -> pre: WpPropId.pred_info list -> post: WpPropId.pred_info list -> pexit: WpPropId.pred_info list -> assigns: assigns -> p_post: t_prop -> p_exit: t_prop -> t_prop (* -------------------------------------------------------------------------- *) (* --- SCOPING RULES --- *) (* -------------------------------------------------------------------------- *) val scope : t_env -> varinfo list -> scope -> t_prop -> t_prop val close : t_env -> t_prop -> t_prop (* -------------------------------------------------------------------------- *) (* --- FROM --- *) (* -------------------------------------------------------------------------- *) (** build [p => alpha(p)] for functional dependencies verification. *) val build_prop_of_from : t_env -> WpPropId.pred_info list -> t_prop -> t_prop end
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>