Now showing items 1-3 of 3
A Type System for Usage of Software Components
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 ...
Regular Expressions with Numerical Constraints and Automata with Counters
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 Inclusion Problem for Regular Expressions
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 ...