Thursday, February 11, 2010

String predicates as finite automata

One of the interesting things mentioned in the paper we discussed Tuesday was work on using automata to characterize strings. If you're interested in the paper that was reference [54], the IEEE DL link is:
http://doi.ieeecomputersociety.org/10.1109/TAIC.PART.2007.34

A related paper is Precise
analysis of string expressions
by A. Christensen, A. Møller, and M. Schwartzbach, in Proc. 10th International
Static Analysis Symposium (SAS’03)
June 2004.

No comments:

Post a Comment