Work

Reasoning over n-indexed sequences in SMT

Year: 2025

Type: article

Abstract: The SMT (Satisfiability Modulo Theories) theory of arrays is well-established and widely used, with various decision procedures and extensions developed for it. However, recent contributions suggest that developing tailored reasoning for some theories, such as sequences and strings, can be more efficient than reasoning over them through axiomatization over the theory of arrays. In this paper, we are interested in reasoning over $$n$$ -indexed sequences as they are found in some programming languages, such as Ada. We propose an SMT theory of $$n$$ -indexed sequences and explore different ways to represent and reason over $$n$$ -indexed sequences using existing theories, as well as tailored calculi for this theory.

Source: Acta Informatica

DOI: 10.1007/s00236-025-00496-w

Authors: Hichem Rami Ait-El-Hara, François Bobot, Guillaume Bury

Institutions: Commissariat à l'Énergie Atomique et aux Énergies Alternatives, Université Paris-Saclay, CEA Paris-Saclay - Etablissement de Saclay

Language: English

Topic: Logic, programming, and type systems

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: hybrid

Estimated APC paid: $3,290

Funder: Université Paris-Saclay