We use the p-calculus to model aspects of Microsoft’s COM architecture. The paper introduces certain aspects of COM, first using IDL and C++, and then using a sugared version of the p-calculus (with numbers and lists added). Most of the complexities arise in dynamic interface management. We explore using the reduction rules of the calculus to show that two components (a stack and stack-observer) do indeed connect to each other in the required manner.
|Title of host publication||FM'99 - Formal Methods (Proceedings World Congress on Formal Methods in the Development of Computing Systems, Toulouse, France, September 20-24, 1999)|
|Editors||J.M. Wing, J. Woodcock, J. Davies|
|Place of Publication||Berlin|
|Publication status||Published - 1999|
|Name||Lecture Notes in Computer Science|