Werner Damm, Professor, University of Oldenburg and OFFIS.
Title of the talk:
Does it pay to extend the parameter of the world model?
(joint work with Bernd Finkbeiner, University Saarbrücken)
Will the cost for observing additional real-world phenomena in a world
model be recovered by the resulting increase in the quality of the
implementations based on the model? We address the quest for optimal
models in light of industrial practices in systems engineering, where
the development of control strategies is based on combined models of a
system and its environment. We introduce the notion of remorsefree
dominance between strategies, where one strategy is preferred over
another if it outperforms the other strategy in comparable situations,
even if neither strategy is guaranteed to achieve all objectives. We
call a world model optimal if it is sufficiently precise to allow for a
remorsefree dominating strategy that is guaranteed to remain dominant
even if the world model is refined. We present algorithms for the
automatic verification and synthesis of dominant strategies, based on
tree automata constructions from reactive synthesis.
Short bio: Prof. Werner Damm holds the Chair for Safety Critical Embedded Systems at the
Carl von Ossietzky University of Oldenburg. He is member of the Board of Directors
of OFFIS, the Chairman of the SafeTRANS competence cluster, integrating leading
companies and research institutes in the transportation domain, Chairman of
EICOSE (European Institute for Complex Safety Critical Systems Engineering), - the
Artemis Innovation Cluster on Transportation -, member of the Artemis Working
Group on Innovation as well as of the National Roadmap Embedded Systems
His recent research covers foundational research on mathematical models of
embedded systems, specification languages, hybrid systems, formal verification
methods, and real-time and safety analysis. This is complemented by applied
research with industrial partners in avionics, automotive, and train system application.
The focus of this research is on enhancing model-based development processes with
formal method-based approaches to verification, testing, and safety and real-time
analysis, as well as on enabling component-based design for embedded systems.
Björn Lisper, Professor, Mälardalen University, Sweden.
Title of the talk:
Parametric WCET Analysis
The purpose of Worst-Case Execution Time (WCET) analysis is to compute a safe upper bound to the
execution time of a sequential program executing uninterrupted on some given hardware. Such bounds
are important when verifying the timing requirements on hard real-time systems. WCET analysis has
been an active research topic for the last 20 years, and today there exists a large body of theory,
methods, and algorithms. Both academic and commercial tools have emerged during the last decade, and
the technique is becoming established in industrial use.
Traditional WCET analysis computes a single number. For programs whose execution time varies
strongly with the inputs, a single upper bound may provide very large overestimations in most
situations since it has to take the program executions for all possible input values into account.
It may then be advantageous to have a parametric WCET analysis, which computes the WCET bound as a
symbolic formula in the unknown inputs rather than as a single number. When the formula is
instantiated for the specific inputs at hand, the resulting number is likely to provide a much
tighter bound for the actual WCET. Thus, it is highly interesting to develop good methods and
tools for parametric WCET analysis.
In this talk we will first give a short primer to WCET analysis. We then give an account for
the past, present, and planned future research at Mälardalen University regarding parametric
Short bio: Björn Lisper has been full professor in Computer Engineering at
Mälardalen University since 1999, where he leads the Programming Languages group. For the last ten
years, he has focussed his research mostly on WCET analysis. He received his PhD from the Royal
Institute of Technology in Stockholm.
Michael Williams, SW Technology Program, Ericsson AB.
Title of the talk:
Ensure you are wearing fireproof clothes before trying to introduce disruptive technology
About 15 years ago, we proposed that we should use functional programming languages to implement our telecommunication switching systems.
We had developed and successfully used our own functional language, Erlang to develop a small PABX. We tried to introduce this to Ericsson on a broad scale but found unexpected problems. This talk will examine to problems of introducing new disruptive software technology in an industrial context.
After three years studies in Cambridge (UK), Michael Williams moved to Sweden and has been working for Ericsson AB ever since.
He has worked as hardware designer, programmer, software researcher and salesman. But most of the time he has
worked as a manager of various software development units in the real time control systems area.
Glynn Winskel, Professor, University of Cambridge.
Title of the talk: The winning ways of concurrent games
Abstract: This talk will introduce and motivate concurrent games and
winning strategies, show how winning strategies compose to yield a
bicategory and how this specializes to an order-enriched category of
winning deterministic concurrent strategies. A motivation has been to
develop an intensional domain theory, in the spirit of game semantics, that
right from the start also copes with concurrent computation. I'll try to
summarize the present state of progress and relations with existing
(generalized) domain theories.
Glynn Winskel rejoined the University of Cambridge Computer Laboratory as professor in 2000.
This followed 12 years as professor of computer science at Aarhus University.
There he was one of a small number of researchers in Denmark to be awarded funding to head a research centre
in Basic Research in Computer Science (BRICS). He originally read mathematics at Cambridge and mathematical
logic at Oxford before turning to computer science for his PhD at Edinburgh (completed 1980).
This was followed by a period as a Royal Society postdoctoral fellow, when he was invited by Dana Scott to join
his new group at Carnegie Mellon University. In 1984 he left Pittsburgh to take up a lectureship at the Cambridge, becoming reader in 1987, leaving for a
professorship in Aarhus in 1988. His book `The Formal Semantics of programming languages' (MIT Press)
is used internationally and available in Italian and Chinese. He sees his research as developing the mathematics
with which to understand and analyze computation, its nature, power and limitations. He is probably best known for his work generalizing the
methodology of domain theory and denotational semantics to concurrent computation, and as the main developer of
event structures. He was recently awarded an Advanced Grant by the European Research Council ``Events, Causality and Symmetry---the next generation semantics'' (ECSYM).