Advanced Search
DSpace@MIT

What is Decidable about Strings?

Research and Teaching Output of the MIT Community

Show simple item record

dc.contributor.advisor Martin Rinard
dc.contributor.author Ganesh, Vijay en_US
dc.contributor.author Minnes, Mia en_US
dc.contributor.author Solar-Lezama, Armando en_US
dc.contributor.author Rinard, Martin en_US
dc.contributor.other Computer Architecture en
dc.date.accessioned 2011-02-01T20:15:11Z
dc.date.available 2011-02-01T20:15:11Z
dc.date.issued 2011-02-01
dc.identifier.uri http://hdl.handle.net/1721.1/60877
dc.description.abstract We prove several decidability and undecidability results for the satisfiability/validity problem of formulas over a language of finite-length strings and integers (interpreted as lengths of strings). The atomic formulas over this language are equality over string terms (word equations), linear inequality over length function (length constraints), and membership predicate over regularexpressions (r.e.). These decidability questions are important in logic, program analysis and formal verification. Logicians have been attempting to resolve some of these questions for many decades, while practical satisfiability procedures for these formulas are increasingly important in the analysis of string-manipulating programs such as web applications and scripts. We prove three main theorems. First, we consider Boolean combination of quantifier-free formulas constructed out of word equations and length constraints. We show that if word equations can be converted to a solved form, a form relevant in practice, then the satisfiability problem for Boolean combination of word equations and length constraints is decidable. Second, we show that the satisfiability problem for word equations in solved form that areregular, length constraints and r.e. membership predicate is also decidable. Third, we show that the validity problem for the set of sentences written as a forall-exists quantifier alternation applied to positive word equations is undecidable. A corollary of this undecidability result is that this set is undecidable even with sentences with at most two occurrences of a string variable. en_US
dc.format.extent 16 p. en_US
dc.relation.ispartofseries MIT-CSAIL-TR-2011-006
dc.subject Theories of strings en_US
dc.subject decidability en_US
dc.subject undecidability en_US
dc.subject word equations en_US
dc.subject regular expressions en_US
dc.subject JavaScript en_US
dc.subject Formal methods en_US
dc.subject Program Analysis en_US
dc.title What is Decidable about Strings? en_US


Files in this item

Name Size Format Description
MIT-CSAIL-TR-2011 ... 209.5Kb PDF

This item appears in the following Collection(s)

Show simple item record

MIT-Mirage