Vis enkel innførsel

dc.contributor.authorHovland, Dageng
dc.date.accessioned2009-09-25T12:18:32Z
dc.date.available2009-09-25T12:18:32Z
dc.date.issued2009eng
dc.PublishedIn: Berardi, S.; Damiani, F.; de'Liguoro, U. (Eds.), Types for Proofs and Programs: 186-202en
dc.identifier.isbn978-3-642-02443-6 (print version)en_US
dc.identifier.urihttps://hdl.handle.net/1956/3491
dc.descriptionRevised Selected Papers, TYPES 2008, Torino, Italy, March 26-29, 2008en
dc.description.abstractThe aim of this article is to support component-based software engineering by modelling exclusive and inclusive usage of software components. Truong and Bezem describe in several papers abstract languages for component software with the aim to find bounds of the number of instances of components. Their language includes primitives for instantiating and deleting instances of components and operators for sequential, alternative and parallel composition and a scope mechanism. The language is here supplemented with the primitives use, lock and free. The main contribution is a type system which guarantees the safety of usage, in the following way: When a well-typed program executes a subexpression use[x] or lock[x], it is guaranteed that an instance of x is available.en_US
dc.language.isoengeng
dc.publisherSpringeren_US
dc.relation.ispartofseriesLecture Notes in Computer Scienceen
dc.relation.ispartofseries5497en
dc.subjectComponent softwareeng
dc.subjectType Systemeng
dc.subjectParallel Executioneng
dc.subjectComponent Usageeng
dc.subjectProcess Modeleng
dc.titleA Type System for Usage of Software Componentsen_US
dc.typeChapter
dc.typePeer reviewed
dc.description.versionAccepted versionen_US
dc.rights.holderSpringeren_US
dc.identifier.doihttps://doi.org/10.1007/978-3-642-02444-3_12
dc.subject.nsiVDP::Matematikk og Naturvitenskap: 400::Informasjons- og kommunikasjonsvitenskap: 420::Teoretisk databehandling, programmeringsspråk og -teori: 421nob


Tilhørende fil(er)

Thumbnail

Denne innførselen finnes i følgende samling(er)

Vis enkel innførsel