FindBugs uses many different analysis algorithms.
A good general survey of FindBugs is our OOPSLA 2004 paper:
http://findbugs.sourceforge.net/docs/oopsla2004.pdfA couple more recent papers on the null-pointer analysis
(at PASTE 2007 and PASTE 2005):
http://findbugs.cs.umd.edu/papers/MoreNullPointerBugs07.pdf http://faculty.ycp.edu/~dhovemey/pubs/paste2005.pdfThe analysis used to check uses of JSR-305 type qualifiers
is very similar to the null pointer analysis described in the
PASTE 2007 paper.
Many of the analyses are based on standard
intraprocedural dataflow analysis. A few detectors use
an intraprocedural analysis to compute method summaries
which are used for interprocedural analysis. However,
FindBugs generally doesn't try very hard to work out what methods
might be callable at virtual call sites, or to iterate the
interprocedural analysis to propagate information to arbitrarily
deep chains of method calls.
Hope this helps.
-Dave
On Tue, Jul 15, 2008 at 11:15 AM, Leonardo Passos <
lnrdpss@...> wrote:
> I would like to know the references of the algorithms used in
> FindBugs, since the static analysis is a well defined subject in
> today's computer science . I could not find such information anywhere
> on the project web site.
> _______________________________________________
> Findbugs-discuss mailing list
>
Findbugs-discuss@...
>
https://mailman.cs.umd.edu/mailman/listinfo/findbugs-discuss>
_______________________________________________
Findbugs-discuss mailing list
Findbugs-discuss@...
https://mailman.cs.umd.edu/mailman/listinfo/findbugs-discuss
