On algebraic array theories

Automatic verification of programs manipulating arrays relies on specialised decision procedures. A methodology to classify the theories handled by these procedures is introduced. It is based on decomposition theorems in the style of Feferman and Vaught. The method is applied to obtain an extension...

Full description

Saved in:
Bibliographic Details
Published inJournal of logical and algebraic methods in programming Vol. 136; p. 100906
Main Authors Raya, Rodrigo, Kunčak, Viktor
Format Journal Article
LanguageEnglish
Published Elsevier Inc 01.01.2024
Subjects
Arrays
Composition theorems
Decision procedures
Feferman-Vaught
Satisfiability modulo theories
Composition theorems
Satisfiability modulo theories
Decision procedures
Arrays
Feferman-Vaught
Online AccessGet full text

Cover

More Information
Summary:Automatic verification of programs manipulating arrays relies on specialised decision procedures. A methodology to classify the theories handled by these procedures is introduced. It is based on decomposition theorems in the style of Feferman and Vaught. The method is applied to obtain an extension of combinatory array logic that is closed under propositional operations and Hoare triples. A classification according to expressiveness of six different fragments studied in the literature is given.
ISSN:2352-2208
DOI:10.1016/j.jlamp.2023.100906