Template-Based Verification of Heap-Manipulating Programs

We propose a shape analysis suitable for analysis engines that perform automatic invariant inference using an SMT solver. The proposed solution includes an abstract template domain that encodes the shape of the program heap based on logical formulae over bit-vectors. It is based on computing a point...

Full description

Bibliographic Details

Published in:	2018 Formal Methods in Computer Aided Design (FMCAD) pp. 1 - 9
Main Authors:	Malik, Viktor, Hruska, Martin, Schrammel, Peter, Vojnar, Tomas
Format:	Conference Proceeding
Language:	English
Published:	FMCAD Inc 01-10-2018
Subjects:	Cognition Data structures Dynamic scheduling Reactive power Shape Software
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!