package frama-c
Install
Dune Dependency
Authors
-
MMichele Alberti
-
TThibaud Antignac
-
GGergö Barany
-
PPatrick Baudin
-
NNicolas Bellec
-
TThibaut Benjamin
-
AAllan Blanchard
-
LLionel Blatter
-
FFrançois Bobot
-
RRichard Bonichon
-
VVincent Botbol
-
QQuentin Bouillaguet
-
DDavid Bühler
-
ZZakaria Chihani
-
LLoïc Correnson
-
JJulien Crétin
-
PPascal Cuoq
-
ZZaynah Dargaye
-
BBasile Desloges
-
JJean-Christophe Filliâtre
-
PPhilippe Herrmann
-
MMaxime Jacquemin
-
FFlorent Kirchner
-
AAlexander Kogtenkov
-
RRemi Lazarini
-
TTristan Le Gall
-
JJean-Christophe Léchenet
-
MMatthieu Lemerre
-
DDara Ly
-
DDavid Maison
-
CClaude Marché
-
AAndré Maroneze
-
TThibault Martin
-
FFonenantsoa Maurica
-
MMelody Méaulle
-
BBenjamin Monate
-
YYannick Moy
-
PPierre Nigron
-
AAnne Pacalet
-
VValentin Perrelle
-
GGuillaume Petiot
-
DDario Pinto
-
VVirgile Prevosto
-
AArmand Puccetti
-
FFélix Ridoux
-
VVirgile Robles
-
JJan Rochel
-
MMuriel Roger
-
JJulien Signoles
-
NNicolas Stouls
-
KKostyantyn Vorobyov
-
BBoris Yakobowski
Maintainers
Sources
sha256=d2fbb3b8d0ff83945872e9e6fa258e934a706360e698dae3b4d5f971addf7493
doc/frama-c.kernel/Frama_c_kernel/Int_Intervals/index.html
Module Frama_c_kernel.Int_Intervals
Sets of intervals with a lattice structure. Consecutive intervals are automatically fused.
include Int_Intervals_sig.S with type t = Offsetmap.Int_Intervals.t
include Lattice_type.Full_Lattice with type t = Offsetmap.Int_Intervals.t
include Lattice_type.Bounded_Join_Semi_Lattice
with type t = Offsetmap.Int_Intervals.t
include Lattice_type.Join_Semi_Lattice with type t = Offsetmap.Int_Intervals.t
datatype of element of the lattice
include Datatype.S with type t = Offsetmap.Int_Intervals.t
include Datatype.S_no_copy with type t = Offsetmap.Int_Intervals.t
val packed_descr : Structural_descr.pack
Packed version of the descriptor.
val reprs : t list
List of representants of the descriptor.
val hash : t -> int
Hash function: same spec than Hashtbl.hash
.
val pretty : Format.formatter -> t -> unit
Pretty print each value in an user-friendly way.
val mem_project : (Project_skeleton.t -> bool) -> t -> bool
mem_project f x
must return true
iff there is a value p
of type Project.t
in x
such that f p
returns true
.
val bottom : t
smallest element
include Lattice_type.With_Top with type t := t
val top : t
largest element
include Lattice_type.With_Intersects with type t := t
val is_top : t -> bool
val inject_bounds : Abstract_interp.Int.t -> Abstract_interp.Int.t -> t
val inject_itv : Int_Intervals_sig.itv -> t
val inject : Int_Intervals_sig.itv list -> t
val from_ival_size : Ival.t -> Int_Base.t -> t
Conversion from an ival, which represents the beginning of each interval. The size if taken from the Int_Base.t
argument. If the result contains more than -plevel
arguments, it is automatically over-approximated.
val from_ival_size_under : Ival.t -> Int_Base.t -> t
Same as from_ival_size
, except that the result is an under-approximation if the ival points to too many locations
val project_set : t -> Int_Intervals_sig.itv list
May raise Error_Top
. As intervals are not represented as lists, this function has an overhead. Use iterators whenever possible instead.
val project_singleton : t -> Int_Intervals_sig.itv option
Iterators
val fold : (Int_Intervals_sig.itv -> 'a -> 'a) -> t -> 'a -> 'a
May raise Error_Top
val iter : (Int_Intervals_sig.itv -> unit) -> t -> unit
May raise Error_Top
val pretty_typ : Cil_types.typ option -> t Pretty_utils.formatter
Pretty-printer that supposes the intervals are subranges of a C type, and use the type to print nice offsets
val range_covers_whole_type : Cil_types.typ -> t -> bool
Does the interval cover the entire range of bits that are valid for the given type.