By Topic

A formal software verification concept based on automated theorem proving and reverse engineering

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Popovic, M. ; Fac. of Eng., Novi Sad Univ., Serbia ; Kovacevic, V. ; Velikic, I.

Formal software verification typically involves some levels of static theorem proving which is a mathematical process of proving that the function computed by a program match the function specified. A theorem prover, such as THEO, automates this process. On the other hand, reverse engineering is a process inverse to traditional engineering. An example extracts the software specification from its source code. In this paper we present a formal software verification concept, which is based on automated theorem proving and reverse engineering. We are mainly concerned with communications software and with software for families of communication protocols in particular. In the paper we describe how to: (1) model a group of finite state machines using predicate calculus; (2) extract axiomatic software specification from the source code and log files; and (3) formally verify software for a given operational profile (set of test cases). The concept has been successfully applied to a call processing software for systems, which are installed and fully operational in Moscow and Saint Petersburg, Russia

Published in:

Engineering of Computer-Based Systems, 2002. Proceedings. Ninth Annual IEEE International Conference and Workshop on the

Date of Conference:

2002