Output details
11 - Computer Science and Informatics
University of Birmingham
An Automata-Theoretic Model of Idealized Algol
<10>This paper initiates a new approach to building extensional semantic models of imperative programs so as to combine two important concerns: data abstraction via local variables and irreversible state change. It is the first such model overcoming the difficulties in combining these concerns, solving the problem of "awkward example" posed by Pitts and Stark in 1998. The work was published in ICALP, the flagship conference of EATCS, rated 60th among 3000 CS conferences by Microsoft Academic Search. Though very new, the work has received attention from leading researchers, with invited talks at MPI for Software Systems, Microsoft Research and CMU.