Database Abstract State Machines -- When Abstract State Machines meet Databases
Qing Wang (ANU)
LOGIC AND COMPUTATION SEMINARDATE: 2012-05-08
TIME: 15:30:00 - 16:30:00
LOCATION: RSISE Seminar Room, ground floor, building 115, cnr. North and Daley Roads, ANU
CONTACT: JavaScript must be enabled to display this email address.
ABSTRACT:
Abstract State Machines (ASMs) provide a simple but powerful method for formalising algorithms at a flexible level of abstraction. The sequential ASM thesis shows that every sequential algorithm can be characterised by three intuitive postulates and simulated by an ASM. This exemplifies an approach to precisely characterising different notions of algorithms. In databases, queries and updates are two fundamental types of computations - the first provides the capability to retrieve data and the second is used to maintain databases in light of ever-changing application domains. As an analogue to the sequential ASM thesis, the database ASM thesis was developed which provides a universal model of computation (i.e., DB-ASMs) for capturing database queries and updates. I will talk about how to use DB-ASMs to characterise different classes of database computations.
BIO:
Qing Wang completed her Ph.D. in Computer Science at Christian-Albrechts-University Kiel (Germany) in 2010. Before that, she obtained her Masters in Information Systems from Massey University (New Zealand) and Bachelor of Engineering from South China University of Technology (China). She is currently a Research Fellow at the Research School of Computer Science at ANU.
