Now showing items 1-4 of 4
Feasible Algorithms for Semantics — Employing Automata and Inference Systems
(The University of Bergen, 2010-12-16)
Type Systems for Guaranteeing Resource Bounds of Component Software
(The University of Bergen, 2006-05-15)
Since the early days of the development of programming languages, people have been developing various methods to reduce the runtime errors of software programs. These methods range from static analysis, testing to runtime ...
A Type System for Usage of Software Components
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 ...
Guaranteeing Resource Bounds for Component Software
(Springer Berlin Heidelberg, 2005-06-15)
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 ...