In this thesis, we design and implement an analysis tool for a language called kiltera which is a timed extension of pi-calculus. kiltera allows the modeling of concurrent, mobile, real-time and distributed systems. Our analyzer takes a kiltera model as input and performs analyses such as detection of deadlock states, stable states etc. To improve performance, the analyzer uses some transformation techniques to simplify the input kiltera model without changing its behavior. We provide a detailed description of the design and implementation of the analyzer and discuss some performance optimizations. Finally, we present some case studies to illustrate the capabilities of our analyzer. / Thesis (Master, Computing) -- Queen's University, 2010-09-29 12:02:41.361

Mobility occurs naturally in many distributed system applications such as telecommunications and electronic commerce. Mobility may reduce bandwidth consumption and coupling and increase flexibility. However, it seems that relatively little work has been done to support quality assurance techniques such as testing and verification of mobile systems. This thesis describes an approach for checking the conformance of a mobile, distributed application with respect to an executable model at runtime. The approach is based on kiltera -- a novel, high-level language supporting the description and execution of models of concurrent, mobile, distributed, and timed computation. The approach allows distributed, rather than centralized, monitoring. However, it makes very few assumptions about the platform that the mobile agent system is implemented in. We have implemented our approach and validated it using four case studies. Two of them are examples of mobile agent systems, the two others are implementations of distributed algorithms. Our approach was able to detect seeded faults in the implementations. To check the effectiveness and the efficiency of our approach more comprehensively a mutation-based evaluation framework has been implemented. In this framework a set of a new mutation operators for mobile agent systems has been identified in order to automatically generate and run a number of mutants programs and then evaluate the ability of our approach to detect these mutants. We found that our approach is very effective and efficient in killing the non-equivalent mutants. / Thesis (Ph.D, Computing) -- Queen's University, 2010-04-27 12:35:47.996