Titlebook: Automated Technology for Verification and Analysis; 5th International Sy Kedar S. Namjoshi,Tomohiro Yoneda,Yoshio Okamura Conference procee

endarterectomy

Proving Termination of Tree Manipulating Programsle counterexample given by a CA termination checker and either conclude that the program does not terminate, or else refine the abstraction and repeat. We show that the spuriousness problem for lasso-shaped counterexamples is decidable in some non-trivial cases. We applied the method successfully on several interesting case studies.

BABY

A Generic Constructive Solution for Concurrent Games with Expressive Constraints on Strategiesm naturally extends alternating-time logics while being highly flexible to combine constraints. Our approach is constructive and can synthesize many types of complex strategies, via automata-theoretic techniques.