Resource operations model in a dynamic world

Koelewijn, J.W. (2009) Resource operations model in a dynamic world.

[img]
Preview
PDF
1MB
Abstract:Resource Operations Models have often been used as an abstraction of systems to perform behavioural pattern detection. Traditionally, for the actual pattern detection and constraint specification, these systems use regular expressions. However, regular expressions suffer from poor evolvability, because the alphabet must be known. Therefore in this thesis, two alternatives are considered: Graph Transformation Systems and the Vibes specification language. Because constraint verification methods are almost exclusively used in combination with statically typed languages, we investigated the issues in performing constraint verification on dynamically typed languages. Traditional verification systems use the type information available in the Abstract Syntax Tree (AST), but this type information is mostly not available in the AST of dynamically typed languages, unless complex type inference algorithms are used. Although type inference helps in some cases, most of the time only a set of types can be inferred for variables, rather than an exact type. It has appeared that this makes it necessary to perform constraint verification at runtime. The solutions that are proposed in this thesis have been implemented and tested in the dynamically typed language Smalltalk.
Item Type:Essay (Master)
Faculty:EEMCS: Electrical Engineering, Mathematics and Computer Science
Subject:54 computer science
Programme:Computer Science MSc (60300)
Link to this item:http://purl.utwente.nl/essays/59389
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page