|Can we represent bug pattern? firstname.lastname@example.org (2004-10-30)|
|Re: Can we represent bug pattern? email@example.com (2004-11-02)|
|Re: Can we represent bug pattern? firstname.lastname@example.org (Robert Metzger) (2004-11-06)|
|Date:||30 Oct 2004 22:48:39 -0400|
|Posted-Date:||30 Oct 2004 22:48:39 EDT|
Every programmer has experienced debugging. There are automated
checkers available now which does static/dynamic analysis to detect
bugs. I hope the bugs (may not be all) will follow some specific
patterns. Like null deref follows (declare - use) without
initialization. Will it be possible to represent the "bugs pattern"
by some represntaion? The tools like MOPS represent security
vulnerability as a finite automaton (representation for flaw) and
program by PDA. So it checks if regular expression is present in the
language of PDA.
In this way is it possible to represent "bug pattern".
Return to the
Search the comp.compilers archives again.