A New Acceleration-Based Combination Framework for Array Properties
From MaRDI portal
Publication:2964461
DOI10.1007/978-3-319-24246-0_11zbMath1471.68232OpenAlexW2295800466MaRDI QIDQ2964461
Natasha Sharygina, Francesco Alberti, Silvio Ghilardi
Publication date: 27 February 2017
Published in: Frontiers of Combining Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-24246-0_11
Decidability of theories and sets of sentences (03B25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Decision procedures for flat array properties
- On iterating linear transformations over recognizable sets of integers
- Definability of Accelerated Relations in a Theory of Arrays and Its Applications
- LOGICAL THEORIES OF ONE-PLACE FUNCTIONS ON THE SET OF NATURAL NUMBERS
- Booster: An Acceleration-Based Verification Framework for Array Programs
- Fast Acceleration of Ultimately Periodic Relations
- Iterating Octagons
- Presburger arithmetic with unary predicates is Π11 complete
- A Logic of Singly Indexed Arrays
- MCMT: A Model Checker Modulo Theories
- Verification, Model Checking, and Abstract Interpretation
This page was built for publication: A New Acceleration-Based Combination Framework for Array Properties