### Abstract

Strings are pervasive in programming, and arguably even more pervasive in web programming. A natural abstraction for reasoning about strings are finite-automata. They are a well-understood formalism, and operations on them are decidable and well-known. But in practice these operations either blow up in size or in cost of operations. Hence the attractive automata representations become impractical. In this paper we propose reasoning about strings using small automata, by restricting the number of states available. We show how we can construct small automata which over-approximate the language specified by a larger automata, using discrete optimization techniques, both complete approaches and incomplete approaches based on greedy search. Small automata provide a strong basis for reasoning about strings in programming, since operations on small automata do not blow up in cost.

Original language | English |
---|---|

Title of host publication | Automated Technology for Verification and Analysis |

Subtitle of host publication | 15th International Symposium, ATVA 2017 Pune, India, October 3–6, 2017 Proceedings |

Editors | Deepak D’Souza, K. Narayan Kumar |

Place of Publication | Cham Switzerland |

Publisher | Springer |

Pages | 67-83 |

Number of pages | 17 |

ISBN (Electronic) | 9783319681672 |

ISBN (Print) | 9783319681665 |

DOIs | |

Publication status | Published - 2017 |

Externally published | Yes |

Event | International Symposium on Automated Technology for Verification and Analysis 2017 - Pune, India Duration: 3 Oct 2017 → 6 Oct 2017 Conference number: 15th https://www.iarcs.org.in/atva2017/ |

### Publication series

Name | Lecture Notes in Computer Science |
---|---|

Publisher | Springer |

Volume | 10482 |

ISSN (Print) | 0302-9743 |

ISSN (Electronic) | 1611-3349 |

### Conference

Conference | International Symposium on Automated Technology for Verification and Analysis 2017 |
---|---|

Abbreviated title | ATVA 2017 |

Country | India |

City | Pune |

Period | 3/10/17 → 6/10/17 |

Internet address |

### Cite this

*Automated Technology for Verification and Analysis: 15th International Symposium, ATVA 2017 Pune, India, October 3–6, 2017 Proceedings*(pp. 67-83). (Lecture Notes in Computer Science ; Vol. 10482 ). Cham Switzerland: Springer. https://doi.org/10.1007/978-3-319-68167-2_5

}

*Automated Technology for Verification and Analysis: 15th International Symposium, ATVA 2017 Pune, India, October 3–6, 2017 Proceedings.*Lecture Notes in Computer Science , vol. 10482 , Springer, Cham Switzerland, pp. 67-83, International Symposium on Automated Technology for Verification and Analysis 2017, Pune, India, 3/10/17. https://doi.org/10.1007/978-3-319-68167-2_5

**Fixing the state budget : approximation of regular languages with small DFAs.** / Gange, Graeme; Ganty, Pierre; Stuckey, Peter J.

Research output: Chapter in Book/Report/Conference proceeding › Conference Paper › Research › peer-review

TY - GEN

T1 - Fixing the state budget

T2 - approximation of regular languages with small DFAs

AU - Gange, Graeme

AU - Ganty, Pierre

AU - Stuckey, Peter J.

PY - 2017

Y1 - 2017

N2 - Strings are pervasive in programming, and arguably even more pervasive in web programming. A natural abstraction for reasoning about strings are finite-automata. They are a well-understood formalism, and operations on them are decidable and well-known. But in practice these operations either blow up in size or in cost of operations. Hence the attractive automata representations become impractical. In this paper we propose reasoning about strings using small automata, by restricting the number of states available. We show how we can construct small automata which over-approximate the language specified by a larger automata, using discrete optimization techniques, both complete approaches and incomplete approaches based on greedy search. Small automata provide a strong basis for reasoning about strings in programming, since operations on small automata do not blow up in cost.

AB - Strings are pervasive in programming, and arguably even more pervasive in web programming. A natural abstraction for reasoning about strings are finite-automata. They are a well-understood formalism, and operations on them are decidable and well-known. But in practice these operations either blow up in size or in cost of operations. Hence the attractive automata representations become impractical. In this paper we propose reasoning about strings using small automata, by restricting the number of states available. We show how we can construct small automata which over-approximate the language specified by a larger automata, using discrete optimization techniques, both complete approaches and incomplete approaches based on greedy search. Small automata provide a strong basis for reasoning about strings in programming, since operations on small automata do not blow up in cost.

UR - http://www.scopus.com/inward/record.url?scp=85031397531&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-68167-2_5

DO - 10.1007/978-3-319-68167-2_5

M3 - Conference Paper

AN - SCOPUS:85031397531

SN - 9783319681665

T3 - Lecture Notes in Computer Science

SP - 67

EP - 83

BT - Automated Technology for Verification and Analysis

A2 - D’Souza, Deepak

A2 - Narayan Kumar , K.

PB - Springer

CY - Cham Switzerland

ER -