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/ProofStrategy.ml.html
Source file ProofStrategy.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 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616
(**************************************************************************) (* *) (* 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 open Cil_datatype open Logic_typing open Logic_ptree open Pattern module D = Datatype (* -------------------------------------------------------------------------- *) (* --- Proof Strategy Engine --- *) (* -------------------------------------------------------------------------- *) type 'a loc = { loc : location ; value : 'a } (* Abstract Syntax Tree: must be stdlib-marshallable *) type strategy = { name: string loc ; alternatives: alternative list ; } and alternative = | Default | Strategy of string loc | Provers of string loc list * float option (* timeout *) | Auto of string loc (* deprecated -wp-auto *) | Tactic of { tactic : string loc ; lookup : lookup list ; select : value list ; params : (string loc * value) list ; children : (string loc * string loc) list ; (* name prefix and strategy *) default: string loc option; (* None is default *) } type hint = string * string list (* strategy name, targets *) (* -------------------------------------------------------------------------- *) (* --- Registry --- *) (* -------------------------------------------------------------------------- *) (* Strategies applies to all projects *) let kid = ref 0 let hid : (int,hint) Hashtbl.t = Hashtbl.create 0 let sid : (int,strategy) Hashtbl.t = Hashtbl.create 0 let strategies : (string,strategy) Hashtbl.t = Hashtbl.create 0 let revhints : hint list ref = ref [] (* -------------------------------------------------------------------------- *) (* --- Printers --- *) (* -------------------------------------------------------------------------- *) let pp_name fmt { value = s } = Format.pp_print_string fmt s let pp_quoted fmt { value = s } = Format.fprintf fmt "%S" s let pp_lookup fmt = function | { head = true ; goal = true ; hyps = false ; pattern } -> Format.fprintf fmt "\\goal(%a)" Pattern.pp_pattern pattern | { head = true ; goal = false ; pattern } -> Format.fprintf fmt "\\when(%a)" Pattern.pp_pattern pattern | { head = false ; goal = true ; hyps = false ; pattern } -> Format.fprintf fmt "\\ingoal(%a)" Pattern.pp_pattern pattern | { head = false ; goal = false ; pattern } -> Format.fprintf fmt "\\incontext(%a)" Pattern.pp_pattern pattern | { goal = true ; hyps = true ; pattern } -> Format.fprintf fmt "\\pattern(%a)" Pattern.pp_pattern pattern let pp_select fmt s = Format.fprintf fmt "\\select(%a)" Pattern.pp_value s let pp_param fmt (p,v) = Format.fprintf fmt "\\param(%a,%a)" pp_quoted p Pattern.pp_value v let pp_child fmt (p,s) = Format.fprintf fmt "\\child(%a,%a)" pp_quoted p pp_name s let pp_children fmt s = Format.fprintf fmt "\\children(%a)" pp_name s let pp_alternative fmt = function | Default -> Format.fprintf fmt "\\default" | Strategy s -> pp_name fmt s | Auto { value = s } -> Format.fprintf fmt "\\auto(%S)" s | Provers([],None) -> Format.fprintf fmt "\\prover()" | Provers([],Some tm) -> Format.fprintf fmt "\\prover(%.1f)" tm | Provers(p::ps,None) -> Format.fprintf fmt "@[<hov 2>\\prover(%a" pp_quoted p ; List.iter (Format.fprintf fmt ",@,%a" pp_quoted) ps ; Format.fprintf fmt ")@]" ; | Provers(ps,Some tm) -> Format.fprintf fmt "@[<hov 2>\\prover(" ; List.iter (Format.fprintf fmt "%a,@," pp_quoted) ps ; Format.fprintf fmt "%.1f)@]" tm ; | Tactic { tactic ; lookup ; select ; params ; children ; default } -> Format.fprintf fmt "@[<hv 2>\\tactic(%a" pp_quoted tactic ; List.iter (Format.fprintf fmt ",@ %a" pp_lookup) lookup ; List.iter (Format.fprintf fmt ",@ %a" pp_select) select ; List.iter (Format.fprintf fmt ",@ %a" pp_param) params ; List.iter (Format.fprintf fmt ",@ %a" pp_child) children ; Option.iter (Format.fprintf fmt ",@ %a" pp_children) default ; Format.fprintf fmt "@,)@]" let pp_strategy fmt s = Format.fprintf fmt "%s:@ " s.name.value ; Pretty_utils.pp_list ~sep:",@ " pp_alternative fmt s.alternatives let re_ident = Str.regexp "[_a-zA-Z][_a-zA-Z0-9]*$" let pp_option fmt s = if Str.string_match re_ident s 0 then Format.pp_print_string fmt s else Format.fprintf fmt "%S" s let pp_hint fmt ((s,ps): hint) = Format.fprintf fmt "%s:@ " s ; Pretty_utils.pp_list ~sep:",@ " pp_option fmt ps (* -------------------------------------------------------------------------- *) (* --- Alternative Parser --- *) (* -------------------------------------------------------------------------- *) let debug fmt p = Format.fprintf fmt "@[<hov 2>at: %a@]" Logic_print.print_lexpr p let rec parse_provers ctxt provers timeout = function | [] -> List.rev provers,timeout | p::ps -> let loc = p.lexpr_loc in match p.lexpr_node with | PLconstant (IntConstant t) -> let time = try int_of_string t with Invalid_argument _ -> ctxt.error loc "Invalid timeout" in if time < 0 then ctxt.error loc "Invalid timeout" ; if timeout <> None then ctxt.error loc "Duplicate timeout" ; parse_provers ctxt provers (Some (float time)) ps | PLconstant (FloatConstant t) -> let time = try float_of_string t with Invalid_argument _ -> ctxt.error loc "Invalid timeout" in if time < 0.0 then ctxt.error loc "Invalid timeout" ; if timeout <> None then ctxt.error loc "Duplicate timeout" ; parse_provers ctxt provers (Some time) ps | PLconstant (StringConstant value) -> parse_provers ctxt ( { loc ; value } :: provers ) timeout ps | _ -> ctxt.error loc "Invalid prover specification (%a)" debug p let parse_name ctxt ~kind ?check p = let loc = p.lexpr_loc in match p.lexpr_node with | PLvar value | PLapp(value,[],[]) | PLconstant(StringConstant value) -> Option.iter (fun f -> f loc value) check ; { loc ; value } | _ -> ctxt.error loc "%s name expected (%a)" kind debug p let parse_lookup penv ?(head=true) ?(goal=false) ?(hyps=false) ?(split=false) p = { goal ; hyps ; head ; split ; pattern = Pattern.pa_pattern penv p } let autoselect select lookup = match select , lookup with | [] , p::ps -> let q,v = Pattern.self p.pattern in [v] , { p with pattern = q }::ps | _ -> select, lookup let rec parse_tactic_params ctxt penv ~tactic ~select ~lookup ~params ~children ~default ps = match ps with | [] -> let select = List.rev select in let lookup = List.rev lookup in let select,lookup = autoselect select lookup in Tactic { tactic ; select ; lookup ; params = List.rev params ; children = List.rev children ; default ; } | p::ps -> let loc = p.lexpr_loc in let cc = parse_tactic_params ctxt penv ~tactic in match p.lexpr_node with | PLapp("\\goal",[],qs) -> let qs = List.map (parse_lookup ~goal:true penv) qs in let lookup = List.rev_append qs lookup in cc ~select ~lookup ~params ~children ~default ps | PLapp("\\when",[],qs) -> let qs = List.map (parse_lookup ~hyps:true ~split:true penv) qs in let lookup = List.rev_append qs lookup in cc ~select ~lookup ~params ~children ~default ps | PLapp("\\ingoal",[],qs) -> let qs = List.map (parse_lookup ~head:false ~goal:true penv) qs in let lookup = List.rev_append qs lookup in cc ~select ~lookup ~params ~children ~default ps | PLapp("\\incontext",[],qs) -> let qs = List.map (parse_lookup ~head:false ~hyps:true ~split:true penv) qs in let lookup = List.rev_append qs lookup in cc ~select ~lookup ~params ~children ~default ps | PLapp("\\pattern",[],qs) -> let qs = List.map (parse_lookup ~head:false ~goal:true ~hyps:true penv) qs in let lookup = List.rev_append qs lookup in cc ~select ~lookup ~params ~children ~default ps | PLapp("\\select",[],vs) -> let vs = List.map (Pattern.pa_value penv) vs in let select = List.rev_append vs select in cc ~select ~lookup ~params ~children ~default ps | PLapp("\\param",[],[param;value]) -> let param = parse_name ctxt ~kind:"Parameter" param in let value = Pattern.pa_value penv value in let params = (param,value)::params in cc ~select ~lookup ~params ~children ~default ps | PLapp("\\child",[],[prefix;strategy]) -> let subgoal = parse_name ctxt ~kind:"Subgoal" prefix in let strategy = parse_name ctxt ~kind:"Strategy" strategy in let children = (subgoal,strategy)::children in cc ~select ~lookup ~params ~children ~default ps | PLapp("\\children",[],[strategy]) -> if default <> None then ctxt.error loc "Duplicate \\children parameter" ; let default = Some (parse_name ctxt ~kind:"Strategy" strategy) in cc ~select ~lookup ~params ~children ~default ps | _ -> ctxt.error loc "Tactic parameter expected (%a)" debug p let parse_alternatives ctxt p = let loc = p.lexpr_loc in match p.lexpr_node with | PLvar("\\default") -> [ Default ] | PLapp("\\prover",[],ps) -> let prvs,timeout = parse_provers ctxt [] None ps in [ Provers(prvs,timeout) ] | PLapp("\\tactic",[],p::ps) -> let tactic = parse_name ctxt ~kind:"tactic" p in [ parse_tactic_params ctxt (Pattern.context ctxt) ~tactic ~select:[] ~lookup:[] ~params:[] ~children:[] ~default:None ps ] | PLapp("\\auto",[],ps) -> List.map (fun p -> Auto (parse_name ctxt ~kind:"auto" p)) ps | PLvar value | PLapp(value,[],[]) -> [ Strategy { loc ; value } ] | _ -> ctxt.error loc "Strategy definition expected (%a)" debug p (* -------------------------------------------------------------------------- *) (* --- Strategy Parser --- *) (* -------------------------------------------------------------------------- *) let parse_strategy_name ctxt loc = function | [] -> ctxt.error loc "Empty strategy" | p::ps -> match p.lexpr_node with | PLnamed(value,p) -> { loc ; value }, p::ps | _ -> ctxt.error loc "Missing strategy name (%a)" debug p let parse_strategy ctxt loc ps = let name,ps = parse_strategy_name ctxt loc ps in try let old = Hashtbl.find strategies name.value in ctxt.error loc "Duplicate strategy definition ('%s', at %a)" name.value Location.pretty old.name.loc with Not_found -> let alternatives = List.concat @@ List.map (parse_alternatives ctxt) ps in let strategy = { name ; alternatives } in let id = incr kid ; !kid in Hashtbl.add strategies name.value strategy ; Hashtbl.add sid id strategy ; Ext_id id (* -------------------------------------------------------------------------- *) (* --- Proof Parser --- *) (* -------------------------------------------------------------------------- *) let parse_hints ctxt p = let loc = p.lexpr_loc in match p.lexpr_node with | PLvar x -> [x] | PLconstant(StringConstant x) -> String.split_on_char ',' x | _ -> ctxt.error loc "Proof hint expected (see -wp-prop) (%a)" debug p let parse_proofs ctxt loc ps = let name , ps = parse_strategy_name ctxt loc ps in let strategy = name.value in if not (Hashtbl.mem strategies strategy) then ctxt.error name.loc "Unknown strategy '%s'" strategy ; let props = List.concat @@ List.map (parse_hints ctxt) ps in let hint = (strategy, props) in revhints := hint :: !revhints ; let id = incr kid ; !kid in Hashtbl.add hid id hint ; Ext_id id (* -------------------------------------------------------------------------- *) (* --- Strategy ACSL Extensions --- *) (* -------------------------------------------------------------------------- *) let registered = ref false let register () = if not !registered && Wp_parameters.StrategyEngine.get () then begin registered := true ; let printer hmap pp _ fmt = function | Ext_id id -> Option.iter (pp fmt) (Hashtbl.find_opt hmap id) | _ -> () in Acsl_extension.register_global ~plugin:"wp" "strategy" ~printer:(printer sid pp_strategy) parse_strategy false ; Acsl_extension.register_global ~plugin:"wp" "proof" ~printer:(printer hid pp_hint) parse_proofs false ; end let () = Cmdline.run_after_configuring_stage register (* -------------------------------------------------------------------------- *) (* --- Strategy Resolution --- *) (* -------------------------------------------------------------------------- *) let name s = s.name.value let loc s = s.name.loc let find = Hashtbl.find_opt strategies let resolve name = try Some (Hashtbl.find strategies name.value) with Not_found -> Wp_parameters.error ~source:(fst name.loc) ~once:true "Strategy '%s' undefined (skipped)." name.value ; None let resolve_auto name = try Some (Strategy.lookup ~id:name.value) with Not_found -> Wp_parameters.error ~source:(fst name.loc) ~once:true "Auto-Strategy '%s' not found (skipped)." name.value ; None let resolve_prover name = let result = VCS.parse_prover name.value in if result = None then Wp_parameters.error ~source:(fst name.loc) ~once:true "Prover '%s' not found (skipped)." name.value ; result let resolve_tactic name = try Some (Tactical.lookup ~id:name.value) with Not_found -> Wp_parameters.error ~source:(fst name.loc) ~once:true "Tactical '%s' not found (skipped alternative)." name.value ; None (* -------------------------------------------------------------------------- *) (* --- Strategy Checking --- *) (* -------------------------------------------------------------------------- *) let check_prover p = ignore @@ resolve_prover p let check_strategy s = ignore @@ resolve s let check_parameter env (t : Tactical.tactical) (p,v) = try let prm = List.find (fun q -> Tactical.pident q = p.value) t#params in match prm with | Checkbox _ -> Pattern.typecheck_value env ~tau:Qed.Logic.Bool v | _ -> () with Not_found -> Wp_parameters.error ~source:(fst p.loc) ~once:true "Parameter '%s' not found in tactic '%s'" p.value t#id let check_alternative = function | Default -> () | Strategy s -> ignore @@ resolve s | Auto s -> ignore @@ resolve_auto s | Provers(pvs,_) -> List.iter check_prover pvs | Tactic { tactic ; lookup ; params ; children ; default } -> begin let env = Pattern.env () in List.iter (Pattern.typecheck_lookup env) lookup ; Option.iter (fun tactical -> List.iter (check_parameter env tactical) params ; ) (resolve_tactic tactic) ; List.iter (fun (_,s) -> check_strategy s) children ; Option.iter check_strategy default ; end let typecheck () = Hashtbl.iter (fun _ s -> List.iter check_alternative s.alternatives) strategies (* -------------------------------------------------------------------------- *) (* --- Strategy Hints --- *) (* -------------------------------------------------------------------------- *) let iter f = let module M = Map.Make(String) in let pool = ref M.empty in Hashtbl.iter (fun a s -> pool := M.add a s !pool) strategies ; M.iter (fun _ s -> f s) !pool let default () = List.filter_map (fun s -> try Some (Hashtbl.find strategies s) with Not_found -> Wp_parameters.warning ~current:false ~once:true "Invalid -wp-strategy '%s' (undefined strategy name)" s ; None ) @@ Wp_parameters.DefaultStrategies.get () let hints ?node goal = let smoke = Wpo.is_smoke_test goal in let pool = ref [] in let add s = if not @@ List.memq s !pool then pool := s :: !pool in let addname name = Option.iter add @@ Hashtbl.find_opt strategies name in Option.iter addname (Option.bind node ProofEngine.get_hint) ; let pid = goal.Wpo.po_pid in List.iter (fun (name,ps) -> if not smoke || List.mem "smoke" ps then if WpPropId.select_by_name ps pid then addname name ) !revhints ; if not smoke then List.iter add @@ List.rev @@ default () ; List.rev !pool let has_hint goal = let smoke = Wpo.is_smoke_test goal in let pid = goal.Wpo.po_pid in List.exists (fun (_,ps) -> (not smoke || List.mem "smoke" ps) && WpPropId.select_by_name ps pid ) !revhints (* -------------------------------------------------------------------------- *) (* --- Strategy Forward Step --- *) (* -------------------------------------------------------------------------- *) let alternatives s = s.alternatives let timeout = function | Some tm -> tm | None -> float @@ Wp_parameters.Timeout.get () let provers ?(default=[]) = function | Provers([],tm) -> default, timeout tm | Provers(ps,tm) -> List.filter_map resolve_prover ps, timeout tm | Default | Strategy _ | Tactic _ | Auto _ -> [],0.0 let fallback = function | Strategy s -> resolve s | Tactic _ | Auto _ | Provers _ -> None | Default -> Some { name = { value = "\\default" ; loc = Position.(unknown,unknown) } ; alternatives = List.map (fun s -> Strategy s.name) @@ default () ; } let auto = function | Default | Strategy _ | Tactic _ | Provers _ -> None | Auto s -> resolve_auto s (* -------------------------------------------------------------------------- *) (* --- Strategy Tactical Step --- *) (* -------------------------------------------------------------------------- *) let dkey_tactical = Wp_parameters.register_category "tactical" let tactical a = match resolve_tactic a with None -> raise Not_found | Some t -> t let parameter (t : Tactical.tactical) a = try List.find (fun p -> Tactical.pident p = a.value) t#params with Not_found -> Wp_parameters.error ~source:(fst a.loc) ~once:true "Parameter '%s' not found (skipped alternative)." a.value ; raise Not_found let rec bind sigma sequent = function | [] -> sigma | lookup::binders -> match Pattern.psequent lookup sigma sequent with | None -> Wp_parameters.debug ~dkey:dkey_tactical "[failed] %a@." pp_lookup lookup ; raise Not_found | Some sigma -> Wp_parameters.debug ~dkey:dkey_tactical "[found] %a@." pp_lookup lookup ; bind sigma sequent binders let select sigma ?goal = function | [] -> begin match goal with | None -> Tactical.Empty | Some p -> Tactical.(Clause (Goal p)) end | [v] -> Pattern.select sigma v | vs -> Tactical.Multi (List.map (Pattern.select sigma) vs) let configure tactic sigma (a,v) = match parameter tactic a with | Checkbox fd -> begin try tactic#set_field fd (Pattern.bool v) with Not_found -> Wp_parameters.error ~source:(fst a.loc) "Expected boolean for parameter '%s' (%a)" a.value Pattern.pp_value v ; raise Not_found end | Spinner(fd,_) -> begin let value = Pattern.select sigma v in match Tactical.get_int value with | Some v -> tactic#set_field fd v | None -> Wp_parameters.error ~source:(fst a.loc) "Expected integer for parameter '%s'@ (%a)" a.value Tactical.pp_selection value ; raise Not_found end | Composer(fd,_) -> tactic#set_field fd (Pattern.select sigma v) | Selector(fd,vs,_) -> begin try let id = Pattern.string v in let v = List.find (fun v -> v.Tactical.vid = id) vs in tactic#set_field fd v.value with Not_found -> Wp_parameters.error ~source:(fst a.loc) "Expected string for parameter '%s'@ (%a)" a.value Pattern.pp_value v ; raise Not_found end | Search(fd,_,lookup) -> begin try let id = Pattern.string v in let v = lookup id in tactic#set_field fd (Some v) with Not_found -> Wp_parameters.error ~source:(fst a.loc) "Expected string for parameter '%s'@ (%a)" a.value Pattern.pp_value v ; raise Not_found end let subgoal (children : (string loc * string loc) list) (default : string loc option) (goal,node) = let hint = List.find_map (fun (g,s) -> if String.starts_with ~prefix:g.value goal then Some s else None ) children in begin match hint, default with | None, None -> () | Some s , _ | None , Some s -> if not @@ Hashtbl.mem strategies s.value then Wp_parameters.error ~source:(fst s.loc) "Unknown strategy '%s' (skipped)" s.value else ProofEngine.set_hint node s.value end ; node let tactic tree node strategy = function | Default | Strategy _ | Auto _ | Provers _ -> None | Tactic t -> try let tactic = tactical t.tactic in let pool = ProofEngine.pool tree in let title = tactic#title in let ctxt = ProofEngine.node_context node in let sequent = snd @@ Wpo.compute @@ ProofEngine.goal node in let console = new ProofScript.console ~pool ~title in let subgoals = WpContext.on_context ctxt begin fun () -> let sigma = bind Pattern.empty sequent t.lookup in let goal = if t.lookup = [] then Some (snd sequent) else None in let selection = select sigma ?goal t.select in List.iter (configure tactic sigma) t.params ; match Lang.local ~pool (tactic#select console) selection with | exception (Not_found | Exit) -> raise Not_found | Not_applicable -> raise Not_found | exception exn when Wp_parameters.protect exn -> Wp_parameters.warning ~source:(fst t.tactic.loc) "Tactical '%s' configuration error (%s)" t.tactic.value (Printexc.to_string exn) ; raise Not_found | Not_configured -> Wp_parameters.error ~source:(fst t.tactic.loc) "Tactical '%s' configuration error" t.tactic.value ; raise Not_found | Applicable process -> let strategy = strategy.name.value in let script = ProofScript.jtactic ~strategy tactic selection in let fork = ProofEngine.fork tree ~anchor:node script process in snd @@ ProofEngine.commit fork end () in Some (List.map (subgoal t.children t.default) subgoals) with Not_found -> None (* -------------------------------------------------------------------------- *)
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>