research-article

Open access

Generalised multi-pattern-based verification of programs with linear linked structures

Authors:

Pavel Erlebach,

Tomáš VojnarAuthors Info & Claims

Formal Aspects of Computing, Volume 19, Issue 3

Pages 363 - 374

https://doi.org/10.1007/s00165-007-0031-x

Published: 01 August 2007 Publication History

Abstract

The paper deals with the problem of automatic verification of programs working with extended linear linked dynamic data structures, in particular, pattern-based verification is considered. In this approach, one can abstract memory configurations by abstracting away the exact number of adjacent occurrences of certain memory patterns. With respect to the previous work on the subject the method presented in the paper has been extended to be able to handle multiple patterns, which allows for verification of programs working with more types of structures and/or with structures with irregular shapes. The experimental results obtained from a prototype implementation of the method show that the method is very competitive and offers a big potential for future extensions.

References

References

[1]

Bouajjani A, Habermehl P, Moro P, Vojnar T (2005) Verifying programs with dynamic 1-selector-linked structures in regular model checking. In: Proceedings of TACAS’05. LNCS, Vol 3440. Springer, Heidelberg

[2]

Bouajjani A, Habermehl P, Vojnar T (2004) Abstract regular model checking. In: Proceedings of CAV’04. LNCS, Vol 3114. Springer, Heidelberg

[3]

Bozga M, Iosif R, Lakhnech Y (2003) Storeless semantics and alias logic. In: Proceedings of PEPM’03. ACM Press, New York

[4]

Češka M, Erlebach P, Vojnar T (2006) Pattern-based verification of programs with extended linear linked data structures. In: Proceedings of AVoCS’05. ENTCS, Vol 145. Elsevier, Amsterdam

[5]

Deutsch A (1994) Interprocedural may-alias analysis for pointers: beyond k-limiting. In: Proceedings of PLDI’94. ACM Press, New York

[6]

Immerman N, Rabinovich A, Reps T, Sagiv M, Yorsh G (2004) Verification via structure simulation. In: Proceedings of CAV’04. LNCS, Vol 3114. Springer, Heidelberg

[7]

Jonkers HBM (1981) Abstract storage structures. In: Algorithmic languages. IFIP

[8]

Klarlund N, Møller A (2001) MONA version 1.4 user manual. BRICS, Department of Computer Science, University of Aarhus

[9]

Lee O, Yang H, Yi K (2005) Automatic verification of pointer programs using grammar-based shape analysis. In: Proceedings of ESOP’05. LNCS, Vol 3444. Springer, Heidelberg

[10]

Loginov A, Reps T, Sagiv M (2005) Abstraction refinement via inductive learning. In: Proceedings of CAV’05 (to appear)

[11]

Møller A, Schwartzbach MI (2001) The pointer assertion logic engine. In: Proceedings of PLDI’01. ACM Press, New York. Also in SIGPLAN notices 36(5)

[12]

Sagiv S, Reps TW, and Wilhelm R Parametric shape analysis via 3-valued logic ACM Trans Program Lang Syst 2002 24 3 217

Digital Library

[13]

Venet A (2005) A scalable nonuniform pointer analysis for embedded programs. In: Proceedings of SAS’04. LNCS, Vol 3148. Springer, Heidelberg

[14]

Venet A Automatic analysis of pointer aliasing for untyped programs Sci Comput Program 1999 35 2 223-248

Digital Library

[15]

Yavuz-Kahveci T (2004) Specification and automated verification of concurrent software systems. PhD Thesis, Computer Science Department of University of California

[16]

Yavuz-Kahveci T, Bultan T (2002) Automated verification of concurrent linked lists with counters. In: Proceedings of SAS’02. LNCS, Vol 2477. Springer, Heidelberg

Cited By

Dufourd J(2015)Formal study of functional orbits in finite domainsTheoretical Computer Science10.1016/j.tcs.2014.10.041564(63-88)Online publication date: Jan-2015
https://doi.org/10.1016/j.tcs.2014.10.041
Berdine JCalcagno CCook BDistefano DO'Hearn PWies TYang H(2007)Shape analysis for composite data structuresProceedings of the 19th international conference on Computer aided verification10.5555/1770351.1770381(178-192)Online publication date: 3-Jul-2007
https://dl.acm.org/doi/10.5555/1770351.1770381
Berdine JCalcagno CCook BDistefano DO’Hearn PWies TYang H(2007)Shape Analysis for Composite Data StructuresComputer Aided Verification10.1007/978-3-540-73368-3_22(178-192)Online publication date: 2007
https://doi.org/10.1007/978-3-540-73368-3_22

Index Terms

Generalised multi-pattern-based verification of programs with linear linked structures
1. Software and its engineering
2. Theory of computation
  1. Semantics and reasoning
    1. Program reasoning

Index terms have been assigned to the content through auto-classification.

Recommendations

Pattern-Based Verification of Programs with Extended Linear Linked Data Structures

The paper deals with the problem of automatic verification of programs with dynamic linked data structures. In particular, the use of pattern-based abstraction of memory configurations is considered. In this approach, one can abstract memory ...
Temporal property verification as a program analysis task

We describe a reduction from temporal property verification to a program analysis problem. First we present a proof system that, unlike the standard formulation, is more amenable to reasoning about infinite-state systems: disjunction is treated by ...
Software Verification with CPAchecker 3.0: Tutorial and User Guide
Formal Methods
Abstract
This tutorial provides an introduction to CPAchecker for users. CPAchecker is a flexible and configurable framework for software verification and testing. The framework provides many abstract domains, such as BDDs, explicit values, intervals, ...

Comments

Information & Contributors

Information

Published In

cover image Formal Aspects of Computing

Formal Aspects of Computing Volume 19, Issue 3

Aug 2007

135 pages

ISSN:0934-5043

EISSN:1433-299X

Issue’s Table of Contents

© British Computer Society 2007.

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 01 August 2007

Accepted: 12 February 2007

Revision received: 15 August 2006

Received: 24 March 2006

Published in FAC Volume 19, Issue 3

Author Tags

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
55
Total Downloads

Downloads (Last 12 months)38
Downloads (Last 6 weeks)7

Reflects downloads up to 08 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Dufourd J(2015)Formal study of functional orbits in finite domainsTheoretical Computer Science10.1016/j.tcs.2014.10.041564(63-88)Online publication date: Jan-2015
https://doi.org/10.1016/j.tcs.2014.10.041
Berdine JCalcagno CCook BDistefano DO'Hearn PWies TYang H(2007)Shape analysis for composite data structuresProceedings of the 19th international conference on Computer aided verification10.5555/1770351.1770381(178-192)Online publication date: 3-Jul-2007
https://dl.acm.org/doi/10.5555/1770351.1770381
Berdine JCalcagno CCook BDistefano DO’Hearn PWies TYang H(2007)Shape Analysis for Composite Data StructuresComputer Aided Verification10.1007/978-3-540-73368-3_22(178-192)Online publication date: 2007
https://doi.org/10.1007/978-3-540-73368-3_22

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

Figures

Tables

Media

View Issue’s Table of Contents