Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision Next revision | Previous revision Next revision Both sides next revision | ||
|
summerschool2018:lecture9 [2018/02/16 17:45] nour.assy |
summerschool2018:lecture9 [2018/02/16 17:46] nour.assy |
||
|---|---|---|---|
| Line 1: | Line 1: | ||
| - | ==== Jaco van de Pol, University of Twente, the Netherlands ==== | + | ==== Jaco van de Pol & Arnd Hartmanns, University of Twente, the Netherlands ==== |
| ---- | ---- | ||
| Line 20: | Line 20: | ||
| **Short bio**: **[[http://wwwhome.cs.utwente.nl/~vdpol/|Jaco van de Pol]]** studied Computer Science at Utrecht University, and received his PhD from the Faculty of Philosophy in Utrecht (1996) on Termination of Higher-order Rewrite Systems. After positions at the LMU Munich, TU/Eindhoven and CWI Amsterdam, he became full professor in Formal Methods and Tools at the University of Twente, being Head of the CS Department from 2014-2017. He was tool chair of TACAS 2015, and he is in the editorial board of the journals SCP and STTT. He was invited professor at the lab LIPN of Université Paris 13, both in 2016 and in 2017. His research interests include symbolic methods and parallel algorithms for verification and testing. Recent achievements are in scalable multi-core NDFS and multi-core SCC algorithms, and in multi-core Decision Diagram data-structures. These high-performance and/or symbolic algorithms are implemented in the LTSmin toolset, which won several prizes. The algorithms are available through a high-level API to multiple modelling formalisms, like Timed Automata (Uppaal), Promela (SPIN), Petri-Nets (PNML), Process Algebras (mCRL2), DiVinE, and B CSP (ProB). He applied verification technology in projects on railway interlockings, energy aware scheduling, biological signalling networks, and socio-technical security models. | **Short bio**: **[[http://wwwhome.cs.utwente.nl/~vdpol/|Jaco van de Pol]]** studied Computer Science at Utrecht University, and received his PhD from the Faculty of Philosophy in Utrecht (1996) on Termination of Higher-order Rewrite Systems. After positions at the LMU Munich, TU/Eindhoven and CWI Amsterdam, he became full professor in Formal Methods and Tools at the University of Twente, being Head of the CS Department from 2014-2017. He was tool chair of TACAS 2015, and he is in the editorial board of the journals SCP and STTT. He was invited professor at the lab LIPN of Université Paris 13, both in 2016 and in 2017. His research interests include symbolic methods and parallel algorithms for verification and testing. Recent achievements are in scalable multi-core NDFS and multi-core SCC algorithms, and in multi-core Decision Diagram data-structures. These high-performance and/or symbolic algorithms are implemented in the LTSmin toolset, which won several prizes. The algorithms are available through a high-level API to multiple modelling formalisms, like Timed Automata (Uppaal), Promela (SPIN), Petri-Nets (PNML), Process Algebras (mCRL2), DiVinE, and B CSP (ProB). He applied verification technology in projects on railway interlockings, energy aware scheduling, biological signalling networks, and socio-technical security models. | ||
| + | |||
| + | \\ | ||
| + | |||
| + | **[[http://arnd.hartmanns.name/|Arnd Hartmanns]]** is an assistant professor in the Formal Methods and Tools group at the University of Twente. His primary research interests are modelling tools and formalisms for stochastic timed and hybrid systems (in particular Modest) and their applications in various fields. Arnd was previously a postdoc in the Formal Methods and Tools group at the University of Twente and the Dependable Systems and Software group at Saarland University, where he also completed his Ph.D. in computer science with a thesis On the Analysis of Stochastic Timed Systems in 2015. | ||
| </WRAP> | </WRAP> | ||
| \\ | \\ | ||
