Proof assistants based on type theories, such as Coq and Lego, allow users to omit subterms on input that can be inferred automatically. While those mechanisms are well known, ad-h...
The formal core calculus .FJ has been introduced to model lightweight family polymorphism, a programming style to support reusable yet type-safe mutually recursive classes. This pa...
In this paper, a neural network based approach to visualize performance data of a GSM network is presented. The proposed approach consists of several steps. First, a suitable propo...
Development of a software system from existing components can surely have various benefits, but can also entail a series of problems. One type of problems is caused by a limited ...
In the setting of concurrent self composition, a single protocol is executed many times concurrently by a single set of parties. In this paper, we prove lower bounds and impossibi...