Modelling microsoft COM using π-calculus

L.M.G. Feijs

doi:10.1007/3-540-48118-4_21

Modelling microsoft COM using π-calculus

L.M.G. Feijs

Mathematics and Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

10 Citations (Scopus)

Abstract

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.

Original language	English
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
Publisher	Springer
Pages	1343-1363
Volume	2
ISBN (Print)	3-540-66588-9
DOIs	https://doi.org/10.1007/3-540-48118-4_21
Publication status	Published - 1999

Publication series

Name	Lecture Notes in Computer Science
Volume	1709
ISSN (Print)	0302-9743

Access to Document

10.1007/3-540-48118-4_21

Cite this

Feijs, L. M. G. (1999). Modelling microsoft COM using π-calculus. In J. M. Wing, J. Woodcock, & J. Davies (Eds.), FM'99 - Formal Methods (Proceedings World Congress on Formal Methods in the Development of Computing Systems, Toulouse, France, September 20-24, 1999) (Vol. 2, pp. 1343-1363). (Lecture Notes in Computer Science; Vol. 1709). Springer. https://doi.org/10.1007/3-540-48118-4_21

@inproceedings{d4f238ec0b5d4107916a92b902bd6b78,

title = "Modelling microsoft COM using π-calculus",

abstract = "We use the p-calculus to model aspects of Microsoft{\textquoteright}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.",

author = "L.M.G. Feijs",

year = "1999",

doi = "10.1007/3-540-48118-4_21",

language = "English",

isbn = "3-540-66588-9",

volume = "2",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "1343--1363",

editor = "J.M. Wing and J. Woodcock and J. Davies",

booktitle = "FM'99 - Formal Methods (Proceedings World Congress on Formal Methods in the Development of Computing Systems, Toulouse, France, September 20-24, 1999)",

address = "Germany",

}

Feijs, LMG 1999, Modelling microsoft COM using π-calculus. in JM Wing, J Woodcock & J Davies (eds), FM'99 - Formal Methods (Proceedings World Congress on Formal Methods in the Development of Computing Systems, Toulouse, France, September 20-24, 1999). vol. 2, Lecture Notes in Computer Science, vol. 1709, Springer, Berlin, pp. 1343-1363. https://doi.org/10.1007/3-540-48118-4_21

Modelling microsoft COM using π-calculus. / Feijs, L.M.G.

FM'99 - Formal Methods (Proceedings World Congress on Formal Methods in the Development of Computing Systems, Toulouse, France, September 20-24, 1999). ed. / J.M. Wing; J. Woodcock; J. Davies. Vol. 2 Berlin : Springer, 1999. p. 1343-1363 (Lecture Notes in Computer Science; Vol. 1709).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

TY - GEN

T1 - Modelling microsoft COM using π-calculus

AU - Feijs, L.M.G.

PY - 1999

Y1 - 1999

N2 - 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.

AB - 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.

U2 - 10.1007/3-540-48118-4_21

DO - 10.1007/3-540-48118-4_21

M3 - Conference contribution

SN - 3-540-66588-9

VL - 2

T3 - Lecture Notes in Computer Science

SP - 1343

EP - 1363

BT - FM'99 - Formal Methods (Proceedings World Congress on Formal Methods in the Development of Computing Systems, Toulouse, France, September 20-24, 1999)

A2 - Wing, J.M.

A2 - Woodcock, J.

A2 - Davies, J.

PB - Springer

CY - Berlin

ER -

Feijs LMG. Modelling microsoft COM using π-calculus. In Wing JM, Woodcock J, Davies J, editors, FM'99 - Formal Methods (Proceedings World Congress on Formal Methods in the Development of Computing Systems, Toulouse, France, September 20-24, 1999). Vol. 2. Berlin: Springer. 1999. p. 1343-1363. (Lecture Notes in Computer Science). https://doi.org/10.1007/3-540-48118-4_21