package frama-c

  1. Overview
  2. Docs
Platform dedicated to the analysis of source code written in C

Install 

dune-project
 Dependency

frama-c.com Readme Edit opam file Versions (25)

Authors

  1. M
    Michele Alberti
  2. T
    Thibaud Antignac
  3. G
    Gergö Barany
  4. P
    Patrick Baudin
  5. T
    Thibaut Benjamin
  6. A
    Allan Blanchard
  7. L
    Lionel Blatter
  8. F
    François Bobot
  9. R
    Richard Bonichon
  10. Q
    Quentin Bouillaguet
  11. D
    David Bühler
  12. Z
    Zakaria Chihani
  13. L
    Loïc Correnson
  14. J
    Julien Crétin
  15. P
    Pascal Cuoq
  16. Z
    Zaynah Dargaye
  17. B
    Basile Desloges
  18. J
    Jean-Christophe Filliâtre
  19. P
    Philippe Herrmann
  20. M
    Maxime Jacquemin
  21. F
    Florent Kirchner
  22. A
    Alexander Kogtenkov
  23. T
    Tristan Le Gall
  24. J
    Jean-Christophe Léchenet
  25. M
    Matthieu Lemerre
  26. D
    Dara Ly
  27. D
    David Maison
  28. C
    Claude Marché
  29. A
    André Maroneze
  30. T
    Thibault Martin
  31. F
    Fonenantsoa Maurica
  32. M
    Melody Méaulle
  33. B
    Benjamin Monate
  34. Y
    Yannick Moy
  35. A
    Anne Pacalet
  36. V
    Valentin Perrelle
  37. G
    Guillaume Petiot
  38. D
    Dario Pinto
  39. V
    Virgile Prevosto
  40. A
    Armand Puccetti
  41. F
    Félix Ridoux
  42. V
    Virgile Robles
  43. M
    Muriel Roger
  44. J
    Julien Signoles
  45. N
    Nicolas Stouls
  46. K
    Kostyantyn Vorobyov
  47. B
    Boris Yakobowski

Maintainers

  1. F
    frama-ci-bot@frama-c.com

Sources

frama-c-27.0-Cobalt.tar.gz
sha256=25885f89daa478aeafdd1e4205452c7a30695d4b3b3ee8fc98b4a9c5f83f79c2

doc/frama-c.kernel/Frama_c_kernel/Lattice_bounds/Bottom/index.html

Module Lattice_bounds.Bottom

type 'a t = 'a or_bottom
module Operators : sig ... end

Operators

Datatype constructor

Bounds a semi-lattice

val is_bottom : 'a t -> bool

Access

val non_bottom : 'a t -> 'a
val value : bottom:'a -> 'a t -> 'a
val hash : ('a -> int) -> 'a t -> int

Datatype

val equal : ('a -> 'a -> bool) -> 'a t -> 'a t -> bool
val compare : ('a -> 'a -> int) -> 'a t -> 'a t -> int
val pretty_bottom : Format.formatter -> unit

Pretty-printing

val pretty : (Format.formatter -> 'a -> unit) -> Format.formatter -> 'a t -> unit
val is_included : ('a -> 'b -> bool) -> 'a t -> 'b t -> bool
val join : ('a -> 'a -> 'a) -> 'a t -> 'a t -> 'a t
val join_list : ('a -> 'a -> 'a) -> 'a t list -> 'a t
val narrow : ('a -> 'a -> 'a t) -> 'a t -> 'a t -> 'a t
val iter : ('a -> unit) -> 'a t -> unit
val bind : ('a -> 'b t) -> 'a t -> 'b t
val fold : bottom:'b -> ('a -> 'b) -> 'a t -> 'b
val map : ('a -> 'b) -> 'a t -> 'b t
val zip : 'a t -> 'b t -> ('a * 'b) t

In a lattice where the elements are lists of non-bottom values, the empty list is the bottom case.

val to_option : 'a t -> 'a option

Conversion

val of_option : 'a option -> 'a t
val to_list : 'a t -> 'a list
val bot_of_list : 'a list -> 'a list t
val list_of_bot : 'a list t -> 'a list
val list_values : 'a t list -> 'a list
val add_to_list : 'a t -> 'a list -> 'a list

elt >:: list adds elt to the list if it is not bottom.