Annual Doctoral Workshop on Mathematical and
Engineering Methods in Computer Science
organized jointly by the Masaryk University
and the Brno University of Technology, Czechia
October 26—28, 2007    Prestige Hotel    Znojmo    Czechia

Invited Speakers
Invited lectures by renowned scientists will embellish the programme.

Newtonian Program Analysis
Javier Esparza (Technische Universität München)
Program analysis (also known as static analysis) is the art of gaining information about the behaviour of a program without running it. From a mathematical point of view, static analysis proceeds as follows: depending on the information one wants to compute, each program point is attached an equation, and then the resulting equation system is solved. Generic solvers, i.e., solvers that can be applied to many different analysis, are based on Kleene's fixpoint theorem. However, the algorithms derived from the theorem are often very slow. In the talk I'll show that Kleene's theorem can be replaced by a generalization of Newton's method, a well known technique of numerical mathematics for approximating a zero of a differentiable function. This rather surprising fact leads to a common framework for functional and performance analysis.

Thinking in Services: Methodologies and Adoption
Tiziana Margaria-Steffen (University of Potsdam)
Early service engineering has driven the development of telecommunication infrastructure and applications, in particular the so-called Intelligent Network (IN) Services, since the early 90's. A service-oriented, feature-based architecture, a corresponding standardization of basic services and applications in real standards, and adequate programming environments enabled flexibilization of services, and dramatically reduced the time to market. Today the current trend toward triple-play services, which blend voice, video, and data on broadband wireline and wireless services, builds on this successful experience when reaching for new technological and operational challenges. We review our 10 years of experience in Service-Oriented Design for telecommunication systems from the point of view of service engineering methodologies then and now.

Security Without Authentication?
Geraint Price (Royal Holloway, University of London)
In this talk we review some of our previous work on Client Puzzles. In particular, we will focus on the applicability of security measures which are unable to make use of a cryptographic authentication mechanism. In doing so, our aim is to expose the problems faced by those looking to use security measures in a widely distributed system, but who may not be able to rely on an underlying authentication primitive.

Distributed Crossroads: Where P2P, Web Services and Workflow meet
Ian Taylor (Cardiff University & CCT LSU)
This talk will discuss research we have been conducting in Cardiff in the areas of P2P, Web Services and Workflow technologies for two applications in desktop Grids and Music Information Retrieval (MIR). I will discuss how we address the general application requirements through the use of multiple P2P overlays that are capable of caching of application data as well as the conventional metadata i.e. adverts, or locations to data. I will discuss both the theory and some practical implementations we have that have been built on the P2PS middleware to allow new types of super-peer overlays to be defined through grouping. Such overlays extend super- peer capabilities to help programmers create schemes for defining new ways for locating, replicating and providing access control for data sets as well as adverts. The data-caching groups co-exist with the conventional super-peer overlay, which still bootstraps the network by providing the discovery backbone. Parameters for super-peer or data-caching groups can also be adjusted e.g. number of super-peer connections, caching policies (replication), security policies, etc, and we are also building interfaces for allowing new matchmaking algorithms (for matching adverts with queries) and more sophisticated schemes for organising super peers (e.g. distributed hashtables, routing tables, agents, etc.) to be plugged into the network.. I will also present some results in the area that show the scalability of such an approach.

Behavioral Model Construction
Bernhard Steffen (University of Dortmund)
Automatically generated models may provide the key towards controlling the evolution of complex systems, may form the basis for test generation, and may be applied as monitors for running applications. However, the practicality of automata learning is currently largely impeded by its high complexity and unrealistic frame conditions. After a short introduction to automata learning, the talk will focus on methods to increase its practicality. In particular it will discuss applications specific optimizations, and illustrate their power along a realistic scenarios.

Copyright © FI MU
Copyright © FIT VUT
Brno, 2005–2008
Photos and Design