Automated Formal Static Analysis and Retrieval of Source Code - JKU

Chapter 4
Conclusions
In this thesis we presented two approaches for analyzing the source code: formal static analysis
and retrieval.
The formal static analysis method of source code is based on forward symbolic execution
and functional semantics. A prototype environment (FwdVCG) combining these techniques was
implemented which generates the verification conditions necessary for checking the imperative
program correctness. We implemented it in the Theorema system and we tested it on programs
written in our mini-programming language.
For checking the validity of the verification conditions we built a prototype simplifier that
reduces the verification conditions to (systems of) equalities and inequalities. The simplified
formulae were obtained using first order logic inference rules, truth constants and simple algebraic
simplifications.
As future work we want to apply and automate advanced algebraic and combinatorial algorithms
and methods in order to check their validity. A promising approach seems to be the
Fourier-Motzkin Elimination method ([Sch86]), especially for systems of inequalities with small
number of constraints and variables because of the time complexity reasons.
The automated retrieval of source code objects was done by extending the functionality of the
MES, namely: (i) implementing a custom crawler, CodeSearch category specific, that interacts
with MES services; (ii) integration of the CodeSearch data source into the MES infrastructure for
making possible the search within the source code files; (iii) enhancing the user interface with
CodeSearch category specific context actions and data-drilling operations.
Some of the open functionalities of the MCS are: (i) the implementation of complex context
actions which require the information stored in the database; (ii) the synchronization of the index
with the data obtained from crawling to avoid inconsistencies; (iii) add authentication and
authorization rules CodeSearch category specific, etc.
We also propose a design solution for the integration of FwdVCG into Mindbreeze Code Search,
which shows how the formal methods can be used in real software programs rather than being used
for verification of small programs.
Problem Specification. We are interested in the retrieval of the callables artifacts and their
specification from the source code files repositories crawled.
Due to the Rats! parser, we are able to retrieve just the Java methods and the JML specifica-
53