Abstract. Nested words are a restriction of the class of visibly pushdown languages that provide a natural model of runs of programs with recursive procedure calls. The usual conne...
Abstract. An approach based on term rewriting techniques for the automated termination analysis of imperative programs operating on integers is presented. An imperative program is ...
Parity games are 2-player games of perfect information and infinite duration that have important applications in automata theory and decision procedures (validity as well as model...
We develop logical mechanisms and decision procedures to facilitate the verification of full functional properties of inductive tree data-structures using recursion that are soun...
Parthasarathy Madhusudan, Xiaokang Qiu, Andrei Ste...
While existing learning techniques can be viewed as inducing programs from examples, most research has focused on rather narrow classes of programs, e.g., decision trees or logic ...