10th International Winter School on Modeling and Verifying Parallel Processes (MOVEP 2012) Proceedings edited by Pierre-Alain Reynier 3 Preface MOVEP 2012 is the tenth occurrence in the series of MOVEP summer/winter schools devoted to the wide area of modeling and verifying software and hardware systems. MOVEP (MOdeling and VErifying parallel Processes) was originally a French-speaking school and was initiated by A. Arnold (LaBRI, Bordeaux), J. Beauquier (LRI, Orsay), and O. Roux (IRCCyN, Nantes) in 1994. MOVEP was held in Nantes five times from 1994 to 2002, and adopted English as its working language in 2000. In 2004 the school was organized in Brussels, in 2006 in Bordeaux, in 2008 near Orleans,´ and in 2010 in Aachen. MOVEP 2012 is organized in Marseille, France, and will be hosted by the CIRM, an internationally recognized conference center in mathematics, located on the campus of Luminy. This year, about 95 people from all over Europe will participate to MOVEP. The program of MOVEP is composed of six tutorials and five advanced lectures that were proposed by the program committee. These lectures cover various topics including model checking, runtime verification, synthesis, real-time and stochastic systems, Petri nets, games, logic and security. The first part of these proceedings contains short/extended abstracts and references for the tutorials and advanced lectures. Another important part of MOVEP are the sessions devoted to Ph.D. students. In these sessions students have the opportunity to report on their work in short presentations. In MOVEP 2012 there are 21 such presentations in four sessions. These presentations were selected by the organizers on the basis of submitted extended abstracts which can be found in the second part of these proceedings. We hope that the student sessions will help the participants of the school to get feedback on their ongoing work, to get in touch with other researchers from their area and to initiate new collaborations. We would like to thank the Program Committee members for their help in compiling the well-balanced program of the school. We also thank the local organization committee and the members of the MOVE research team of the LIF who assisted us in the evaluation of the submitted papers. We would also like to thank the invited speakers and the authors of the papers submitted to the student sessions. We gratefully acknowledge support from CIRM, Laboratoire d’Informatique Fondamentale de Mar- seille (LIF), Aix-Marseille Universite,´ CNRS, INRIA, Action AFSEC (Formal Approaches for Communi- cating Embedded Systems) of the CNRS GDR ASR (Architecture, systems and network), Conseil Gen´ eral´ des Bouches du Rhone,ˆ and Ville de Marseille. November 2012 F. Cassez, T. Jeron,´ C. Loding,¨ N. Markey, P.-A. Reynier, M. Ryan Steering Committee MOVEP 2012 4 MOVEP 2012 Committees Steering Committee Franck Cassez (NICTA, Sydney, AU) Thierry Jeron´ (INRIA, Rennes, F) Christof Loding¨ (RWTH Aachen, D) Nicolas Markey (LSV, CNRS & ENS Cachan, F) Pierre-Alain Reynier (LIF, AMU & CNRS, F) Mark D. Ryan (Univ. Birmingham, UK) Program Committee Krishnendu Chatterjee (IST, A) Alessandro Cimatti (IRST, I) Veronique´ Cortier (LORIA, CNRS & INRIA, F) Giorgio Delzanno (University of Genova, I) Dino Distefano (Queen Mary University of London, UK) Martin Franzle¨ (University of Oldenburg, D) Petr Jancar (Technical University, Ostrava, CZ) Claude Jard (IRISA, ENS Cachan & CNRS & INRIA, F) Bengt Jonsson (Uppsala University, SE) Joost-Pieter Katoen (RWTH Aachen, D) Felix Klaedtke (ETH Zurich, Switzerland) Kim G. Larsen (Aalborg University, DK) Rupak Majumdar (MPI-SWS & UCLA, D) Oded Maler (VERIMAG, CNRS, F) Markus Muller-Olm¨ (University of Munster,¨ D) Joel Ouaknine (University of Oxford, UK) Jean-Franc¸ois Raskin (Universite´ Libre de Bruxelles, B) Olivier H. Roux (IRCCyN, F) Stefan Schwoon (LSV, CNRS & ENS Cachan, F) Jeremy Sproston (University of Torino, I) Gregoire´ Sutre (LaBRI, CNRS & University of Bordeaux, F) Frits Vaandrager (Radboud University Nijmegen, NL) Luca Vigano (University of Verona, I) Organizing Committee Arnaud Labourel Laurent Braud Remi´ Morin Nicolas Baudru Mathieu Caralp Nadine Comes Martine Quessada Sylvie Ros 5 Contents Tutorials MOSHE Y. VARDI Logic and Verification . 11 MARTA KWIATKOWSKA Probabilistic Systems . 12 JAVIER ESPARZA Unfoldings: A Partial Order approach to Model Checking . 13 KIM G. LARSEN Timed automata and their quantitative extensions . 14 HUGO GIMBERT Games for Verification and Synthesis . 15 ALESSANDRO CIMATTI AND THOMAS NOLL Safety, Dependability and Performance Analysis of Extended AADL Models . 16 Technical Talks MARTIN LEUCKER Runtime Verification . 33 GILLES BARTHE Computer-Aided Cryptographic Proofs and Designs . 34 ANTOINE MINE´ Static Analysis by Abstract Interpretation of Sequential and Multithreaded Programs . 35 AHMED BOUAJJANI Verification of concurrent systems . 49 RUZICA PISKAC Software Synthesis . 50 Student Papers FLORENT AVELLANEDA,REMI´ MORIN Checking Two Structural Properties of Vector Addition Systems with States . 55 STANISLAV BOHM¨ ,ONDREJˇ MECA,MARTIN Sˇ URKOVSKY´ Kaira: HPC and Petri nets . 61 MATHIEU CARALP,PIERRE-ALAIN REYNIER,JEAN-MARC TALBOT Visibly Pushdown Automata with Multiplicities: Finiteness and K-Boundedness . 67 6 SYLVAIN COTARD Runtime Verification for Real-Time Automotive Embedded Software . 73 AISWARYA CYRIAC Model Checking Dynamic Distributed Systems . 79 AMIT KUMAR DHAR Model Checking Flat Counter Systems . 85 MAXIME FOLSCHETTE Inferring Biological Regulatory Networks from Process Hitting models . 91 PAULIN FOURNIER Parameterized verification of networks with many identical probabilistic processes . 98 ALEKSANDRA JOVANOVIC´ Implementation of Real-Time Systems: Theory and Practice . 104 AHMET KARA Model Checking of Systems with Unboundedly Many Processes using Data Logics . 110 ARTEM KHYZHA,ALEXEY GOTSMAN Compositional reasoning about concurrent libraries on the axiomatic TSO memory model . 116 JOSE A. LOPES Hybrid type systems . 124 LAURE MILLET Formal Verification of Mobile Robot Protocols . 130 BENJAMIN MONMEGE A Probabilistic Kleene Theorem . 136 DURICA NIKOLIC´ Constraint-based Static Analyses for Java Bytecode Programs . 142 BENEDIKT NORDHOFF Tree-Regular Analysis of Parallel Programs with Dynamic Thread Creation and Locks . 148 SHASHANK PATHAK,GIORGIO METTA,LUCA PULINA,ARMANDO TACCHELLA Formal Verification of Agents Learning by Reinforcement . 154 GIUSEPPE PERELLI Recent Results and Future Directions in Strategy Logic . 160 SRINIVAS PINISETTY,YLIES` FALCONE,THIERRY JERON´ ,HERVE´ MARCHAND,ANTOINE ROLLET, OMER NGUENA TIMO Runtime Enforcement of Timed Properties . 166 7 CESAR´ RODR´IGUEZ Construction and Verification of Unfoldings for Petri Nets with Read Arcs . 172 ANNEGRET K. WAGLER,JAN-THIERRY WEGENER On Minimality and Equivalence of Petri Nets . 177 Tutorials Logic and Verification Moshe Y. Vardi Rice University, Houston, USA Mathematical logic developed as an attempt to provide formal foundations for mathematics. The success of that project can be questioned, as the logical foundations of mathematics proved to be incomplete, possibly inconsistent, and undecidable. Logic, on the other hand, proved to be highly successful in providing formal foundations for reasoning about computing systems, where it is deployed today in industrial tools. This tutorial will focus on one application of logic to verification, which is the temporal analysis of systems. References [1] Moshe Y. Vardi. From philosophical to industrial logics. Proc. 3rd Indian Conference on Logic and Its Applications. Lecture Notes in AI 5378, Springer, pp. 89-115, 2009. [2] Moshe Y. Vardi. An automata-theoretic approach to linear temporal logic. In Logics for Concurrency: Structure versus Automata. Springer-Verlag, Lecture Notes in Computer Science 1043, 1996, pp. 238–266. 11 Probabilistic Systems Marta Kwiatkowska Department of Computer Science, University of Oxford, UK Probabilistic model checking is a formal verication technique for the analysis of systems that exhibit stochastic behaviour. Such behaviour occurs, for example, due to component failure or randomisation, commonly used as a symmetry breaker in distributed coordination and communication protocols. The techniques have been implemented in tools such as PRISM (www.prismmodelchecker.org) and enable a range of quantitative analyses of probabilistic models against specifications such as the worst-case probability of failure within 10 seconds or the minimum expected power consumption over all possible schedulings. This course will give an overview of probabilistic model checking discrete-time Markov chains and Markov decision processes, explaining the underlying theory and model checking algorithms for temporal logics such as PCTL and LTL. The material will be illustrated with several case studies that have been modelled and analysed in PRISM. 12 Unfoldings: A Partial Order approach to Model Checking Javier Esparza Institut fur¨ Informatik, Technische Universitat Munchen,¨ Garching, Germany State space methods are the most popular approach to the automatic verification of concurrent systems. In their basic form, these methods explore the transition system associated to the concurrent system. Loosely speaking, the transition system is a graph having the reachable states of the system as nodes, and an edge from a state s to another state s0 whenever the system can make a move from s to s0. In the worst case, state space methods need to explore all nodes and transitions of the transition system. The main problem