Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Monotonic abstraction for programs with multiply-linked structures
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
2013 (English)In: International Journal of Foundations of Computer Science, ISSN 0129-0541, Vol. 24, no 2, 187-210 p.Article in journal (Refereed) Published
Abstract [en]

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.

Place, publisher, year, edition, pages
2013. Vol. 24, no 2, 187-210 p.
National Category
Computer Science
Identifiers
URN: urn:nbn:se:uu:diva-190238DOI: 10.1142/S0129054113400078ISI: 000319838100003OAI: oai:DiVA.org:uu-190238DiVA: diva2:583204
Projects
UPMARC
Funder
Swedish Research Council
Available from: 2013-01-08 Created: 2013-01-07 Last updated: 2017-12-06Bibliographically approved

Open Access in DiVA

fulltext(347 kB)227 downloads
File information
File name FULLTEXT02.pdfFile size 347 kBChecksum SHA-512
a29db6233b6b043ddd707ca801638aacc4c503233bf2b9dbeb1e0ca0a2a89a6af2dde9571887f0b337e1a7a41082e3f999ff5e1257a22547805690f9e85d107d
Type fulltextMimetype application/pdf

Other links

Publisher's full text

Search in DiVA

By author/editor
Abdulla, Parosh AzizCederberg, Jonathan
By organisation
Computer Systems
In the same journal
International Journal of Foundations of Computer Science
Computer Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 227 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 734 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf