Is the valid state domain of a program a regular language?

Posted by BCS on Stack Overflow See other posts from Stack Overflow or by BCS
Published on 2010-04-09T21:18:33Z Indexed on 2010/04/09 21:33 UTC
Read the original article Hit count: 494

If you look at the call stack of a program and treat each return pointer as a token, what kind of automata is needed to build a recognizer for the valid states of the program?

As a corollary, what kind of automata is needed to build a recognizer for a specific bug state?


My thought is that if these form regular languages than some interesting tools could be built around that. E.g. given a set of crash/failure dumps, automatically group them and generate a recognizer to identify new instances of know bugs.

© Stack Overflow or respective owner

Related posts about formal-languages

Related posts about bug-tracking