Functions and predicates of the theory Assuming Address as address sort name, Heap as heap sort name, and Obj as the selected object sort.
Functions and predicates of the theory Assuming Address as address sort name, Heap as heap sort name, and Obj as the selected object sort. Some function / predicate names incorporate the defined / selected names. *************************************************************************** Public functions and predicates *************************************************************************** emptyHeap : () --> Heap alloc : Heap x Obj --> Heap x Address (allocResHeap) read : Heap x Address --> Obj write : Heap x Address x Obj --> Heap valid (isAlloc) : Heap x Address --> Bool deAlloc : Heap --> Heap nthAddress : Nat --> Address
batchAlloc : Heap x Obj x Nat --> Heap x AddressRange (batchAllocResHeap) batchWrite : Heap x AddressRange x Obj --> Heap nth : AddressRange x Nat --> Address within : AddressRange x Address --> Bool
0 1 writeADT : Obj x Obj --> Heap * Updates the ADT's field (described by a read to 0) using value (1) *************************************************************************** Private functions and predicates *************************************************************************** counter : Heap --> Nat
* Below two functions are shorthand functions to get rid of allocRes ADT. * They return a single value instead of the pair <Heap x Addr>. * This also removes some quantifiers related to the ADT in the generated * interpolants. alloc<heapSortName> : Heap x Obj --> Heap alloc<addressSortName> : Heap x Obj --> Address
* Below two functions are shorthand functions to get rid of batchAllocRes ADT. * They return a single value instead of the pair <Heap x AddressRange>. * This also removes some quantifiers related to the ADT in the generated * interpolants. batchAlloc<heapSortName> : Heap x Obj x Nat --> Heap batchAlloc<addressSortName>Range : Heap x Obj x Nat --> AddressRange * ***************************************************************************
Axioms defining the theory; such axioms are simply added as formulae to the problem to be proven, and thus handled using the standard reasoning techniques (including e-matching).
Returns whether (an ADT) sort is declared as part of this theory.
Optionally, other theories that this theory depends on.
Optionally, a function evaluating theory functions applied to concrete arguments, represented as constructor terms.
Optionally, a function evaluating theory functions applied to concrete arguments, represented as constructor terms.
Optionally, a function evaluating theory predicates applied to concrete arguments, represented as constructor terms.
Optionally, a function evaluating theory predicates applied to concrete arguments, represented as constructor terms.
Add the symbols defined by this theory to the order
Add the symbols defined by this theory to the order
Mapping of interpreted functions to interpreted predicates, used translating input ASTs to internal ASTs (the latter only containing predicates).
Information which of the predicates satisfy the functionality axiom; at some internal points, such predicates can be handled more efficiently
Interpreted functions of the theory
If this theory defines any Theory.Decoder
, which
can translate model data into some theory-specific representation,
this function can be overridden to pre-compute required data
from a model.
If this theory defines any Theory.Decoder
, which
can translate model data into some theory-specific representation,
this function can be overridden to pre-compute required data
from a model.
Optionally, a post-processor that is applied to formulas output by the prover, for instance to interpolants or the result of quantifier elimination.
Optionally, a post-processor that is applied to formulas output by the
prover, for instance to interpolants or the result of quantifier
elimination. This method will be applied to the formula after
calling Internal2Inputabsy
.
Optionally, a pre-processor that is applied to formulas over this theory, prior to sending the formula to a prover.
Check whether we can tell that the given combination of theories is sound for checking satisfiability of a problem, i.e., if proof construction ends up in a dead end, can it be concluded that a problem is satisfiable.
Optionally, a set of predicates used by the theory to tell the
PresburgerModelFinder
about terms that will be handled
exclusively by this theory.
Optionally, a set of predicates used by the theory to tell the
PresburgerModelFinder
about terms that will be handled
exclusively by this theory. If a proof goal in model generation mode
contains an atom p(x)
, for p
in this set,
then the PresburgerModelFinder
will ignore x
when assigning concrete values to symbols.
Optionally, a plug-in implementing reasoning in this theory
Optionally, simplifiers that are applied to formulas output by the prover, for instance to interpolants or the result of quantifier.
Optionally, a post-processor that is applied to formulas output by the prover, for instance to interpolants or the result of quantifier elimination.
Optionally, a post-processor that is applied to formulas output by the
prover, for instance to interpolants or the result of quantifier
elimination. This method will be applied to the raw formulas, before
calling Internal2Inputabsy
.
Information how interpreted predicates should be handled for e-matching.
Interpreted predicates of the theory
Optionally, a pre-processor that is applied to formulas over this theory, prior to sending the formula to a prover.
Optionally, a pre-processor that is applied to formulas over this theory, prior to sending the formula to a prover.
Optionally, a plugin for the reducer applied to formulas both before and during proving.
Optionally, a plugin for the reducer applied to formulas both before and during proving.
When instantiating existentially quantifier formulas,
EX phi
, at most one instantiation is necessary
provided that all predicates in phi
are contained
in this set.
When instantiating existentially quantifier formulas,
EX phi
, at most one instantiation is necessary
provided that all predicates in phi
are contained
in this set.
Additional axioms that are included if the option
+genTotalityAxioms
is given to Princess.
A list of functions that should be considered in automatic trigger generation
Helper function to write to ADT fields.
Helper function to write to ADT fields.
: the ADT field term to be written to. This should be an IFunApp, where the outermost function is a selector of the ADT, the innermost function is a heap read to the ADT on the heap, the innermost+1 function is the getter of the ADT, and any intermediate functions are other selectors e.g. x(getS(read(h, p))) or (in C: p->x) x(s(getS(read(h, p)))) (in C: p->s.x) note that this method works for writing to non-ADTs as well, if lhs is provided as a read Object (e.g. getInt(read(h,p))).
: the new value for the field, e.g. 42 this would return a new term, such as: S(42, y(s))
: the new ADT term