Blar i Faculty of Mathematics and Natural Sciences på emneord "Type systems"
Viser treff 1-5 av 5
-
Counting Instances of Software Components
(Proceedings of LRPP'04: Workshop on Logics for Resources, Processes, and Programs, Turku, Finland, July 13, 2004, Conference lecture, 2004-07-13)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 ... -
Feasible Algorithms for Semantics — Employing Automata and Inference Systems
(Doctoral thesis, 2010-12-16) -
Finding Resource Bounds in the Presence of Explicit Deallocation
(Journal article; Peer reviewed, 2005)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 ... -
Guaranteeing Resource Bounds for Component Software
(Journal article; Peer reviewed, 2005)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 ... -
Type Systems for Guaranteeing Resource Bounds of Component Software
(Doctoral thesis, 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 ...