Coinductive big-step semantics for concurrency

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

• Tarmo Uustalu ( Institute of Cybernetics, Tallinn University of Technology)
• Tuesday 14 May 2013, 15:45-16:45
• FW11, Computer Laboratory, William Gates Building.

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

Note unusual time and day

Disputing the popular statements that big-step semantics cannot handle nontermination (they would necessarily “lose” all nonterminating runs) and that concurrency is inherently small-step, I present a big-step semantics for a toy language with shared-variable concurrency that accounts correctly for both terminating and nonterminating runs. This semantics is based on coinductive and mixed inductive-coinductive definitions of resumptions or computation trees (alternatively traces or computation paths), evaluation and termination-sensitive weak bisimilarity. It agrees, constructively, with the intended small-step semantics.

This talk is part of the Computer Laboratory Programming Research Group Seminar series.

This talk is included in these lists:

• All Talks (aka the CURE list)
• Cambridge talks
• Computer Laboratory Programming Research Group Seminar
• Department of Computer Science and Technology talks and seminars
• FW11, Computer Laboratory, William Gates Building
• Interested Talks
• School of Technology
• Trust & Technology Initiative - interesting events
• bld31

Note that ex-directory lists are not shown.