package caisar

You can search for identifiers within the package.

in-package search v0.2.0

On This Page

Parameters
Signature

A platform for characterizing the safety and robustness of artificial intelligence based software

Install

dune-project

Dependency

git.frama-c.com Readme Changelog Edit opam file Versions (7)

Authors

L

LAISER team, Software Safety and Security Laboratory, CEA-List

Maintainers

L

LAISER team, Software Safety and Security Laboratory, CEA-List

Sources

caisar-1.0.tbz

sha256=cd24b647565aaa4bb82d46c195c692d56ba0ad4b39bc86ef6baaf2d7a08c92a5

sha512=073761d95d6d8f6eb6f687643054297eb47db5d5bdc3a72ba42bf1509ab76415d485f536e5e42c11bd59c972ab7ad72e398d19af6e74c4f0778f28ef5bf4935e

doc/caisar.ir/Ir/Nier_cfg/NierCFG/index.html

Module `Nier_cfg.NierCFG`Source

Parameters

module I : VInput

Signature

include Graph.Sig.I
  with type V.t = MakeVertex(I).t
   and type V.label = MakeVertex(I).t
   and type E.t = MakeVertex(I).t * Edge.t * MakeVertex(I).t
   and type E.label = Edge.t

An imperative graph is a graph.

include Graph.Sig.G
  with type V.t = MakeVertex(I).t
  with type V.label = MakeVertex(I).t
  with type E.t = MakeVertex(I).t * Edge.t * MakeVertex(I).t
  with type E.label = Edge.t

Graph structure

Sourcetype t

Abstract type of graphs

Source

module V : 
  Graph.Sig.VERTEX
    with type t = MakeVertex(I).t
    with type label = MakeVertex(I).t

Vertices have type V.t and are labeled with type V.label (note that an implementation may identify the vertex with its label)

Sourcetype vertex = V.t

Source

module E : 
  Graph.Sig.EDGE
    with type vertex = vertex
    with type t = MakeVertex(I).t * Edge.t * MakeVertex(I).t
    with type label = Edge.t

Edges have type E.t and are labeled with type E.label. src (resp. dst) returns the origin (resp. the destination) of a given edge.

Sourcetype edge = E.t

Sourceval is_directed : bool

Is this an implementation of directed graphs?

Size functions

Sourceval is_empty : t -> bool

Sourceval nb_vertex : t -> int

Sourceval nb_edges : t -> int

Degree of a vertex

Sourceval out_degree : t -> vertex -> int

out_degree g v returns the out-degree of v in g.

raises Invalid_argument
if v is not in g.

Sourceval in_degree : t -> vertex -> int

in_degree g v returns the in-degree of v in g.

raises Invalid_argument
if v is not in g.

Membership functions

Sourceval mem_vertex : t -> vertex -> bool

Sourceval mem_edge : t -> vertex -> vertex -> bool

Sourceval mem_edge_e : t -> edge -> bool

Sourceval find_edge : t -> vertex -> vertex -> edge

find_edge g v1 v2 returns the edge from v1 to v2 if it exists. Unspecified behaviour if g has several edges from v1 to v2.

raises Not_found
if no such edge exists.

Sourceval find_all_edges : t -> vertex -> vertex -> edge list

find_all_edges g v1 v2 returns all the edges from v1 to v2.

since ocamlgraph 1.8

Successors and predecessors

You should better use iterators on successors/predecessors (see Section "Vertex iterators").

Sourceval succ : t -> vertex -> vertex list

succ g v returns the successors of v in g.

raises Invalid_argument
if v is not in g.

Sourceval pred : t -> vertex -> vertex list

pred g v returns the predecessors of v in g.

raises Invalid_argument
if v is not in g.

Labeled edges going from/to a vertex

Sourceval succ_e : t -> vertex -> edge list

succ_e g v returns the edges going from v in g.

raises Invalid_argument
if v is not in g.

Sourceval pred_e : t -> vertex -> edge list

pred_e g v returns the edges going to v in g.

raises Invalid_argument
if v is not in g.

Graph iterators

Sourceval iter_vertex : (vertex -> unit) -> t -> unit

Iter on all vertices of a graph.

Sourceval fold_vertex : (vertex -> 'a -> 'a) -> t -> 'a -> 'a

Fold on all vertices of a graph.

Sourceval iter_edges : (vertex -> vertex -> unit) -> t -> unit

Iter on all edges of a graph. Edge label is ignored.

Sourceval fold_edges : (vertex -> vertex -> 'a -> 'a) -> t -> 'a -> 'a

Fold on all edges of a graph. Edge label is ignored.

