A | |
AbstractInterpretation [Aorai_option] | |
AbstractInterpretationOff [Aorai_option] | |
AbstractLogicInfo [Data_for_aorai] | |
AddingOperationNameAndStatusInSpecification [Aorai_option] | |
Aorai_dataflow |
Overapproximation of the states that can be attained at each statement,
together with actions that have been performed.
|
Aorai_option | true if the user declares that its ya automaton is deterministic.
|
Aorai_register | |
Aorai_state [Data_for_aorai] | |
Aorai_typed_trans [Data_for_aorai] | |
Aorai_utils |
Given a transition a function name and a function status (call or
return) it returns if the cross condition can be statisfied with
only function status.
|
Aorai_visitors |
This visitor adds an auxiliary function for each C function which takes
care of setting the automaton in a correct state before calling the
original one, and replaces each occurrence of the original function by
the auxiliary one.
|
AutomataSimplification [Aorai_option] | |
AuxVariables [Data_for_aorai] | |
Axiomatization [Aorai_option] | |
B | |
Backwards_computer [Aorai_dataflow] | |
Bool3 | |
Buchi [Aorai_option] | |
C | |
C_logic_env [Data_for_aorai] | |
Call_state [Aorai_dataflow] | |
Case_state [Data_for_aorai] |
The data associated to each statement: We have a mapping from each
possible state at the entrance to the function (before actual transition)
to the current state possibles, associated to any action that has occured
on that path.
|
Computer [Aorai_dataflow] | |
ConsiderAcceptance [Aorai_option] | |
D | |
Data_for_aorai |
Return the buchi automata as stored after parsing
|
Deterministic [Aorai_option] | true if the user declares that its ya automaton is deterministic.
|
Dot [Aorai_option] | |
DotSeparatedLabels [Aorai_option] | |
E | |
End_state [Data_for_aorai] | |
H | |
Hashtbl [Datatype.S_with_collections] | |
I | |
Init_loop_state [Aorai_dataflow] | |
Intervals [Data_for_aorai] | |
Invariant_loop_state [Aorai_dataflow] | |
K | |
Key [Datatype.Hashtbl] |
Datatype for the keys of the hashtbl.
|
Key [Datatype.Map] |
Datatype for the keys of the map.
|
L | |
LTyping [Data_for_aorai] | |
Logic_simplification |
Given a list of terms (representing a conjunction),
if a positive call or return is present,
then all negative ones are obvious and removed
|
Loop_init_state [Data_for_aorai] | |
Loop_invariant_state [Data_for_aorai] | |
Ltl_File [Aorai_option] | |
Ltl_output | |
Ltlast |
The abstract tree of LTL formula.
|
Ltllexer | |
Ltlparser | |
M | |
Make [Datatype.Hashtbl] |
Build a datatype of the hashtbl according to the datatype of values in the
hashtbl.
|
Make [Datatype.Map] |
Build a datatype of the map according to the datatype of values in the
map.
|
Map [Datatype.S_with_collections] | |
Max_value_counter [Data_for_aorai] | |
O | |
Output_C_File [Aorai_option] | |
Output_Spec [Aorai_option] | |
P | |
Path_analysis |
since Nitrogen-20111001
|
Post_state [Aorai_dataflow] | |
Post_state [Data_for_aorai] | |
Pre_state [Aorai_dataflow] | |
Pre_state [Data_for_aorai] | |
Promelaast |
The abstract tree of promela representation.
|
Promelalexer | |
Promelalexer_withexps | |
Promelaoutput | |
Promelaparser | |
Promelaparser_withexps | |
R | |
Range [Data_for_aorai] | |
Reject_state [Data_for_aorai] | |
Return_state [Aorai_dataflow] | |
S | |
Set [Datatype.S_with_collections] | |
StateIndex [Data_for_aorai] | |
State_var [Data_for_aorai] | |
StmtStartData [Aorai_dataflow.Backwards_computer] | |
StmtStartData [Aorai_dataflow.Computer] | |
T | |
Test [Aorai_option] | |
To_Buchi [Aorai_option] | |
TransIndex [Data_for_aorai] | |
U | |
Utils_parser | |
V | |
Vals [Data_for_aorai] | |
Y | |
Ya [Aorai_option] | |
Yalexer | |
Yaparser |