package electrod
Formal analysis for the Electrod formal pivot language
Install
Dune Dependency
Authors
Maintainers
Sources
electrod-0.4.1.tbz
sha256=b0bce9cc7126672feda5a02d5ef0c1131ba54db57654f80c0768c2f8d043cef9
sha512=92cc22f81522435e190039324767b6f69fa0b7d9dbfc3fb5561919823136fe492244dae993caf98633828e0090b67f306eec6270b86a1b2ff8630642130a3081
doc/src/electrod.libelectrod/Ast.ml.html
Source file Ast.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
(******************************************************************************* * electrod - a model finder for relational first-order linear temporal logic * * Copyright (C) 2016-2019 ONERA * Authors: Julien Brunel (ONERA), David Chemouil (ONERA) * * This Source Code Form is subject to the terms of the Mozilla Public * License, v. 2.0. If a copy of the MPL was not distributed with this * file, You can obtain one at http://mozilla.org/MPL/2.0/. * * SPDX-License-Identifier: MPL-2.0 * License-Filename: LICENSE.md ******************************************************************************) (** Definition of the type for Electrod models. *) open Containers module G = Gen_goal (* variables introduced by a binder *) type var = BVar of Var.t let bound_var v = BVar v let equal_var id1 id2 = match (id1, id2) with BVar v1, BVar v2 -> Var.equal v1 v2 (* any identifier: a binder-introduced variable or a set/relation name *) type ident = | Var of Var.t | Name of Name.t let var_ident i = Var i let name_ident i = Name i let var_ident_of_bound_var (BVar v) = Var v let equal_ident id1 id2 = match (id1, id2) with | Name n1, Name n2 -> Name.equal n1 n2 | Var v1, Var v2 -> Var.equal v1 v2 | Name _, _ | Var _, _ -> false type goal = (var, ident) G.t (* type of (well-formed) Electrod models *) type t = { file : string option ; (* table of relations indexed by names (remark: a {!Relation.t} also knows its own name) *) domain : Domain.t ; instance : Instance.t ; sym : Symmetry.t list ; invariants : (var, ident) G.fml list ; goal : goal ; atom_renaming : (Atom.t, Atom.t) List.Assoc.t ; name_renaming : (Name.t, Name.t) List.Assoc.t } let make file domain instance sym invariants goal = { file ; domain ; instance ; sym ; invariants ; goal ; atom_renaming = [] ; name_renaming = [] } (* pretty printers *) let pp_var out (BVar v) = Var.pp out v let pp_ident out = function | Name n -> Fmtc.(styled `Cyan Name.pp) out n | Var v -> Fmtc.(styled `Yellow pp_var) out (BVar v) let pp_goal = G.pp pp_var pp_ident let pp_fml = G.pp_fml pp_var pp_ident let pp_prim_fml = G.pp_prim_fml pp_var pp_ident let pp_exp = G.pp_exp pp_var pp_ident let pp_prim_exp = G.pp_prim_exp pp_var pp_ident let pp_iexp = G.pp_iexp pp_var pp_ident let pp_prim_iexp = G.pp_prim_iexp pp_var pp_ident let pp_block = G.pp_block pp_var pp_ident let pp_sim_binding = G.pp_sim_binding pp_var pp_ident let pp out { domain; instance; invariants; goal; _ } = let open Fmtc in pf out "%a@\n%a@\n%a@\n%a" Domain.pp domain Instance.pp instance ( vbox2 @@ styled `Bold @@ (const string "invariant" **< cut **< Fmtc.list pp_fml) ) invariants (vbox @@ pp_goal) goal (* substitution *) let substitute = object (_ : 'self) inherit [_] G.map method visit_'v _ = Fun.id method visit_'i _ = Fun.id method! visit_Ident (env : (Var.t, (var, ident) G.prim_exp) CCList.Assoc.t) (id : ident) = (* Msg.debug *) (* (fun m -> m "Ast.substitute.visit_Ident: %a [%a]" *) (* pp_ident id *) (* (List.pp *) (* @@ Fmt.pair ~sep:Fmtc.(const string "<-") Var.pp *) (* @@ pp_prim_exp) *) (* env); *) match id with | Var var when List.Assoc.mem ~eq:Var.equal var env -> List.Assoc.get_exn ~eq:Var.equal var env | Var _ | Name _ -> G.ident id (* method visit_exp env exp = *) (* Msg.debug *) (* (fun m -> m "Ast.substitute.visit_exp: %a [%a]" *) (* pp_exp exp *) (* (List.pp *) (* @@ Fmt.pair ~sep:Fmtc.(const string "<-") Var.pp *) (* @@ pp_prim_exp) *) (* env); *) (* super#visit_exp env exp *) (* method visit_prim_fml env pfml = *) (* Msg.debug *) (* (fun m -> m "%a [%a]" *) (* pp_prim_fml pfml *) (* (List.pp *) (* @@ Fmt.pair ~sep:Fmtc.(const string ":=") Var.pp *) (* @@ pp_prim_exp) *) (* env); *) (* super#visit_prim_fml env pfml *) (* |> Fun.tap (fun res -> *) (* Msg.debug (fun m -> *) (* m "%a [%a] --> %a" *) (* pp_prim_fml pfml *) (* (List.pp *) (* @@ Fmt.pair ~sep:Fmtc.(const string ":=") Var.pp *) (* @@ pp_prim_exp) env *) (* pp_prim_fml res *) (* )) *) end (* renames relation/set names *) let rename = object (_ : 'self) inherit [_] G.map method visit_'v _ (v : var) = v method visit_'i _ = Fun.id method! visit_Ident (relation_renaming : (Name.t, Name.t) List.Assoc.t) (id : ident) = match id with | Name name -> G.ident (Name (List.assoc ~eq:Name.equal name relation_renaming)) | Var _ -> G.ident id end
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>