package goblint

  1. Overview
  2. Docs
Static analysis framework for C

Install 

dune-project
 Dependency

goblint.in.tum.de Edit opam file Versions (11)

Authors

  1. S
    Simmo Saan
  2. M
    Michael Schwarz
  3. J
    Julian Erhard
  4. S
    Sarah Tilscher
  5. K
    Karoliine Holter
  6. M
    Michael Petter
  7. A
    Ali Rasim Kocal
  8. R
    Ralf Vogler
  9. K
    Kalmer Apinis
  10. V
    Vesal Vojdani

Maintainers

  1. S
    Simmo Saan <simmo.saan@gmail.com>
  2. M
    Michael Schwarz <michael.schwarz93@gmail.com>
  3. K
    Karoliine Holter <karoliine.holter@ut.ee>

Sources

goblint-2.8.0.tbz
sha256=9175eec0143102243964e34a0786584fd590c60422009259c705a89a27f88de4
sha512=9d760007dd8d003cf596516444ed7acc7370fc3d446e75ac71b0176522c3baae090410762f9035e7aae4f6b0e394bf28bb5b1c08ca0476920b94aa919ef04f42

doc/goblint.lib/Goblint_lib/MyARG/index.html

Module Goblint_lib.MyARG

Abstract reachability graph.

module type Node = sig ... end
module type Edge = sig ... end
module CFGEdge : Edge with type t = MyCFG.edge
type inline_edge =
  1. | CFGEdge of Edge.t
  2. | InlineEntry of CilType.Lval.t option * CilType.Fundec.t * CilType.Exp.t list
  3. | InlineReturn of CilType.Lval.t option * CilType.Fundec.t * CilType.Exp.t list
  4. | InlinedEdge of Edge.t
  5. | ThreadEntry of CilType.Lval.t option * CilType.Varinfo.t * CilType.Exp.t list
val equal_inline_edge : inline_edge -> inline_edge -> Ppx_deriving_runtime.bool
val compare_inline_edge : inline_edge -> inline_edge -> Ppx_deriving_runtime.int
val hash_inline_edge : inline_edge -> int
val pretty_inline_edge : unit -> inline_edge -> GoblintCil.Pretty.doc
val inline_edge_to_yojson : inline_edge -> [> `Assoc of (string * [> `Assoc of (string * Yojson.Safe.t) list ]) list ]
module InlineEdge : Edge with type t = inline_edge
module type S = sig ... end
module StackNode (Node : Node) : Node with type t = Node.t list
module Stack (Arg : S with module Edge = InlineEdge) : S with module Node = StackNode(Arg.Node) and module Edge = Arg.Edge
module type IsInteresting = sig ... end
module InterestingArg (Arg : S) (IsInteresting : IsInteresting with type node := Arg.Node.t and type edge := Arg.Edge.t) : S with module Node = Arg.Node and module Edge = Arg.Edge
type cfg_path = (MyCFG.edge * MyCFG.node) list
module type SIntra = sig ... end
module type SIntraOpt = sig ... end
val cartesian_append : cfg_path list -> cfg_path list -> cfg_path list
val partition_if_next : (MyCFG.edge * 'a * 'b) list -> CilType.Exp.t * ('a * 'b) * ('a * 'b)
module Intra (ArgIntra : SIntraOpt) (Arg : S) : S with module Node = Arg.Node and module Edge = Arg.Edge