AI helps you reading Science
Forest automata for verification of heap manipulation
Formal Methods in System Design, no. 1 (2012): 424-440
EI
Full Text
Abstract
We consider verification of programs manipulating dynamic linked data structures such as various forms of singly and doubly-linked
lists or trees. We consider important properties for this kind of systems like no null-pointer dereferences, absence of garbage,
shape properties, etc. We develop a verification method based on a novel use...More
Code:
Data:
Tags
Comments
数据免责声明
页面数据均来自互联网公开来源、合作出版商和通过AI技术自动分析结果,我们不对页面数据的有效性、准确性、正确性、可靠性、完整性和及时性做出任何承诺和保证。若有疑问,可以通过电子邮件方式联系我们:report@aminer.cn