uu.seUppsala University Publications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • 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
Automating regression verification of pointer programs by predicate abstraction
Karlsruhe Inst Technol, Inst Theoret Informat, Karlsruhe, Germany.
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.ORCID iD: 0000-0002-2733-7098
Karlsruhe Inst Technol, Inst Theoret Informat, Karlsruhe, Germany.
2018 (English)In: Formal methods in system design, ISSN 0925-9856, E-ISSN 1572-8102, Vol. 52, no 3, p. 229-259Article in journal (Refereed) Published
Abstract [en]

Regression verification is an approach complementing regression testing with formal verification. The goal is to formally prove that two versions of a program behave either equally or differently in a precisely specified way. In this paper, we present a novel automated approach for regression verification that reduces the equivalence of two related imperative pointer programs to constrained Horn clauses over uninterpreted predicates. Subsequently, state-of-the-art SMT solvers are used to solve the clauses. We have implemented the approach, and our experiments show that non-trivial programs with integer and pointer arithmetic can now be proved equivalent without further user input.

Place, publisher, year, edition, pages
2018. Vol. 52, no 3, p. 229-259
Keywords [en]
Regression verification, Horn constraint solving, Program equivalence, Relational program verification
National Category
Computer Sciences
Identifiers
URN: urn:nbn:se:uu:diva-356860DOI: 10.1007/s10703-017-0293-8ISI: 000431870700002OAI: oai:DiVA.org:uu-356860DiVA, id: diva2:1239093
Funder
Swedish Research Council, 2014-5484Available from: 2018-08-15 Created: 2018-08-15 Last updated: 2018-12-07Bibliographically approved

Open Access in DiVA

fulltext(502 kB)93 downloads
File information
File name FULLTEXT01.pdfFile size 502 kBChecksum SHA-512
6c16d69d671ffb311ec634ee75a73494932b8249e72c2f0619c7d2d03cf43932982620039a7867fc24cad0a7b993afd83bd97c56d887b3e01030bb7f0db3e498
Type fulltextMimetype application/pdf

Other links

Publisher's full text

Authority records BETA

Rümmer, Philipp

Search in DiVA

By author/editor
Rümmer, Philipp
By organisation
Computer Systems
In the same journal
Formal methods in system design
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar
Total: 93 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: 99 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • 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