package goblint

You can search for identifiers within the package.

in-package search v0.2.0

Static analysis framework for C

Install

dune-project

Dependency

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

Authors

Maintainers

Sources

goblint-2.3.0.tbz

sha256=b729c94adb383a39aea32eb005c988dfd44b92af22ee6a4eedf4239542ac6c26

sha512=643b98770e5fe5644324c95c9ae3a9f698f25c8b11b298f0751d524e0b20af368b2a465fc8200b75a73d48fc9a053fd90f5e8920d4db070927f93188bb8687e0

doc/goblint.lib/Goblint_lib/ConcDomain/ThreadCreation/index.html

Module `ConcDomain.ThreadCreation`

module UNames : sig ... end

module Uniqueness : sig ... end

module ParentThreadSet : sig ... end

module DirtyExitNames : sig ... end

module DirtyExit : sig ... end

include sig ... end

type t = Uniqueness.t * ParentThreadSet.t * DirtyExit.t

val equal : t -> t -> Ppx_deriving_runtime.bool

val compare : t -> t -> Ppx_deriving_runtime.int

val hash : t -> int

val tag : 'a -> 'b

val show : (Uniqueness.t * ParentThreadSet.t * DirtyExit.t) -> string

val pretty : 
  unit ->
  (Uniqueness.t * ParentThreadSet.t * DirtyExit.t) ->
  Printable.Pretty.doc

val printXml : 
  'a BatInnerIO.output ->
  (Uniqueness.t * ParentThreadSet.t * DirtyExit.t) ->
  unit

val to_yojson : 
  (Uniqueness.t * ParentThreadSet.t * DirtyExit.t) ->
  [> `Assoc of (string * Yojson.Safe.t) list ]

val name : unit -> string

val relift : 
  (Uniqueness.t * ParentThreadSet.t * DirtyExit.t) ->
  Uniqueness.t * ParentThreadSet.t * DirtyExit.t

val arbitrary : 
  unit ->
  (Uniqueness.t * ParentThreadSet.t * DirtyExit.t) QCheck.arbitrary

val bot : unit -> Uniqueness.t * ParentThreadSet.t * DirtyExit.t

val is_bot : (Uniqueness.t * ParentThreadSet.t * DirtyExit.t) -> bool

val top : unit -> Uniqueness.t * ParentThreadSet.t * DirtyExit.t

val is_top : (Uniqueness.t * ParentThreadSet.t * DirtyExit.t) -> bool

val leq : 
  (Uniqueness.t * ParentThreadSet.t * DirtyExit.t) ->
  (Uniqueness.t * ParentThreadSet.t * DirtyExit.t) ->
  bool

val pretty_diff : unit -> (t * t) -> Lattice.Pretty.doc

val op_scheme : 
  ('a -> 'b -> Uniqueness.t) ->
  ('c -> 'd -> ParentThreadSet.t) ->
  ('e -> 'f -> DirtyExit.t) ->
  ('a * 'c * 'e) ->
  ('b * 'd * 'f) ->
  t

val join : 
  (Uniqueness.t * ParentThreadSet.t * DirtyExit.t) ->
  (Uniqueness.t * ParentThreadSet.t * DirtyExit.t) ->
  t

val meet : 
  (Uniqueness.t * ParentThreadSet.t * DirtyExit.t) ->
  (Uniqueness.t * ParentThreadSet.t * DirtyExit.t) ->
  t

val widen : 
  (Uniqueness.t * ParentThreadSet.t * DirtyExit.t) ->
  (Uniqueness.t * ParentThreadSet.t * DirtyExit.t) ->
  t

val narrow : 
  (Uniqueness.t * ParentThreadSet.t * DirtyExit.t) ->
  (Uniqueness.t * ParentThreadSet.t * DirtyExit.t) ->
  t