An extension to Pointer Logic for verification

  • Wang Zhifang*
  • , Chen Yiyun
  • , Wang Zhenming
  • , Wang Wei
  • , Tian Bo
  • *Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Scopus citations

Abstract

The safety of pointer programs is an important issue in high-assurance software design, and their verification remains a major challenge. Pointer Logic has been proposed to verify basic safety properties of pointer programs in our previous work, but still lacks support for a wide range of pointer programs. In this work, we present an extension to Pointer Logic by: 1) introducing modular reasoning to scale better on programs involving function calls; 2) allowing pointer arithmetic to take more advantage of pointers in programming. Moreover, to demonstrate that Pointer Logic is a useful approach to verification, we implement a tool..... plcc to automatically verify a range of non-trivial programs, including basic operations on singly-linked lists, trees, circular doubly-linked list, dynamic arrays etc..

Original languageEnglish
Title of host publicationProceedings - 2nd IFIP/IEEE International Symposium on Theoretical Aspects of Software Engineering, TASE 2008
Pages49-56
Number of pages8
DOIs
StatePublished - 2008
Externally publishedYes
Event2nd IFIP/IEEE International Symposium on Theoretical Aspects of Software Engineering, TASE 2008 - Nanjing, China
Duration: 17 Jun 200819 Jun 2008

Publication series

NameProceedings - 2nd IFIP/IEEE International Symposium on Theoretical Aspects of Software Engineering, TASE 2008

Conference

Conference2nd IFIP/IEEE International Symposium on Theoretical Aspects of Software Engineering, TASE 2008
Country/TerritoryChina
CityNanjing
Period17/06/0819/06/08

Fingerprint

Dive into the research topics of 'An extension to Pointer Logic for verification'. Together they form a unique fingerprint.

Cite this