Verification conditions for single-assignment programs
A mechanism for generating verification conditions (VCs) for the iteration-free fragment of an imperative language is fundamental in any deductive program verification system. In this paper we revisit symbolic execution, weakest preconditions, and bounded model checking as VC-generation mechanisms,...
Main Author: | |
---|---|
Other Authors: | , |
Format: | conferencePaper |
Language: | eng |
Published: |
2012
|
Subjects: | |
Online Access: | http://hdl.handle.net/1822/30966 |
Country: | Portugal |
Oai: | oai:repositorium.sdum.uminho.pt:1822/30966 |