Sourceval iter_edges_e : (edge -> unit) -> t -> unit

Iter on all edges of a graph.

Sourceval fold_edges_e : (edge -> 'a -> 'a) -> t -> 'a -> 'a

Fold on all edges of a graph.

Sourceval map_vertex : (vertex -> vertex) -> t -> t

Map on all vertices of a graph.

The current implementation requires the supplied function to be injective. Said otherwise, map_vertex cannot be used to contract a graph by mapping several vertices to the same vertex. To contract a graph, use instead create, add_vertex, and add_edge.

Vertex iterators

Each iterator iterator f v g iters f to the successors/predecessors of v in the graph g and raises Invalid_argument if v is not in g. It is the same for functions fold_* which use an additional accumulator.

<b>Time complexity for ocamlgraph implementations:</b> operations on successors are in O(1) amortized for imperative graphs and in O(ln(|V|)) for persistent graphs while operations on predecessors are in O(max(|V|,|E|)) for imperative graphs and in O(max(|V|,|E|)*ln|V|) for persistent graphs.

iter/fold on all successors/predecessors of a vertex.

Sourceval iter_succ : (vertex -> unit) -> t -> vertex -> unit

Sourceval iter_pred : (vertex -> unit) -> t -> vertex -> unit

Sourceval fold_succ : (vertex -> 'a -> 'a) -> t -> vertex -> 'a -> 'a

Sourceval fold_pred : (vertex -> 'a -> 'a) -> t -> vertex -> 'a -> 'a

iter/fold on all edges going from/to a vertex.

Sourceval iter_succ_e : (edge -> unit) -> t -> vertex -> unit

Sourceval fold_succ_e : (edge -> 'a -> 'a) -> t -> vertex -> 'a -> 'a

Sourceval iter_pred_e : (edge -> unit) -> t -> vertex -> unit

Sourceval fold_pred_e : (edge -> 'a -> 'a) -> t -> vertex -> 'a -> 'a

Sourceval create : ?size:int -> unit -> t

create () returns an empty graph. Optionally, a size can be given, which should be on the order of the expected number of vertices that will be in the graph (for hash tables-based implementations). The graph grows as needed, so size is just an initial guess.

Sourceval clear : t -> unit

Remove all vertices and edges from the given graph.

since ocamlgraph 1.4

Sourceval copy : t -> t

copy g returns a copy of g. Vertices and edges (and eventually marks, see module Mark) are duplicated.

Sourceval add_vertex : t -> vertex -> unit

add_vertex g v adds the vertex v to the graph g. Do nothing if v is already in g.

Sourceval remove_vertex : t -> vertex -> unit

remove g v removes the vertex v from the graph g (and all the edges going from v in g). Do nothing if v is not in g.

<b>Time complexity for ocamlgraph implementations:</b> O(|V|*ln(D)) for unlabeled graphs and O(|V|*D) for labeled graphs. D is the maximal degree of the graph.

Sourceval add_edge : t -> vertex -> vertex -> unit

add_edge g v1 v2 adds an edge from the vertex v1 to the vertex v2 in the graph g. Add also v1 (resp. v2) in g if v1 (resp. v2) is not in g. Do nothing if this edge is already in g.

Sourceval add_edge_e : t -> edge -> unit

add_edge_e g e adds the edge e in the graph g. Add also E.src e (resp. E.dst e) in g if E.src e (resp. E.dst e) is not in g. Do nothing if e is already in g.

Sourceval remove_edge : t -> vertex -> vertex -> unit

remove_edge g v1 v2 removes the edge going from v1 to v2 from the graph g. If the graph is labelled, all the edges going from v1 to v2 are removed from g. Do nothing if this edge is not in g.

raises Invalid_argument
if v1 or v2 are not in g.

Sourceval remove_edge_e : t -> edge -> unit

remove_edge_e g e removes the edge e from the graph g. Do nothing if e is not in g.

raises Invalid_argument
if E.src e or E.dst e are not in g.

Sourceval init_cfg : t

Sourceval vertex_list : t -> vertex Base.list

Sourceval preds : t -> vertex -> vertex Base.list

preds_names g v returns a list of names of predecessors nodes

Sourceval preds_names : t -> vertex -> Base.string Base.list

Sourceval succs : t -> vertex -> vertex Base.list

succs_names g v returns a list of names of predecessors nodes

Sourceval succs_names : t -> vertex -> Base.string Base.list

input_node g returns the nodes considered as describing the inputs of the neural network.

Sourceval input_nodes : t -> vertex Base.list

Sourceval find_vertices : t -> (vertex -> Base.bool) -> vertex Base.list