1 paper
Adithya Murali, Hrishikesh Balakrishnan, Aaron Councilman +1
We develop the first two heap logics that have implicit heaplets and that admit FO-complete program verification. The notion of FO-completeness is a theoretical guarantee that all…