Feature interactions in telecommunications is an active research area. Many approaches to solve the so-called feature interaction problem have been proposed. However, all these approaches consider feature interaction as a somewhat isolated problem, in particular it is not seen in the context of evolving legacy systems and third party features in a deregulated market environment. An exception is the approach by Marples and Magill [MM98, Mar00], which presents an interaction detection mechanism and an essentially manual resolution approach. We develop an automatic resolution approach that can be integrated with Marples and Magill’s detection mechanism. We distinguish two key concepts, namely solutions and resolutions. The former are essentially possible behaviours of the system, they are not qualified as desirable or undesirable, the latter are the desirable solutions. Our approach allows for automatic removal of undesired behaviour and selection of the “best ” desired behaviour. The correctness, complexity and suitability of our approach are analysed. Two case studies support these more theoretical considerations. Our approach is transferable to other areas, such as quality of service management, and is not restricted to network architectures with a single point of control.

Abstract: We discuss the main novelties of the implementation of Lua 5.0: its registerbased virtual machine, the new algorithm for optimizing tables used as arrays, the implementation of closures, and the addition of coroutines.

This paper proposes an implementation scheme for programming language interpreters that addresses both modular design of memory management system and execution efficiency. Modularity let the language designer and the application programmer incorporate the most efective algorithm in their systems. Modular implementations of memory management systems can be used as a base for empirical analysis of various memory management systems. The proposed system offers an abstract interface that can be used to implement various memory management algorithms. Our specialization technique takes the implementation of the interpreter and the application bytecode and generates their specialized versions whose memory management interface calls to the given memory management system. Benchmark results show that specialization technique eliminates the 5-10% overhead and our system works as efficiently as hand-tuned programming language system.