Campus Event Calendar
Event Entry
What and Who
Towards an algebraic foundation of general program logics
Tomoyuki Suzuki
Talk
RG1
AG Audience
English
Note: We use this to send email in the morning.
Date, Time and Location
Thursday, 2 December 2010
14:00
60 Minutes
E1 7
2.01
Saarbrücken
Abstract
By a rapid improvement of computer technology in a few decades, computers are deeply fused into our daily live, for example, mobiles, laptops, PCs, cars, ticket machines, etc. Along this stream, the meaning of computing is also gradually spreading out: e.g. from stand-alone machines to dynamically connected networks, or from electric computing to quantum computing. One question naturally arising here is how we can manipulate the "new generation computing" and harness it. As a possible answer for this question, we would like to propose building an algebraic foundation of general program logics. Towards this goal, in this talk, we will show two characterizations of logical consequences, or sequents: one is algebraic, the so-called "order theory (lattice theory)" and the other is space-based, or relational-type. They are also known as operational semantics and as denotational semantics in computer science. Furthermore, we will discuss that a Stone-type representation theorem generates a right computational framework for the logical consequences. Based on this result, we also show a general Sahlqvist-type representation theorem, which systematically accounts for many Stone-type representable logics. In the end, we will give a couple of exciting open questions and possible future directions of our research.
Contact
Jennifer Müller
900
--email hidden
passcode not visible
logged in users only
Uwe Brahm, 02/14/2011 13:35
Jennifer Müller, 11/29/2010 09:35
Anna-Lisa Overhoff, 11/29/2010 09:34 -- Created document.
Jennifer Müller, 11/29/2010 09:35
Anna-Lisa Overhoff, 11/29/2010 09:34 -- Created document.