You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Princess has also various support for such sequences, much of this work is driven by reasoning about strings but the techniques handle arbitrary codomains. In contrast, we do not need domain to be anything other than non-negative integers.
The text was updated successfully, but these errors were encountered:
Modeling Scala arrays and lists currently does not work in cvc5 and it works badly in z3 as well when sequences are nested.
To remedy this, we should add a new type of finitary sequences.
Unlike arrays, finitary sequences admit induction principle, which we used extensively in reasoning about lists.
To see how e.g. cvc solvers can support this, chek https://arxiv.org/pdf/2205.08095
Princess has also various support for such sequences, much of this work is driven by reasoning about strings but the techniques handle arbitrary codomains. In contrast, we do not need domain to be anything other than non-negative integers.
The text was updated successfully, but these errors were encountered: