University of Birmingham > Talks@bham > Lab Lunch > Total correctness for round abstraction

Total correctness for round abstraction

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Dan Ghica.

After recalling the definition of “round abstraction”, a technique for building low-latency synchronous systems from asynchronous specifications, we explore its compositionality.

We model round abstraction within a trace-semantic setting that is a generalisation of pointer-free game semantic models. We then define partial and total correctness for round abstraction relative to composition and note that, in general, round abstraction is not compositional. We then identify sufficient properties to guarantee partially correct composition.

Finally, we propose a framework for round abstraction that is totally correct when applied to asynchronous behaviours.

Some of the material presented in this talk will appear at CONCUR 2010 .

This talk is part of the Lab Lunch series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


Talks@bham, University of Birmingham. Contact Us | Help and Documentation | Privacy and Publicity.
talks@bham is based on from the University of Cambridge.