Verified symbolic execution with Kripke specification monads (and no meta-programming)

Steven Keuchel, Sander Huyghebaert, Georgy Lukyanov, Dominique Devriese

Research output: Contribution to journalArticlepeer-review

4 Citations (Scopus)

Abstract

Verifying soundness of symbolic execution-based program verifiers is a significant challenge. This is especially true if the resulting tool needs to be usable outside of the proof assistant, in which case we cannot rely on shallowly embedded assertion logics and meta-programming. The tool needs to manipulate deeply embedded assertions, and it is crucial for efficiency to eagerly prune unreachable paths and simplify intermediate assertions in a way that can be justified towards the soundness proof. Only a few such tools exist in the literature, and their soundness proofs are intricate and hard to generalize or reuse. We contribute a novel, systematic approach for the construction and soundness proof of such a symbolic execution-based verifier. We first implement a shallow verification condition generator as an object language interpreter in a specification monad, using an abstract interface featuring angelic and demonic nondeterminism. Next, we build a symbolic executor by implementing a similar interpreter, in a symbolic specification monad. This symbolic monad lives in a universe that is Kripke-indexed by variables in scope and a path condition. Finally, we reduce the soundness of the symbolic execution to the soundness of the shallow execution by relating both executors using a Kripke logical relation. We report on the practical application of these techniques in Katamaran, a tool for verifying security guarantees offered by instruction set architectures (ISAs). The tool is fully verified by combining our symbolic execution machinery with a soundness proof of the shallow verification conditions against an axiomatized separation logic, and an Iris-based implementation of the axioms, proven sound against the operational semantics. Based on our experience with Katamaran, we can report good results on practicality and efficiency of the tool, demonstrating practical viability of our symbolic execution approach.

Original languageEnglish
Article number3547628
JournalProceedings of the ACM on Programming Languages
Volume6
Issue numberICFP
DOIs
Publication statusPublished - 29 Aug 2022

Bibliographical note

Publisher Copyright:
© 2022 Owner/Author.

Copyright:
Copyright 2022 Elsevier B.V., All rights reserved.

Keywords

  • logical relations
  • predicate transformers
  • program verification
  • refinement
  • separation logic
  • symbolic execution

Fingerprint

Dive into the research topics of 'Verified symbolic execution with Kripke specification monads (and no meta-programming)'. Together they form a unique fingerprint.

Cite this