π-calculus, Session Types research at Imperial College
Facing staggering diversity of software behaviours in modern and future computing, we argue for the need of a unified theory of program logics, which can capture a general class of software behaviours, as a foundation of software engineering. We propose Hennessy–Milner logic for typed π-calculi as a possible foundation of such a theory. The π-calculus is in a singular position among computational calculi through its ability to embed sequential and concurrent programs as name passing processes without losing semantic information, and through its connection to other basic semantic theories such as linear logic and game semantics. The embedding of programs in processes leads to the embedding of program logics in the process logic, where the observational content of a given program logic is made explicit, analysed and justified on a uniform basis. As a case study, we show embedding of Hoare logic for sequential programs and a rely-guarantee logic for shared variable concurrency, suggesting that the proposed framework can offer a unifying basis to capture fundamental notions in program logics such as partial/total correctness, sequentiality and different kinds of concurrent computing.
@article{HY2011,
author = {Kohei Honda and Nobuko Yoshida},
title = {{A Unified Theory of Program Logics: An Approach based on the π-calculus}},
journal = {Comput. J.},
volume = {54},
issue = {1},
pages = {88--107},
year = 2011
}
@article{HY2011,
author = {Kohei Honda and Nobuko Yoshida},
title = {{A Unified Theory of Program Logics: An Approach based on the π-calculus}},
journal = {The Computer Journal (Special Focus on: BCS08 Visions of Computer Science Conference Papers)},
volume = {54},
issue = {1},
pages = {88--107},
doi = "10.1093/comjnl/bxp092",
year = 2011
}