An SMT Theory for n-Indexed Sequences
Abstract
The SMT (Satisfiability Modulo Theories) theory of arrays is well-established and widely used, with variousdecision procedures and extensions developed for it. However, recent works suggest that developing tailoredreasoning for some theories, such as sequences and strings, is more efficient than reasoning over them throughaxiomatization over the theory of arrays. In this paper, we are interested in reasoning over n-indexed sequences asthey are found in some programming languages, such as Ada. We propose an SMT theory of n-indexed sequencesand explore different ways to represent and reason over n-indexed sequences using existing theories, as well astailored calculi for the theory.
Cite
@article{arxiv.2411.07665,
title = {An SMT Theory for n-Indexed Sequences},
author = {Hichem Rami Ait El Hara and François Bobot and Guillaume Bury},
journal= {arXiv preprint arXiv:2411.07665},
year = {2024}
}
Comments
22nd International Workshop on Satisfiability Modulo Theories, Jul 2024, Montreal, Canada, France