### Abstract

A new approach to program verification is based on automata. The notion of automaton depends on the verification problem at hand (nested word automata for recursion, Büchi automata for termination, a form of data automata for parametrized programs, etc.). The approach is to first construct an automaton for the candidate proof and then check its validity via automata inclusion. The originality of the approach lies in the construction of an automaton from a correctness proof of a given sequence of statements. A sequence of statements is at the same time a word over a finite alphabet and it is (a very simple case of) a program. Just as we ask whether a word has an accepting run, we can ask whether a sequence of statements has a correctness proof (of a certain form). The automaton accepts exactly the sequences that do.

Original language | English (US) |
---|---|

Title of host publication | Language and Automata Theory and Applications - 9th International Conference, LATA 2015, Proceedings |

Publisher | Springer Verlag |

Pages | 25-46 |

Number of pages | 22 |

ISBN (Electronic) | 9783319155784 |

DOIs | |

State | Published - Jan 1 2015 |

Externally published | Yes |

Event | 9th International Conference on Language and Automata Theory and Applications, LATA 2015 - Nice, France Duration: Mar 2 2015 → Mar 6 2015 |

### Publication series

Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|

Volume | 8977 |

ISSN (Print) | 0302-9743 |

ISSN (Electronic) | 1611-3349 |

### Other

Other | 9th International Conference on Language and Automata Theory and Applications, LATA 2015 |
---|---|

Country | France |

City | Nice |

Period | 3/2/15 → 3/6/15 |

### All Science Journal Classification (ASJC) codes

- Theoretical Computer Science
- Computer Science(all)

## Fingerprint Dive into the research topics of 'Automated program verification'. Together they form a unique fingerprint.

## Cite this

*Language and Automata Theory and Applications - 9th International Conference, LATA 2015, Proceedings*(pp. 25-46). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8977). Springer Verlag. https://doi.org/10.1007/978-3-319-15579-1_2