SimplifiedToStandard.Dinclude Abstraction.Simplified.SIMPLIFIED*****************
val id : t Core.All.idDomain identifier
val bottom : tLeast abstract element of the lattice.
val top : tGreatest abstract element of the lattice.
**************
val is_bottom : t -> boolis_bottom a tests whether a is bottom or not.
Partial order relation. subset a1 a2 tests whether a1 is related to (or included in) a2.
*************
val widen : 'a Core.All.ctx -> t -> t -> twiden ctx a1 a2 computes an upper bound of a1 and a2 that ensures stabilization of ascending chains.
**********************
val init : Core.All.program -> tInitial abstract element
************
val domains : Core.All.DomainSet.tval semantics : Core.All.SemanticSet.tval routing_table : Core.All.routing_tableval merge :
Core.All.path ->
t ->
(t * Core.All.change_map) ->
(t * Core.All.change_map) ->
tval exec :
Core.All.DomainSet.t option ->
Core.All.stmt ->
('a, t) Abstraction.Simplified.simplified_man ->
'a Core.All.ctx ->
t ->
t optionval ask :
Core.All.DomainSet.t option ->
('a, 'r) Core.All.query ->
('a, t) Abstraction.Simplified.simplified_man ->
'a Core.All.ctx ->
t ->
'r optionval print_state : Core.All.DomainSet.t option -> Core.All.printer -> t -> unitval print_expr :
Core.All.DomainSet.t option ->
('a, t) Abstraction.Simplified.simplified_man ->
'a Core.All.ctx ->
t ->
Core.All.printer ->
Core.All.expr ->
unit