Tata Institute of Fundamental Research

Split-width and the Verification of Concurrent Recursive Programs

Speaker: K. Narayan Kumar (Chennai Mathematical Institute H1 SIPCOT IT Park Siruseri Chennai 600103)
Organiser: Paritosh K Pandya
Date: Wednesday, 17 Jul 2013, 10:30 to 11:30
Venue: A-212 (STCS Seminar Room)

(Scan to add to calendar)
Abstract:  In this talk we describe a simple measure, related to Tree/Clique width, on the structure of the runs of concurrent recursive programs and illustrate its use in the verification of properties expressed in Monadic Second-order Logic. (Joint work with Aiswarya Cyriac and Paul Gastin).