de.mpg.escidoc.pubman.appbase.FacesBean
English
 
Help Guide Privacy Policy Disclaimer Contact us
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
 
 
DownloadE-Mail
  On verifying complex properties using symbolic shape analysis

Wies, T., Kuncak, V., Zee, K., Podelski, A., & Rinard, M.(2006). On verifying complex properties using symbolic shape analysis (MPI-I-2006-2-001). Saarbrücken: Max-Planck-Institut für Informatik.

Item is

Basic

show hide
Item Permalink: http://hdl.handle.net/11858/00-001M-0000-0014-6817-4 Version Permalink: http://hdl.handle.net/11858/00-001M-0000-0014-77BA-0
Genre: Report

Files

show Files
hide Files
:
MPI-I-2006-2-001.ps (Any fulltext), 378KB
Description:
-
Visibility:
Public
MIME-Type / Checksum:
application/postscript / [MD5]
Technical Metadata:
Copyright Date:
-
Copyright Info:
-
License:
-

Locators

show

Creators

show
hide
 Creators:
Wies, Thomas1, Author              
Kuncak, Viktor2, Author
Zee, Karen2, Author
Podelski, Andreas1, Author              
Rinard, Martin2, Author
Affiliations:
1Programming Logics, MPI for Informatics, Max Planck Society, escidoc:40045              
2External Organizations, escidoc:persistent22              

Content

show
hide
Free keywords: -
 Abstract: One of the main challenges in the verification of software systems is the analysis of unbounded data structures with dynamic memory allocation such as linked data structures and arrays. We describe Bohne a new analysis for verifying data structures. Bohne verifies data structure operations and shows that 1) the operations preserve data structure invariants and 2) the operations satisfy their specifications expressed in terms of changes to the set of objects stored in the data structure. During the analysis Bohne infers loop invariants in the form of disjunctions of universally quantified Boolean combinations of formulas represented as sets of binary decision diagrams. To synthesize loop invariants of this form Bohne uses a combination of decision procedures for Monadic Second-Order Logic over trees SMT-LIB decision procedures (currently CVC Lite) and an automated reasoner within the Isabelle interactive theorem prover. This architecture shows that synthesized loop invariants can serve as a useful communication mechanism between different decision procedures. In addition Bohne uses field constraint analysis a combination mechanism that enables the use of uninterpreted function symbols within formulas of Monadic Second-Order Logic over trees. Using Bohne we have verified operations on data structures such as linked lists with iterators and back pointers trees with and without parent pointers two-level skip lists array data structures and sorted lists. We have deployed Bohne in the Hob and Jahob data structure analysis systems enabling us to combine Bohne with analyses of data structure clients and apply it in the context of larger programs. This report describes the Bohne algorithm as well as techniques that Bohne uses to reduce the ammount of annotations and the running time of the analysis.

Details

show
hide
Language(s): eng - English
 Dates: 2006
 Publication Status: Published in print
 Pages: 32 p.
 Publishing info: Saarbrücken : Max-Planck-Institut für Informatik
 Table of Contents: -
 Rev. Method: -
 Identifiers: URI: http://domino.mpi-inf.mpg.de/internet/reports.nsf/NumberView/2006-2-001
Report Nr.: MPI-I-2006-2-001
 Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show
hide
Title: Research Report / Max-Planck-Institut für Informatik
Source Genre: Series
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: - Identifier: -