Blar i Department of Informatics på emneord "VDP::Matematikk og Naturvitenskap: 400::Informasjons- og kommunikasjonsvitenskap: 420::Teoretisk databehandling, programmeringsspråk og -teori: 421"
Viser treff 1-20 av 21
-
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 ... -
Discrete event simulation in Java with applications in rodent navigation
(Master thesis, 2002) -
Efficiently Locating Schema Incompatibilities in an eXtensible Markup Language
(Master thesis, 2003) -
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 ... -
Hash functions in Cryptography
(Master thesis, 2008)This thesis is concerned with giving both an overview of the application of hash functions in cryptography and a presentation of today's standard cryptographic hash functions. Cryptographic hash functions are a valuable ... -
Hashfunksjoner for bruk i Digitale Signaturer
(Master thesis, 1995) -
Improving Efficiency in Parameter Estimation Using the Hamiltonian Monte Carlo Algorithm
(Master thesis, 2008)This thesis investigates three approaches to improve the performance of the Hamiltonian Monte Carlo algorithm. The first approach enhances the Hamiltonian Monte Carlo by suppressing random walk in the Gibbs sampling using ... -
The Inclusion Problem for Regular Expressions
(Lecture Notes in Computer Science, Chapter; Peer reviewed, 2010)This paper presents a new polynomial-time algorithm for the inclusion problem for certain pairs of regular expressions. The algorithm is not based on construction of finite automata, and can therefore be faster than the ... -
Investigating the Limitations of Java Annotations for Input Validation
(Chapter; Peer reviewed, 2010)Recently Java annotations have received a lot of attention as a possible way to simplify the usage of various frameworks, ranging from persistence and verification to security. In this paper we discuss our experiences in ... -
On Curvature and Separability in Unconstrained Optimisation
(Doctoral thesis, 2006-06-16) -
Regular Expressions with Numerical Constraints and Automata with Counters
(Lecture Notes in Computer Science, Chapter; Peer reviewed, 2009)Regular expressions with numerical constraints are an extension of regular expressions, allowing to bound numerically the number of times that a subexpression should be matched. Expressions in this extension describe the ... -
Rotasjonsinvariante turbokoder
(Master thesis, 2003) -
The SHIP Validator: An Annotation-based Content-Validation Framework for Java Applications
(Chapter; Peer reviewed, 2010)In this paper, we investigate the use of Java annotations for software security purposes. In particular, we implement a framework for content validation where the validation tests are specified by annotations. This approach ... -
(Towards an) Implementation of a Graphical Editor for Diagrammatic Predicate Logic in the Eclipse Platform
(Master thesis, 2008)The primary goal of this master's thesis is to explore how the Eclipse Platform can be beneficial for the Generic Diagrammatic Software Specification project, and how a graphical editor in the Eclipse Platform can be put ... -
A Type System for the Safe Instantiation of Components
(Journal article; Peer reviewed, 2004)Component composition can lead to multiple instances of the same component. Some components can have only one instance loaded at a time, for example, when a unique external resource is used. We give an abstract component ... -
A Type System for Usage of Software Components
(Lecture Notes in Computer Science, Chapter; Peer reviewed, 2009)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 ... -
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 ... -
Type Systems for Resource Use in Component Software
(Master thesis, 2006)In many situations a programmer must be concerned with resources which are not accounted and controlled completely by the programming language. These could be external physical resources, like a printer or a screen, it ...