Assertion Checking Environment (ACE) for formal verification of C programs

3Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper we describe an Assertion Checking Environment(ACE) for compositional verification of programs which are written in an industrially sponsored safe sub-set of C programming language called MISRA C [1]. The theory is based on Hoare logic [2] and the C programs are verified using static assertion checking technique. First the functional specifications of the program, captured in the form of preand post-conditions for each C function, are derived from the specifications. These pre- and post-conditions are then introduced as assertions(annotations or formal comments) in the program code. The assertions are then proved formally using ACE and theorem proving tool called Stanford Temporal Prover(STeP) [3]. ACE has been developed by us and consists of a translator c2spl, a GUI and some utility programs. The technique and tools developed are targeted towards verification of embedded software.

Cite

CITATION STYLE

APA

Sharma, B., Dhodapkar, S. D., & Ramesh, S. (2002). Assertion Checking Environment (ACE) for formal verification of C programs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2434, pp. 284–295). Springer Verlag. https://doi.org/10.1007/3-540-45732-1_28

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free