A Type System for the Safe Instantiation of Components

Bezem, Marc; Truong, Hoang

doi:10.1016/j.entcs.2004.04.037

Cited by 3 publications

(1 citation statement)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Since subexpressions may be scoped, it is necessary to have an upper bound of the number of instances that are still active after the execution of an expression (X o ). Pairs X i , X o sufficed for the purpose of the paper [2]. Here we consider also reusing instances of components and this depends on whether there is already such an instance or not.…”

Section: Definition 1 (Types) Types Of Component Expressions Are Tuplesmentioning

confidence: 99%

Guaranteeing Resource Bounds for Component Software

Truong

2005

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Abstract. Component software is software that has been assembled from various pieces of standardized, reusable computer programs, socalled 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 the previous work [3], 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.

show abstract

Section: Definition 1 (Types) Types Of Component Expressions Are Tuplesmentioning

confidence: 99%

Guaranteeing Resource Bounds for Component Software

Truong

2005

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

show abstract

Finding Resource Bounds in the Presence of Explicit Deallocation

Truong

Bezem

2005

Theoretical Aspects of Computing – ICTAC 2005

Self Cite

View full text Add to dashboard Cite

Abstract. A software program requesting a resource that is not available usually raises an out-of-resource exception. Component software is software that has been assembled from standardized, reusable components which, in turn, may also composed from other components. Due to the independent development and reuse of components, component software has a high risk of causing out-of-resource exceptions. We present a small component language and develop a type system which can statically prevent this type of errors . This work continues our previous works [3,18] by including explicit deallocation. We prove that the type system is sound with respect to safe deallocation and that sharp resource bounds can be computed statically.

show abstract

A Type System for Usage of Software Components

Hovland

2009

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. The 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.

show abstract

A Type System for the Safe Instantiation of Components

Cited by 3 publications

References 9 publications

Guaranteeing Resource Bounds for Component Software

Guaranteeing Resource Bounds for Component Software

Finding Resource Bounds in the Presence of Explicit Deallocation

A Type System for Usage of Software Components

Contact Info

Product

Resources

About