Skip to content
Free planNo credit card requiredStart writing
AI for Research home
AI for Research home
Dashboard
Sign inGet started

book chapter · Frontiers in artificial intelligence and applications · 2009

Software Verification

Daniel Kroening

Cited by 1Abstract and details only

Abstract

This chapter covers an application of propositional satisfiability to program analysis. We focus on the discovery of programming flaws in low-level programs, such as embedded software. The loops in the program are unwound together with a property to form a formula, which is then converted into CNF. The method supports low-level programming constructs such as bit-wise operators or pointer arithmetic.

Cite this paper

APA 7

Kroening, D. (2009). Software Verification. Frontiers in artificial intelligence and applications. https://doi.org/10.3233/978-1-58603-929-5-505

MLA 9

Kroening, Daniel. “Software Verification.” Frontiers in artificial intelligence and applications, 2009, https://doi.org/10.3233/978-1-58603-929-5-505.

Chicago

Kroening, Daniel. 2009. “Software Verification.” Frontiers in artificial intelligence and applications. https://doi.org/10.3233/978-1-58603-929-5-505.

Harvard

Kroening, D. (2009) ‘Software Verification’, Frontiers in artificial intelligence and applications. Available at: https://doi.org/10.3233/978-1-58603-929-5-505.

BibTeX
@incollection{kroening2009software,
  title = {{Software Verification}},
  author = {Kroening, Daniel},
  booktitle = {Frontiers in artificial intelligence and applications},
  year = {2009},
  doi = {10.3233/978-1-58603-929-5-505}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.

Related papers