Arrays made simpler: an efficient, scalable and thorough preprocessing

DOI10.29007/DC9BzbMATH Open1415.68145OpenAlexW2906755653MaRDI QIDQ5222967FDOQ5222967

Authors: Benjamin Farinier, Robin David, Sébastien Bardin, Matthieu Lemerre 

Publication date: 4 July 2019

Published in: EPiC Series in Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.29007/dc9b

Recommendations

• Decision procedures for extensions of the theory of arrays
• Deciding Extensions of the Theory of Arrays by Integrating Decision Procedures and Instantiation Strategies
• Abstraction Refinement for Quantified Array Assertions
• Verification, Model Checking, and Abstract Interpretation
• Array theory of bounded elements and its applications

zbMATH Keywords

satisfiability modulo theorytheory of arraysread-over-write simplification

Mathematics Subject Classification ID

Data structures (68P05) Specification and verification (program logics, model checking, etc.) (68Q60)

Cited In (4)

• Not all bugs are created equal, but robust reachability can tell the difference
• Introducing robust reachability
• Efficient representation scheme for multidimensional array operations
• Adversarial reachability for program-level security analysis

Uses Software

• z3
• BINSEC/SE

This page was built for publication: Arrays made simpler: an efficient, scalable and thorough preprocessing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5222967)