• A type system for counting instances of software components 

      Bezem, Marcus A.; Hovland, Dag; Truong, Anh Hoang (Peer reviewed; Journal article, 2012)
      We identify an abstract language for component software based on process algebra. Besides the usual operators for sequential, alternative and parallel composition, it has primitives for instantiating components and for ...
    • A Type System for the Safe Instantiation of Components 

      Bezem, Marcus A.; Truong, Anh Hoang (Proceedings of FOCLASA 2003, the Foundations of Coordination Languages and Software Architectures, Journal article, 2003-09-02)
      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 

      Hovland, Dag (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 

      Truong, Anh Hoang (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 

      Hovland, Dag (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 ...
    • Type theoretical databases 

      Forssell, Jon Henrik; Gylterud, Håkon Robbestad; Spivak, David I (Journal article; Peer reviewed, 2020)
      We show how the display-map category of finite (symmetric) simplicial complexes can be seen as representing the totality of database schemas and instances in a single mathematical structure. We give a sound interpretation ...
    • Typical Sequences Revisited - Computing Width Parameters of Graphs 

      Bodlaender, Hans L.; Jaffke, Lars; Telle, Jan Arne (Journal article; Peer reviewed, 2021)
      In this work, we give a structural lemma on merges of typical sequences, a notion that was introduced in 1991 [Lagergren and Arnborg, Bodlaender and Kloks, both ICALP 1991] to obtain constructive linear time parameterized ...
    • Typical Sequences Revisited – Computing Width Parameters of Graphs 

      Bodlaender, Hans L.; Jaffke, Lars; Telle, Jan Arne (Journal article; Peer reviewed, 2020)
      In this work, we give a structural lemma on merges of typical sequences, a notion that was introduced in 1991 [Lagergren and Arnborg, Bodlaender and Kloks, both ICALP 1991] to obtain constructive linear time parameterized ...
    • The Ultimate GUI Framework: Are We There Yet? 

      Stokke, Knut Anders; Barash, Mikhail; Järvi, Jaakko Timo Henrik (Journal article; Peer reviewed, 2023)
      The programming community seems to be forever searching for the ultimate user interface programming approach and the accompanying framework. We describe the landscape of recent efforts in this quest through describing ...
    • Uncovering Amino Acids Patterns At The Membrane-Binding Interfaces Of Peripheral Proteins 

      Müller, Florian Sebastian Alexander (Master thesis, 2020-07-04)
    • A Unifying Framework for Characterizing and Computing Width Measures 

      Eiben, Eduard; Ganian, Robert; Hamm, Thekla; Jaffke, Lars; Kwon, O-joung (Journal article; Peer reviewed, 2022)
      Algorithms for computing or approximating optimal decompositions for decompositional parameters such as treewidth or clique-width have so far traditionally been tailored to specific width parameters. Moreover, for mim-width, ...
    • Unitary Branching Programs: Learnability and Lower Bounds 

      Diaz Andino, Fidel Ernesto; Kokkou, Maria; Oliveira, Mateus De Oliveira; Vadiee, Farhad (Journal article; Peer reviewed, 2021)
      Bounded width branching programs are a formalism that can be used to capture the notion of non-uniform constant-space computation. In this work, we study a generalized version of bounded width branching programs where ...
    • The unsuitable neighbourhood inequalities for the fixed cardinality stable set polytope 

      Samer, Phillippe; Haugland, Dag (Chapter, 2021)
      Given an undirected graph G = (V, E) and an integer k∈{1,…,|V|} , we initiate the combinatorial study of stable sets of cardinality exactly k in G. Our aim is to instigate the polyhedral investigation of the convex hull ...
    • Use of synthetic health data in prototyping for developing dental implant registry services 

      Huseby, Oddmund (Master thesis, 2022-06-01)
      Developing novel applications in healthcare and dentistry can be challenging due to lack of application requirements, uncertain stakeholders, and no available test data. Such conditions exist in tooth implant dentistry, ...
    • User-configurable, high-level transformations with CodeBoost 

      Kalleberg, Karl Trygve (Master thesis, 2003)
      Scalable design of large applications requires domain-specific, high-level abstraction. Classically, there has been a tension between abstraction and good performance. We demonstrate how to overcome this tension by augmenting ...
    • Using 3D functionality available in current web-browsers to create and visualize geological models. 

      Malt, Øystein Ivar (Master thesis, 2017-07-11)
      This thesis investigates the possibility of using modern web technologies to develop accessible applications for interactive covisualization of geological data such as topography, seismic slices and measurements from wells. ...
    • Using Heat and Ceilometer to create an elastic OpenStack grid 

      Trippler, Niklas (Master thesis, 2017-06-21)
      Grid computing is a term for connecting computing resources together to solve large computational problems. Computational grids are used for a lot of computations within the high energy physics domain, where the amount of ...
    • Using Natural Language Processing with Deep Learning to Explore Clinical Notes 

      Grinde, Anders Benjamin; Johansen, Bendik Mathias (Master thesis, 2021-06-02)
      In recent years, the deep learning community and technology have grown substantially, both in terms of research and applications. However, some application areas have lagged behind. The medical domain is an example of a ...
    • Using registries to integrate bioinformatics tools and services into workbench environments 

      Ménager, Hervé; Kalaš, Matúš; Rapacki, Kristoffer; Ison, Jon (Peer reviewed; Journal article, 2015)
      The diversity and complexity of bioinformatics resources presents significant challenges to their localisation, deployment and use, creating a need for reliable systems that address these issues. Meanwhile, users demand ...
    • Using Smart Cards to Mitigate Security Threats on Mobile Devices 

      Sivertsgård, Henrik Mathisen (Master thesis, 2016-05-31)
      This master thesis developed and tested the idea that smart cards are able to help mitigate security threats on mobile devices that are handling sensitive data. Investigating the limitations of smart cards is a fundamental ...