Arrays Made Simpler: An Efficient, Scalable and Thorough Preprocessing

DOI10.29007/dc9bzbMath1415.68145OpenAlexW2906755653MaRDI QIDQ5222967

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

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

zbMATH Keywords

satisfiability modulo theorytheory of arraysread-over-write simplification

Mathematics Subject Classification ID

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

Related Items (1)

Not all bugs are created equal, but robust reachability can tell the difference

Uses Software

• z3
• BINSEC/SE

This page was built for publication: Arrays Made Simpler: An Efficient, Scalable and Thorough Preprocessing