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/TacClear.ml.html
Source file TacClear.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
(**************************************************************************) (* *) (* 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 Tactical open Conditions let condition original p = (* keep original kind of simple condition *) match original.condition with | Type _ -> Type p | Have _ -> Have p | When _ -> When p | Core _ -> Core p | Init _ -> Init p | _ -> assert false let tactical_step step = Tactical.replace_single ~at:step.id (* Note: the provided name is used in the GUi for the subgoal title *) ("Removed Step", Conditions.Have Lang.F.p_true) module Filtered = struct type t = | Fun of Lang.Fun.t | Other of Lang.F.term let of_term t = match Lang.F.repr t with | Qed.Logic.Fun(f, _) -> Fun f | _ -> Other t let pretty fmt = function | Fun f -> Format.fprintf fmt "%a(...)" Lang.Fun.pretty f | Other t -> Lang.F.pp_term fmt t let compare a b = match a, b with | Fun a, Fun b -> Lang.Fun.compare a b | Other a, Other b -> Lang.F.compare a b | Fun _, _ -> 1 | _, Fun _ -> -1 let equal a b = 0 = compare a b end module TermLset = Qed.Listset.Make(Lang.F.QED.Term) module Filteredset = Qed.Listset.Make(Filtered) let tactical_inside step remove = let remove = List.sort_uniq Lang.F.compare remove in let collect p = match Lang.F.p_expr p with | And ps -> ps | _ -> [ p ] in begin match step.condition with | Type p | Have p | When p | Core p | Init p -> let ps = Lang.F.e_props @@ collect p in let kept = TermLset.diff ps remove in let removed = let add s e = Filteredset.add (Filtered.of_term e) s in List.fold_left add Filteredset.empty remove in let feedback = let pp fmt f = Format.fprintf fmt "'%a'" Filtered.pretty f in Format.asprintf "Filtered: %a" (Pretty_utils.pp_list ~sep:", " pp) removed in let cond = condition step @@ Lang.F.p_bool @@ Lang.F.e_and kept in removed, Tactical.replace_single ~at:step.id (feedback, cond) | _ -> raise Not_found end module Smap = Qed.Idxmap.Make (struct type t = step let id s = s.id end) let collect_remove m = function | Inside(Step step, remove) -> let l = try Smap.find step m with Not_found -> [] in Smap.add step (remove :: l) m | _ -> raise Not_found let fold_selection s seq = let m = List.fold_left collect_remove Smap.empty s in let tactical s l (acc_rm, seq) = let rm, op = tactical_inside s l in Filteredset.union rm acc_rm, snd @@ op seq in let removed, seq = Smap.fold tactical m ([], seq) in let feedback = let pp fmt f = Format.fprintf fmt "'%a'" Filtered.pretty f in Format.asprintf "Filtered: %a" (Pretty_utils.pp_list ~sep:", " pp) removed in feedback, seq let process (f: sequent -> string * sequent) s = [ f s ] class clear = object(_) inherit Tactical.make ~id:"Wp.clear" ~title:"Clear" ~descr:"Remove the selected hypothesis." ~params:[] method select _feedback sel = match sel with | Clause(Step step) -> Applicable(process @@ tactical_step step) | Inside(Step step, remove) -> begin try Applicable(process @@ snd @@ tactical_inside step [remove]) with Not_found -> Not_applicable end | Multi es -> Applicable (process @@ fold_selection es) | _ -> Not_applicable end let tactical = Tactical.export (new clear)
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>