Detail publikace

Monotonic Abstraction for Programs with Multiply-Linked Structures

CEDERBERG, J. VOJNAR, T. ABDULLA, P.

Originální název

Monotonic Abstraction for Programs with Multiply-Linked Structures

Typ

článek v časopise - ostatní, Jost

Jazyk

angličtina

Originální abstrakt

We investigate the use of monotonic abstraction and backward reachability analysis as means of performing shape analysis on programs with multiply pointed structures. By encoding the heap as a vertex- and edge-labeled graph, we can model the low level behaviour exhibited by programs written in the C programming language. Using the notion of signatures, which are predicates that define sets of heaps, we can check properties such as absence of null pointer dereference and shape invariants. We report on the results from running a prototype based on the method on several programs such as insertion into and merging of doubly-linked lists.

Klíčová slova

formal verification, program analysis, upward closed sets, monotonic abstraction, dynamic memory, pointers, dynamic linked data structures, multiple selectors, doubly-linked lists, trees, null pointer dereference, dangling pointers, memory leakage

Autoři

CEDERBERG, J.; VOJNAR, T.; ABDULLA, P.

Rok RIV

2011

Vydáno

28. 9. 2011

ISSN

0302-9743

Periodikum

Lecture Notes in Computer Science

Ročník

2011

Číslo

6945

Stát

Spolková republika Německo

Strany od

125

Strany do

138

Strany počet

14

URL

http://www.springerlink.com/content/u75210w230688v22

BibTex

@article{BUT76409,
  author="Jonathan {Cederberg} and Tomáš {Vojnar} and Parosh {Abdulla}",
  title="Monotonic Abstraction for Programs with Multiply-Linked Structures",
  journal="Lecture Notes in Computer Science",
  year="2011",
  volume="2011",
  number="6945",
  pages="125--138",
  issn="0302-9743",
  url="http://www.springerlink.com/content/u75210w230688v22"
}