A few challenges for static program analysis by abstract interpretation are finally briefly discussed.
Additionally, in the electronic version of the paper, we additionally compare static program analysis with deductive methods, model-checking and type inference. Their foundational ideas are briefly reviewed, and the shortcomings of these four methods are discussed, including when they should be combined. Alternatively, since program debugging is still the main program verification method used in the software industry, we suggest to combine formal with informal methods.
Finally, the grand challenge for all formal methods and tools is to solve the software reliability, trustworthiness or robustness problems. A few challenges more specific to static program analysis by abstract interpretation are briefly discussed.
\bibitem{Cousot00-LNCS-2000} P{.} Cousot. \newblock Abstract Interpretation Based Formal Methods and Future Challenges. \newblock In \emph{<<~Informatics --- 10 Years Back, 10 Years Ahead~>>}, R{.} Wilhelm (Ed.). Lecture Notes in Computer Science Vol{.} 2000, pages 138--156. Springer-Verlag, 2001. @incollection{Cousot00-LNCS-2000, author = {Cousot, P{.}}, title = {Abstract Interpretation Based Formal Methods and Future Challenges, invited paper}, booktitle = {<<~Informatics --- 10 Years Back, 10 Years Ahead~>>}, editor = {Wilhelm, R{.}}, year = {2001}, series = {Lecture Notes in Computer Science}, volume = 2000, pages = {138--156}, publisher = {Springer-Verlag}, }
, Springer-Verlag copyright notice.
Last modified:
Friday, 04-May-2012 15:04:15 EDT