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
-
TThibaut Benjamin
-
AAllan Blanchard
-
LLionel Blatter
-
FFrançois Bobot
-
RRichard Bonichon
-
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
-
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
-
AAnne Pacalet
-
VValentin Perrelle
-
GGuillaume Petiot
-
DDario Pinto
-
VVirgile Prevosto
-
AArmand Puccetti
-
FFélix Ridoux
-
VVirgile Robles
-
MMuriel Roger
-
JJulien Signoles
-
NNicolas Stouls
-
KKostyantyn Vorobyov
-
BBoris Yakobowski
Maintainers
Sources
frama-c-27.1-Cobalt.tar.gz
sha256=5b13574a16a58971c27909bee94ae7f37b17d897852b40c768a3d4e2e09e39d2
doc/src/frama-c-wp.core/TacChoice.ml.html
Source file TacChoice.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
(**************************************************************************) (* *) (* This file is part of WP plug-in of Frama-C. *) (* *) (* Copyright (C) 2007-2023 *) (* 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 Lang open Conditions open Tactical (* -------------------------------------------------------------------------- *) (* --- Choice Tactical --- *) (* -------------------------------------------------------------------------- *) class choice = object inherit Tactical.make ~id:"Wp.choice" ~title:"Choice" ~descr:"Select a Goal Alternative" ~params:[] method select _feedback (s : Tactical.selection) = match s with | Inside(Goal p,q) -> begin match F.e_expr p with | Qed.Logic.Or qs when List.memq q qs -> Applicable (fun (hs,_) -> ["Choice",(hs,F.p_bool q)]) | _ -> Not_applicable end | Empty | Compose _ | Clause _ | Inside(Step _,_) | Multi _ -> Not_applicable end class absurd = object inherit Tactical.make ~id:"Wp.absurd" ~title:"Absurd" ~descr:"Contradict an Hypothesis" ~params:[] method select _feedback (s : Tactical.selection) = match s with | Empty | Compose _ | Inside _ | Clause(Goal _) | Multi _ -> Not_applicable | Clause(Step s) -> begin match s.condition with | Have p | When p | Core p | Init p | Type p -> let absurd seq = let emp = Conditions.(step (Have F.p_true)) in let seq = Conditions.replace ~at:s.id emp seq in [ "Absurd" , (fst seq , F.p_not p) ] in Applicable absurd | Branch _ | Either _ | State _ -> Not_applicable end end class contrapose = object inherit Tactical.make ~id:"Wp.contrapose" ~title:"Contrapose" ~descr:"Swap and Negate Hypothesis with Conclusion" ~params:[] method select _feedback (s : Tactical.selection) = match s with | Empty | Compose _ | Inside _ | Clause(Goal _) | Multi _ -> Not_applicable | Clause(Step s) -> begin match s.condition with | Have p | When p | Core p | Init p | Type p -> let contrapose (hs,goal) = let descr = "Contrapose" in let goal = F.p_not goal in let goal = Conditions.(step ~descr (Have goal)) in let hs = Conditions.replace ~at:s.id goal (hs , F.p_false) in [ "Contrapose" , (fst hs , F.p_not p) ] in Applicable contrapose | Branch _ | Either _ | State _ -> Not_applicable end end module Choice = struct let tactical = Tactical.export (new choice) let strategy = Strategy.make tactical ~arguments:[] end module Absurd = struct let tactical = Tactical.export (new absurd) let strategy = Strategy.make tactical ~arguments:[] end module Contrapose = struct let tactical = Tactical.export (new contrapose) let strategy = Strategy.make tactical ~arguments:[] end
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>