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.4.0.tbz

sha256=99b78e6def71534d195eef9084baa26d8334b36084e120aa6afb300c9bf8afa6

sha512=f3162bd95a03c00358a2991f6152fc6169205bfb4c55e2c483e98cc3935673df9656d025b6f1ea0fa5f1bd0aee037d4f483966b0d2907e3fa9bf11a93a3392af

doc/goblint_cdomain_value/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