Pawel Sobocinski
| Office: | +44 (0)1223 763770 |
|---|---|
| Home: | +44 (0)1223 696751 |
| Address: |
Computer Laboratory William Gates Building University of Cambridge 15 JJ Thomson Avenue Cambridge CB3 0FD United Kingdom |
| Home Address: |
Flat C26, Forster Court 7 Charles Babbage Road Cambridge CB3 0FT United Kingdom |
Since October 2004, I am a research associate at the Computer Lab working with Glynn Winskel. Before that (in reverse chronological order) I was CNRS postdoc at PPS (6 months), a visiting researcher at the Informatics Department at the University of Pisa (6 months) and a visiting research associate at ITU in Copenhagen (2 months). In December 2004 I got my PhD at BRICS in Aarhus. My supervisor was Prof. Mogens Nielsen.
In 1999 I completed a computer science bachelor degree in the mathematics department at the University of Sydney in Australia. My supervisor in fourth year was Steve Lack.
Publications
Academic interests
- Semantics of concurrency and mobility
I am interested in formal models for representing various phenomena associated with concurrency. In particular, I am working on ways of associating labelled transition system semantics to reduction systems -- it boils down to finding nice ways (using bisimulation) to prove the contextual equivalence of processes. Moreover, I believe that it is important to understand the process by which we obtain these nice proof methods. In research on this topic I've collaborated mostly with Vladimiro Sassone. My other coauthors in this area are Roberto Bruni, Fabio Gadducci, Bartek Klin and Ugo Montanari.
- Category theory
I am generally interested in applications of category theory (affectionally known as abstract nonsense) to computer science. However, rather than working on the more established uses of categorical logic in semantics, I have concentrated mostly on how one can use categories with structure in order to obtain theorems about models at a nice level of generality. In particular, together with Steve Lack I've studied adhesive categories which are categories with well-behaved pushouts along monomorphisms. The applications of adhesive categories have included the work mentioned in the previous bullet as well as graph rewriting.
- Logic, types
Links graveyard
Personal stuff
``As we know, there are known knowns; there are things we know we know. We also know there are known unknowns; that is to say we know there are some things we do not know. But there are also unknown unknowns - the ones we don't know we don't know''
-- Donald Rumsfeld