A Calculus for Modeling Software Components

Nierstrasz, Oscar Marius; Achermann, Franz (2003). A Calculus for Modeling Software Components. In: de Boer, Frank S.; Bonsangue, Marcello M.; Graf, Susanne; de Roever, Willem-Paul (eds.) Formal Methods for Components and Objects. FMCO 2002. LNCS: Vol. 2852 (pp. 339-360). Springer-Verlag 10.1007/978-3-540-39656-7_14

Text Seiten aus 10.1007_b14033.pdf - Published Version Restricted to registered users only Available under License Publisher holds Copyright. Download (313kB) | Request a copy

Many competing definitions of software components have been proposed over the years, but still today there is only partial agreement over such basic issues as granularity (are components bigger or smaller than objects, packages, or application?), instantiation (do components exist at run-time or only at compile-time?), and state (should we distinguish between components and ``instances" of components?). We adopt a minimalist view in which components can be distinguished by \emphcomposable interfaces. We have identified a number of key features and mechanisms for expressing composable software, and propose a calculus for modeling components, based on the asynchronous pi calculus extended with explicit namespaces, or ``forms". This calculus serves as a semantic foundation and an executable abstract machine for Piccola, an experimental composition language. The calculus also enables reasoning about compositional styles and evaluation strategies for Piccola. We present the design rationale for the Piccola calculus, and briefly outline some of the results obtained.

Interest & Impact

Downloads

0 since deposited on 29 Nov 2017
0 in the past 12 months

Citations

5 Citations in Web of Science ®
6 Citations in Scopus

Search

in Google Scholar™

Services

Actions (login required)

Edit item

Actions (login required)

Edit item