Bergen Open Research Archive

Guaranteeing Resource Bounds for Component Software

Bergen Open Research Archive

Show simple item record Truong, Anh Hoang 2006-05-09T09:08:07Z 2006-05-09T09:08:07Z 2005-06-15
dc.identifier.citation Lecture Notes in Computer Science 2005 3535: 179-194
dc.identifier.isbn 3-540-26181-8
dc.description.abstract Component software is software that has been assembled from various pieces of standardized, reusable computer programs, so-called components. Executing component software creates instances of these components. For several reasons, for example, limited resources and/or application requirements, it can be important to have control over the number of such instances. In our previous work, we have given an abstract component language and a type system which ensures that the number of simultaneously active instances of any component never exceeds a sharp bound expressed in the type. The language featured instantiation and reuse of components, as well as sequential composition, choice and scope. This work extends the previous one to include a parallel composition. Moreover, we improve on the operational semantics by using a small-step reduction relation. As a result, we can prove the soundness property of our static type system using the technique of Wright and Felleisen. en
dc.description.sponsorship This research was supported by the Research Council of Norway (NFR) en
dc.format.extent 251844 bytes
dc.format.mimetype application/pdf
dc.language.iso eng en
dc.publisher Springer Berlin / Heidelberg en
dc.subject Type systems en
dc.subject Component software en
dc.title Guaranteeing Resource Bounds for Component Software en
dc.type Journal article eng
dc.subject.nsi VDP::Matematikk og Naturvitenskap: 400::Informasjons- og kommunikasjonsvitenskap: 420::Teoretisk databehandling, programmeringsspråk og -teori: 421 no

Files in this item


This item appears in the following Collection(s)

Show simple item record

Search BORA


My Account