Blar i Department of Informatics på forfatter "Hovland, Dag"

Viser treff 1-8 av 8

    • Feasible Algorithms for Semantics — Employing Automata and Inference Systems 

      Hovland, Dag (Doctoral thesis, 2010-12-16)

    • The Inclusion Problem for Regular Expressions 

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

      Mancini, Federico; Hovland, Dag; Mughal, Khalid A. (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 ...

    • Regular Expressions with Numerical Constraints and Automata with Counters 

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

    • The SHIP Validator: An Annotation-based Content-Validation Framework for Java Applications 

      Mancini, Federico; Hovland, Dag; Mughal, Khalid A. (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 ...

    • 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 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 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 ...