Multi-prover verification of C programs

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

Abstract

Our goal is the verification of C programs at the source code level using formal proof tools. Programs are specified using annotations such as pre- and post-conditions and global invariants. An original approach is presented which allows to formally prove that a function implementation satisfies its specification and is free of null pointer dereferencing and out-of-bounds array access. The method is not bound to a particular back-end theorem prover. A significant part of the ANSI C language is supported, including pointer arithmetic and possible pointer aliasing. We describe a prototype tool and give some experimental results.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
EditorsJim Davies, Wolfram Schulte, Mike Barnett
PublisherSpringer Verlag
Pages15-29
Number of pages15
ISBN (Electronic)3540238417, 9783540238416
DOIs
Publication statusPublished - 1 Jan 2004
Externally publishedYes

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3308
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Keywords

  • C programming language
  • Formal verification and proof
  • Hoare logic
  • Pointer programs

Fingerprint

Dive into the research topics of 'Multi-prover verification of C programs'. Together they form a unique fingerprint.

Cite this