Subject: SEN1 Meeting tomorrow: Vadim Zaytsev From: Bas Basten To: sen1-list Date: Wed, 27 Apr 2011 14:51:43 +0200 (CEST) Dear all, Tomorrow Vadim will talk about his latest paper, which he wrote together with Bernd Fischer and Ralf Lämmel. Title: Cheating on the Undecidability of Language Equivalence Abstract: There exist a number of software engineering scenarios that essentially involve equivalence or correspondence assertions for some of the context-free grammars in the scenarios. For instance, when applying grammar transformations during parser development---be it for the sake of disambiguation or grammar-class compliance---one would like to preserve the generated language. Even though equivalence is generally undecidable for context-free grammars, we have developed an automated approach that is practically useful in revealing evidence of inequivalence, supporting an equivalence assertion and discovering correspondence mappings. The approach is based on systematic test data generation and parsing. We discuss two studies that show how the approach is used in comparing grammars of 4 open source Java parsers as well as 32 grammars from the course work for a compiler construction class. We start at 10am in room L016. See you all there! Cheers, Bas