package electrod

You can search for identifiers within the package.

in-package search v0.2.0

package electrod

electrod.libelectrod
- Libelectrod
  - Ast
  - Ast_to_elo
  - Atom
  - Domain
  - Elo
    
    fold
    
    map
  - Elo_recursor
    
    recursor
  - Elo_to_ltl1
    
    Make
    
    Ltl
    
    Atomic
    
    Infix
    
    converter
    
    environment
  - Elo_to_ltl_intf
    
    S
  - Elo_to_model1
    
    Make
    
    ConvertFormulas
    
    Ltl
    
    Atomic
    
    Infix
    
    Model
  - Elo_to_smv1
    
    Elo_to_SMV_LTL
    
    converter
    
    environment
    
    Elo_to_SMV_model
    
    SMV_LTL
    
    Atomic
    
    Infix
    
    SMV_atom
    
    SMV_file_format
  - Exp_bounds
  - Fmtc
    
    Dump
  - Gen_goal
    
    fold
    
    map
  - Gen_goal_recursor
    
    recursor
  - Instance
  - Intf
    
    COMPARE
    
    Print
    
    Mixin
    
    M
    
    S
  - Invar_computation
  - Location
  - Msg
    
    Extract
    
    Fatal
    
    LoggingSetup
    
    Warn
  - Name
  - Outcome
  - Parser
  - Parser_main
  - Raw
  - Raw_ident
  - Raw_to_ast
  - Relation
  - Scanner
  - Scope
  - Scripts
  - Shortnames
  - Simplify1
    
    simplify
  - Simplify2
    
    simplify
  - Smv
    
    Make_SMV_LTL
    
    At
    
    Infix
    
    Make_SMV_file_format
    
    Ltl
    
    Atomic
    
    Infix
  - Smv_trace_parser
    
    Make
    
    D
  - Smv_trace_scanner
  - Smv_trace_tokens
  - Solver
    
    ATOMIC_PROPOSITION
    
    LTL
    
    Atomic
    
    Infix
    
    LTL_from_Atomic
    
    At
    
    Infix
    
    MODEL
  - Symbol
  - Symmetry
  - Transfo
  - Tuple
  - Tuple_set
  - Var

Legend:
Library
Module
Module type
Parameter
Class
Class type

Represents a result trace (or the absence thereof).

type valuation

A valuation maps set/relation names to the tuples they contain.

type state

A state is either a plain state, or the target of a lasso from the last state of the trace.

type states = state list

Nonempty, ordered sequence of states.

type t = private {

trace : states option;
nbvars : int;
(*
number of Booleans used
*)
conversion_time : Mtime.span;
analysis_time : Mtime.span;

}

An outcome represents the result of an analysis. It is either None, meaning there is no resulting trace, or it is Some _ in wihch case it carries a nonempty, ordered sequence of states, with at least one being the target of a loop ("lasso" step).

val no_trace : int -> Mtime.span -> Mtime.span -> t

Represents the absence of trace (so usually: UNSAT).

val some_trace : t -> bool

val trace : 
  ((Atom.t, Atom.t) CCList.Assoc.t * (Name.t * Name.t) list) ->
  int ->
  Mtime.span ->
  Mtime.span ->
  state list ->
  t

The list must be nonempty and must contain at least one lasso target.

val valuation : (Name.t, Tuple_set.t) Containers.List.Assoc.t -> valuation

val plain_state : valuation -> state

val loop_state : valuation -> state

val loop_is_present : states -> bool

Says whether a non-empty trace features a loop states.

val to_loop : state -> state

Converts any state to a loop state

val pp : 
  format:[ `XML | `Plain | `Chrono ] ->
  Containers.Format.formatter ->
  t ->
  unit