package frama-c
Install
dune-project
Dependency
Authors
-
MMichele Alberti
-
TThibaud Antignac
-
GGergö Barany
-
PPatrick Baudin
-
TThibaut Benjamin
-
AAllan Blanchard
-
LLionel Blatter
-
FFrançois Bobot
-
RRichard Bonichon
-
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
-
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
-
AAnne Pacalet
-
VValentin Perrelle
-
GGuillaume Petiot
-
DDario Pinto
-
VVirgile Prevosto
-
AArmand Puccetti
-
FFélix Ridoux
-
VVirgile Robles
-
MMuriel Roger
-
JJulien Signoles
-
NNicolas Stouls
-
KKostyantyn Vorobyov
-
BBoris Yakobowski
Maintainers
Sources
sha256=9c1b14a689ac8ccda9e827c2eede13bb8d781fb8e4e33c1b5360408e312127d2
doc/frama-c.kernel/Frama_c_kernel/Offsetmap/Make/argument-1-V/index.html
Parameter Make.V
type size_widen_hint = Integer.tinclude Lattice_type.Bounded_Join_Semi_Lattice
include Lattice_type.Join_Semi_Lattice
datatype of element of the lattice
include Datatype.S
include Datatype.S_no_copy
val packed_descr : Structural_descr.packPacked version of the descriptor.
val reprs : t listList of representants of the descriptor.
val hash : t -> intHash function: same spec than Hashtbl.hash.
val pretty : Format.formatter -> t -> unitPretty print each value in an user-friendly way.
val mem_project : (Project_skeleton.t -> bool) -> t -> boolmem_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 : tsmallest element
include Lattice_type.With_Widening
with type t := t
and type widen_hint = size_widen_hint * numerical_widen_hint
type widen_hint = size_widen_hint * numerical_widen_hinthints for the widening
val widen : widen_hint -> t -> t -> twiden h t1 t2 is an over-approximation of join t1 t2. Assumes is_included t1 t2
include Lattice_type.With_Cardinal_One with type t := t
val cardinal_zero_or_one : t -> boolval pretty_typ : Cil_types.typ option -> t Pretty_utils.formatterIsotropy
val is_isotropic : t -> boolAre the bits independent?
Force a value to be isotropic, when a loss of imprecision occurs. The resulting value must verify is_isotropic.
Reading bits of values
val extract_bits :
topify:Origin.kind ->
start:Integer.t ->
stop:Integer.t ->
size:Integer.t ->
t ->
bool * tExtract the bits between start and stop in the value of type t, assuming this value has size bits. Return the corresponding value, and a boolean indicating that an imprecision occurred during the operation. In the latter case, the origin of the imprecision is flagged as having kind topify.
val shift_bits :
topify:Origin.kind ->
offset:Integer.t ->
size:Integer.t ->
t ->
tLeft-shift the given value, of size size, by offset bits. topify indicates which operation caused this shift to take place, for imprecision tracking.
val merge_distinct_bits :
topify:Origin.kind ->
conflate_bottom:bool ->
t ->
t ->
tMerge the bits of the two given values, that span disjoint bit ranges by construction. (So either an abstraction of + or | are correct implementations.)
The conflate_bottom argument deals with bottom values in either of the arguments. If conflate_bottom holds, any pre-existing bottom value must result in bottom. Otherwise, the bottom value is ignored.
topify indicates which operation caused this merge to take place, for imprecision tracking.
val merge_neutral_element : tValue that can be passed to merge_distinct_bits as the starting value. This value must be neutral wrt. merging of values.