package goblint

  1. Overview
  2. Docs
Static analysis framework for C

Install 

dune-project
 Dependency

goblint.in.tum.de Readme Changelog Edit opam file Versions (9)

Authors

  1. S
    Simmo Saan
  2. M
    Michael Schwarz
  3. J
    Julian Erhard
  4. S
    Sarah Tilscher
  5. R
    Ralf Vogler
  6. K
    Kalmer Apinis
  7. V
    Vesal Vojdani

Maintainers

  1. S
    Simmo Saan <simmo.saan@gmail.com>
  2. M
    Michael Schwarz <michael.schwarz93@gmail.com>

Sources

goblint-2.0.1.tbz
sha256=dba2b664c7c125687e708e871d83fbfb6ba6d9ee98d235b4850d9a238caa84de
sha512=529987cde39691ad9e955000a3603e89c1c8cf14ed5e8b4cd3a7fc26e47d016aff571b472e2329725133c46f8d0cb45a05b88994eeffaa221a4d31b4c543adcd

doc/goblint.lib/Goblint_lib/AccessAnalysis/Spec/index.html

Module AccessAnalysis.Spec

Access and data race analyzer without base --- this is the new standard

include module type of struct include Analyses.DefaultSpec end
type marshal = unit
val should_join : 'a -> 'b -> bool
val vdecl : ('a, 'b, 'c, 'd) Analyses.ctx -> 'e -> 'a
val asm : ('a, 'b, 'c, 'd) Analyses.ctx -> 'a
val skip : ('a, 'b, 'c, 'd) Analyses.ctx -> 'a
val event : ('a, 'b, 'c, 'd) Analyses.ctx -> 'e -> 'f -> 'a
val morphstate : 'a -> 'b -> 'b
val sync : ('a, 'b, 'c, 'd) Analyses.ctx -> 'e -> 'a
val context : 'a -> 'b -> 'b
val access : 'a -> 'b -> unit
val name : unit -> string
module D = Lattice.Unit
module C = Lattice.Unit
module V0 : sig ... end
module V : sig ... end
module V0Set : sig ... end
module G : sig ... end
val safe : int Prelude.Ana.ref
val vulnerable : int Prelude.Ana.ref
val unsafe : int Prelude.Ana.ref
val init : 'a -> unit
val side_vars : ('a, [> `Lifted2 of V0Set.t ], 'b, [> `Right of CilType.Varinfo.t ]) Analyses.ctx -> Access.LVOpt.t -> Access.T.t -> unit
val side_access : ('a, [> `Lifted1 of Access.AS.t | `Lifted2 of V0Set.t ], 'b, [> `Left of Access.LVOpt.t * Access.T.t | `Right of CilType.Varinfo.t ]) Analyses.ctx -> Access.T.t -> Access.LVOpt.t -> (int * AccessKind.t * Node.t * CilType.Exp.t * MCPAccess.A.t) -> unit
val do_access : (D.t, G.t, C.t, V.t) Analyses.ctx -> AccessKind.t -> bool -> int -> Prelude.Ana.exp -> unit
val access_one_top : ?force:bool -> ?deref:bool -> (D.t, G.t, C.t, V.t) Analyses.ctx -> AccessKind.t -> bool -> Prelude.Ana.exp -> unit

Three access levels:

  1. deref=false, reach=false - Access exp without dereferencing, used for all normal reads and all function call arguments.
  2. deref=true, reach=false - Access exp by dereferencing once (may-point-to), used for lval writes and shallow special accesses.
  3. deref=true, reach=true - Access exp by dereferencing transitively (reachable), used for deep special accesses.
val startstate : 'a -> unit

We just lift start state, global and dependency functions:

val threadenter : 'a -> 'b -> 'c -> 'd -> unit list
val exitstate : 'a -> unit

Transfer functions:

val branch : (D.t, G.t, C.t, V.t) Analyses.ctx -> Prelude.Ana.exp -> 'a -> D.t
val return : (D.t, G.t, C.t, V.t) Analyses.ctx -> Prelude.Ana.exp option -> 'a -> D.t
val body : (D.t, 'a, 'b, 'c) Analyses.ctx -> 'd -> D.t
val special : (D.t, G.t, C.t, V.t) Analyses.ctx -> Prelude.Ana.lval option -> GoblintCil.Cil.varinfo -> Prelude.Ana.exp list -> D.t
val enter : (D.t, 'a, 'b, 'c) Analyses.ctx -> 'd -> 'e -> 'f -> (D.t * D.t) list
val combine : (D.t, G.t, C.t, V.t) Analyses.ctx -> Prelude.Ana.lval option -> Prelude.Ana.exp -> 'a -> Prelude.Ana.exp list -> 'b -> 'c -> 'c
val threadspawn : (D.t, G.t, C.t, V.t) Analyses.ctx -> Prelude.Ana.lval option -> 'a -> 'b -> 'c -> D.t
val query : ('b, [> `Bot | `Lifted1 of Access.AS.t | `Lifted2 of V0Set.t ], 'c, V.t) Analyses.ctx -> 'a Queries.t -> 'a Queries.result
val finalize : unit -> unit