DOCSLIB.ORG

Modeling and Verifying Parallel Processes

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Modeling and Verifying Parallel Processes 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
Load more

Recommended publications
  • Metadata for Semantic and Social Applications
    etadata is a key aspect of our evolving infrastructure for information management, social computing, and scientific collaboration. DC-2008M will focus on metadata challenges, solutions, and innovation in initiatives and activities underlying semantic and social applications. Metadata is part of the fabric of social computing, which includes the use of wikis, blogs, and tagging for collaboration and participation. Metadata also underlies the development of semantic applications, and the Semantic Web — the representation and integration of multimedia knowledge structures on the basis of semantic models. These two trends flow together in applications such as Wikipedia, where authors collectively create structured information that can be extracted and used to enhance access to and use of information sources. Recent discussion has focused on how existing bibliographic standards can be expressed as Semantic Metadata for Web vocabularies to facilitate the ingration of library and cultural heritage data with other types of data. Harnessing the efforts of content providers and end-users to link, tag, edit, and describe their Semantic and information in interoperable ways (”participatory metadata”) is a key step towards providing knowledge environments that are scalable, self-correcting, and evolvable. Social Applications DC-2008 will explore conceptual and practical issues in the development and deployment of semantic and social applications to meet the needs of specific communities of practice. Edited by Jane Greenberg and Wolfgang Klas DC-2008
    [Show full text]
  • Professor Marta Kwiatkowska
    Potential Supervisors Marta Kwiatkowska Marta Kwiatkowska is Professor of Computing Systems and Fellow of Trinity College, University of Oxford. Prior to this she was Professor in the School of Computer Science at the University of Birmingham, Lecturer at the University of Leicester and Assistant Professor at the Jagiellonian University in Cracow, Poland. She holds a BSc/MSc in Computer Science from the Jagiellonian University, MA from Oxford and a PhD from the University of Leicester. In 2014 she was awarded an honorary doctorate from KTH Royal Institute of Technology in Stockholm. Marta Kwiatkowska spearheaded the development of probabilistic and quantitative methods in verification on the international scene. She led the development of the PRISM model checker, the leading software tool in the area and widely used for research and teaching and winner of the HVC 2016 Award. Applications of probabilistic model checking have spanned communication and security protocols, nanotechnology designs, power management, game theory, planning and systems biology, with genuine flaws found and corrected in real-world protocols. Kwiatkowska gave the Milner Lecture in 2012 in recognition of "excellent and original theoretical work which has a perceived significance for practical computing" and was invited to give keynotes at the LICS 2003, ESEC/FSE 2007, ETAPS/FASE 2011, ATVA 2013, ICALP 2016 and CAV 2017 conferences. Marta Kwiatkowska is the first female winner of the 2018 Royal Society Milner Award and Lecture. She is a Fellow of ACM, member of Academia Europea, Fellow of EATCS and Fellow of the BCS. She serves on editorial boards of several journals, including Information and Computation, Formal Methods in System Design, Logical Methods in Computer Science, Science of Computer Programming and Royal Society Open Science journal.
    [Show full text]
  • Metod Иностранный Язык ПЗ 38.02.04 2019
    МИНИCTEPCTBO НАУКИ И ВЫСШЕГО ОБРАЗОВАНИЯ РОССИЙСКОЙ ФЕДЕРАЦИИ Федеральное государственное автономное образовательное учреждение высшего образования «СЕВЕРО-КАВКАЗСКИЙ ФЕДЕРАЛЬНЫЙ УНИВЕРСИТЕТ» Институт сервиса, туризма и дизайна (филиал) СКФУ в г. Пятигорске Колледж Института сервиса, туризма и дизайна (филиал) СКФУ в г. Пятигорске Иностранный язык МЕТОДИЧЕСКИЕ УКАЗАНИЯ ДЛЯ ПРАКТИЧЕСКИХ ЗАНЯТИЙ Специальность СПО 38.02.04 Коммерция (по отраслям) Квалификация: Менеджер по продажам Пятигорск 2019 Методические указания для практических занятий по дисциплине «Иностранный язык» составлены в соответствии с требованиями ФГОС СПО, предназначены для студентов, обучающихся по специальности: 38.02.04 Коммерция (по отраслям) Рассмотрено на заседании ПЦК колледжа ИСТиД (филиал) СКФУ в г. Пятигорске Протокол № 9 от «08» апреля 2019г. 2 Пояснительная записка Программа учебной дисциплины по иностранному языку является частью основной профессиональной образовательной программы в соответствии с ФГОС по специальности 38.02.04 Коммерция (по отраслям) Дисциплина входит в общий гуманитарный и социально – экономический цикл профессиональной подготовки. В результате освоения учебной дисциплины обучающийся должен уметь: говорение – вести диалог (диалог–расспрос, диалог–обмен мнениями/суждениями, диалог–побуждение к действию, этикетный диалог и их комбинации) в ситуациях официального и неофициального общения в бытовой, социокультурной и учебно-трудовой сферах, используя аргументацию, эмоционально-оценочные средства; – рассказывать, рассуждать в связи с изученной
    [Show full text]
  • Current Issue of FACS FACTS
    Issue 2021-2 July 2021 FACS A C T S The Newsletter of the Formal Aspects of Computing Science (FACS) Specialist Group ISSN 0950-1231 FACS FACTS Issue 2021-2 July 2021 About FACS FACTS FACS FACTS (ISSN: 0950-1231) is the newsletter of the BCS Specialist Group on Formal Aspects of Computing Science (FACS). FACS FACTS is distributed in electronic form to all FACS members. Submissions to FACS FACTS are always welcome. Please visit the newsletter area of the BCS FACS website for further details at: https://www.bcs.org/membership/member-communities/facs-formal-aspects- of-computing-science-group/newsletters/ Back issues of FACS FACTS are available for download from: https://www.bcs.org/membership/member-communities/facs-formal-aspects- of-computing-science-group/newsletters/back-issues-of-facs-facts/ The FACS FACTS Team Newsletter Editors Tim Denvir [email protected] Brian Monahan [email protected] Editorial Team: Jonathan Bowen, John Cooke, Tim Denvir, Brian Monahan, Margaret West. Contributors to this issue: Jonathan Bowen, Andrew Johnstone, Keith Lines, Brian Monahan, John Tucker, Glynn Winskel BCS-FACS websites BCS: http://www.bcs-facs.org LinkedIn: https://www.linkedin.com/groups/2427579/ Facebook: http://www.facebook.com/pages/BCS-FACS/120243984688255 Wikipedia: http://en.wikipedia.org/wiki/BCS-FACS If you have any questions about BCS-FACS, please send these to Jonathan Bowen at [email protected]. 2 FACS FACTS Issue 2021-2 July 2021 Editorial Dear readers, Welcome to the 2021-2 issue of the FACS FACTS Newsletter. A theme for this issue is suggested by the thought that it is just over 50 years since the birth of Domain Theory1.
    [Show full text]
  • Dr Gordon Baxter, University of St Andrews
    Dr Gordon Baxter, University of St Andrews Gordon Baxter has degrees in Computer Science (BSc(Eng)), Cognitive Science (MPhil), and Human Factors (PhD). He has several years experience in systems development, mostly on industrial and defence applications, having worked for Rolls Royce, Racal, Systems Designers, NEI and ICI. Most of this work involved aspects related to user interface design and human-computer interaction. Since joining academia he has worked on projects looking at rapid decision making in complex environments (for the DRA), dependability of computer based systems (for the NHS in Leeds, and several social services departments across the UK), and large scale complex IT systems. He is a Chartered Engineer, a Member of the British Computer Society, and an Associate Member of the Ergonomics Society. Dr Radu Calinescu, University of Oxford Radu Calinescu is a senior research officer at Oxford University Computing Laboratory. He obtained his DPhil in Computation from the University of Oxford in 1998, with a thesis that received a Distinguished Dissertation Award from the British Computer Society and was published as a Springer book. From 1999 to 2005, he worked in industry as the technical architect and senior development manager of an Oxford University spin-out software company specialising in the development of policy-driven data-centre management solutions. His research interests include autonomic computing, policy-based management of complex systems, modelling and model checking, automated and model-driven software engineering, and high performance computing. He is a senior member of the IEEE, and has chaired or served on the technical program committees of several international conferences on autonomic computing and formal methods.
    [Show full text]
  • DMK BO2K8.Pdf
    Black Ops 2008: It’s The End Of The Cache As We Know It Or: “64K Should Be Good Enough For Anyone” Dan Kaminsky Director of Penetration Testing IOActive, Inc. copyright IOActive, Inc. 2006, all rights reserved. Introduction • Hi! I’m Dan Kaminsky – This is my 9th talk here at Black Hat – I look for interesting design elements – new ways to manipulate old systems, old ways to manipulate new systems – Career thus far spent in Fortune 500 • Consulting now – I found a really bad bug a while ago. • You might have heard about it. • There was a rather coordinated patching effort. • I went out on a very shaky limb, to try to keep the details quiet – Asked people not to publicly speculate » Totally unreasonable request » Had to try. – Said they’d be congratulated here Thanks to the community • First finder: Pieter de Boer – Michael Gersten – 51 hours later – Mike Christian • Best Paper • Left the lists – Bernard Mueller, sec- – Paul Schmehl consult.com – Troy XYZ – Five days later, but had full – Others info/repro • Thanks • Interesting thinking (got close, – Jen Grannick (she contacted kept off lists) me) – Andre Ludwig – DNSStuff (they taught me – Nicholas Weaver LDNS, and reimplemented – “Max”/@skst (got really really my code better) close) – Everyone else (people know – Zeev Rabinovich who they are, and know I owe them a beer). Obviously thanks to the Summit Members • Paul Vixie • People have really been • David Dagon incredible with this. – Georgia Tech – thanks for • What did we accomplish? the net/compute nodes • Florian Weimer • Wouter Wijngaards • Andreas Gustaffon • Microsoft • Nominum • OpenDNS • ISC • Neustar • CERT There are numbers and are there are numbers • 120,000,000 – The number of users protected by Nominum’s carrier patching operation – They’re not the Internet’s most popular server! • That’s BIND, and we saw LOTS of BIND patching – They’re not the only server that got lots of updates • Microsoft’s Automatic Updates swept through lots and lots of users • Do not underestimate MSDNS behind the firewall.
    [Show full text]
  • Mathematics People
    NEWS Mathematics People or up to ten years post-PhD, are eligible. Awardees receive Braverman Receives US$1 million distributed over five years. NSF Waterman Award —From an NSF announcement Mark Braverman of Princeton University has been selected as a Prizes of the Association cowinner of the 2019 Alan T. Wa- terman Award of the National Sci- for Women in Mathematics ence Foundation (NSF) for his work in complexity theory, algorithms, The Association for Women in Mathematics (AWM) has and the limits of what is possible awarded a number of prizes in 2019. computationally. According to the Catherine Sulem of the Univer- prize citation, his work “focuses on sity of Toronto has been named the Mark Braverman complexity, including looking at Sonia Kovalevsky Lecturer for 2019 by algorithms for optimization, which, the Association for Women in Math- when applied, might mean planning a route—how to get ematics (AWM) and the Society for from point A to point B in the most efficient way possible. Industrial and Applied Mathematics “Algorithms are everywhere. Most people know that (SIAM). The citation states: “Sulem every time someone uses a computer, algorithms are at is a prominent applied mathemati- work. But they also occur in nature. Braverman examines cian working in the area of nonlin- randomness in the motion of objects, down to the erratic Catherine Sulem ear analysis and partial differential movement of particles in a fluid. equations. She has specialized on “His work is also tied to algorithms required for learning, the topic of singularity development in solutions of the which serve as building blocks to artificial intelligence, and nonlinear Schrödinger equation (NLS), on the problem of has even had implications for the foundations of quantum free surface water waves, and on Hamiltonian partial differ- computing.
    [Show full text]
  • IDOL Keyview Viewing SDK 12.7 Programming Guide
    KeyView Software Version 12.7 Viewing SDK Programming Guide Document Release Date: October 2020 Software Release Date: October 2020 Viewing SDK Programming Guide Legal notices Copyright notice © Copyright 2016-2020 Micro Focus or one of its affiliates. The only warranties for products and services of Micro Focus and its affiliates and licensors (“Micro Focus”) are set forth in the express warranty statements accompanying such products and services. Nothing herein should be construed as constituting an additional warranty. Micro Focus shall not be liable for technical or editorial errors or omissions contained herein. The information contained herein is subject to change without notice. Documentation updates The title page of this document contains the following identifying information: l Software Version number, which indicates the software version. l Document Release Date, which changes each time the document is updated. l Software Release Date, which indicates the release date of this version of the software. To check for updated documentation, visit https://www.microfocus.com/support-and-services/documentation/. Support Visit the MySupport portal to access contact information and details about the products, services, and support that Micro Focus offers. This portal also provides customer self-solve capabilities. It gives you a fast and efficient way to access interactive technical support tools needed to manage your business. As a valued support customer, you can benefit by using the MySupport portal to: l Search for knowledge documents of interest l Access product documentation l View software vulnerability alerts l Enter into discussions with other software customers l Download software patches l Manage software licenses, downloads, and support contracts l Submit and track service requests l Contact customer support l View information about all services that Support offers Many areas of the portal require you to sign in.
    [Show full text]
  • ICML 2019 Workshop Book Generated Sat Jul 06, 2019
    ICML 2019 Workshop book Generated Sat Jul 06, 2019 Workshop organizers make last-minute changes to 204, Negative Dependence: Theory and their schedule. Download this document again to Applications in Machine Learning Gartrell, get the lastest changes, or use the ICML mobile Gillenwater, Kulesza, Mariet application. Grand Ballroom A, Understanding and Improving Schedule Highlights Generalization in Deep Learning Krishnan, Mobahi, Neyshabur, Bartlett, Song, Srebro June 14, 2019 Grand Ballroom B, 6th ICML Workshop on 101, ICML 2019 Workshop on Computational Automated Machine Learning (AutoML 2019) Biology Pe'er, Prabhakaran, Azizi, Diallo, Hutter, Vanschoren, Eggensperger, Feurer Kundaje, Engelhardt, Dhifli, MEPHU NGUIFO, Hall A, Generative Modeling and Model-Based Tansey, Vogt, Listgarten, Burdziak, CompBio Reasoning for Robotics and AI Rajeswaran, 102, ICML 2019 Time Series Workshop Todorov, Mordatch, Agnew, Zhang, Pineau, Kuznetsov, Yang, Yu, Tang, Wang Chang, Erhan, Levine, Stachenfeld, Zhang 103, Human In the Loop Learning (HILL) Wang, Hall B, Uncertainty and Robustness in Deep Wang, Yu, Zhang, Gonzalez, Jia, Bird, Learning Li, Lakshminarayanan, Hendrycks, Varshney, Kim, Weller Dietterich, Gilmer 104 A, Climate Change: How Can AI Help? Seaside Ballroom, Reinforcement Learning for Rolnick, Lacoste, Maharaj, Chayes, Bengio Real Life Li, Geramifard, Li, Szepesvari, Wang 104 B, Workshop on the Security and Privacy of Seaside Ballroom, Real-world Sequential Machine Learning Papernot, Tramer, Li, Decision Making: Reinforcement Learning Boneh,
    [Show full text]
  • Safety Verification for Deep Neural
    1 Safety Verification for Deep Neural Networks with 2 Provable Guarantees 3 Marta Kwiatkowska 4 Department of Computer Science, University of Oxford, UK 5 http://http://www.cs.ox.ac.uk/marta.kwiatkowska/ 6 [email protected] 7 Abstract 8 Computing systems are becoming ever more complex, increasingly often incorporating deep learning 9 components. Since deep learning is unstable with respect to adversarial perturbations, there is a 10 need for rigorous software development methodologies that encompass machine learning. This paper 11 describes progress with developing automated verification techniques for deep neural networks to 12 ensure safety and robustness of their decisions with respect to input perturbations. This includes 13 novel algorithms based on feature-guided search, games, global optimisation and Bayesian methods. 14 2012 ACM Subject Classification Theory of computation → Logic and verification; Computing 15 methodologies → Neural networks 16 Keywords and phrases Neural networks, robustness, formal verification, Bayesian neural networks 17 Digital Object Identifier 10.4230/LIPIcs.CONCUR.2019.38 18 Category Invited paper 19 Funding Marta Kwiatkowska: This project has received funding from the European Research 20 Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant 21 agreement No. 834115) and the EPSRC Programme Grant on Mobile Autonomy (EP/M019918/1). 22 1 Introduction 23 Computing devices have become ubiquitous and ever present in our lives: smartphones 24 help us stay in touch with family and friends, GPS-enabled apps offer directions literally 25 at our fingertips, and voice-controlled assistants are now able to execute simple commands. 26 Artificial Intelligence is making great strides, promising many more exciting applications 27 with an increased level of autonomy, from wearable medical devices to robotic care assistants 28 and self-driving cars.
    [Show full text]
  • Arxiv:1906.09142V3 [Cs.LO] 17 Jul 2019 Reason About a Range of Quantitative Aspects of a System’S Behaviour: Probability, Time, Resource Usage, and Many Others
    Verification and Control of Turn-Based Probabilistic Real-Time Games Marta Kwiatkowska1, Gethin Norman2, and David Parker3 1 Department of Computing Science, University of Oxford, UK 2 School of Computing Science, University of Glasgow, UK 3 School of Computer Science, University of Birmingham, UK Abstract. Quantitative verification techniques have been developed for the formal analysis of a variety of probabilistic models, such as Markov chains, Markov decision process and their variants. They can be used to produce guarantees on quantitative aspects of system behaviour, for ex- ample safety, reliability and performance, or to help synthesise controllers that ensure such guarantees are met. We propose the model of turn-based probabilistic timed multi-player games, which incorporates probabilistic choice, real-time clocks and nondeterministic behaviour across multiple players. Building on the digital clocks approach for the simpler model of probabilistic timed automata, we show how to compute the key mea- sures that underlie quantitative verification, namely the probability and expected cumulative price to reach a target. We illustrate this on case studies from computer security and task scheduling. 1 Introduction Probability is a crucial tool for modelling computerised systems. We can use it to model uncertainty, for example in the operating environment of an autonomous vehicle or a wireless sensor network, and we can reason about systems that use randomisation, from probabilistic routing in anonymity network protocols to symmetry breaking in communication protocols. Formal verification of such systems can provide us with rigorous guarantees on, for example, the performance and reliability of computer networks [7], the amount of inadvertent information leakage by a security protocol [5], or the safety level of an airbag control system [2].
    [Show full text]
  • Some Directed Graph Algorithms and Their Application to Pointer Analysis
    University of London Imperial College of Science, Technology and Medicine Department of Computing Some directed graph algorithms and their application to pointer analysis David J. Pearce February 2005 Submitted in partial fulfilment of the requirements for the degree of Doctor of Philosophy in Engineering of the University of London Abstract This thesis is focused on improving execution time and precision of scalable pointer analysis. Such an analysis statically determines the targets of all pointer variables in a program. We formulate the analysis as a directed graph problem, where the solution can be obtained by a computation similar, in many ways, to transitive closure. As with transitive closure, identifying strongly connected components and transitive edges offers significant gains. However, our problem differs as the computation can result in new edges being added to the graph and, hence, dynamic algorithms are needed to efficiently identify these structures. Thus, pointer analysis has often been likened to the dynamic transitive closure problem. Two new algorithms for dynamically maintaining the topological order of a directed graph are presented. The first is a unit change algorithm, meaning the solution must be recomputed immediately following an edge insertion. While this has a marginally inferior worse-case time bound, compared with a previous solution, it is far simpler to implement and has fewer restrictions. For these reasons, we find it to be faster in practice and provide an experimental study over random graphs to support this. Our second is a batch algorithm, meaning the solution can be updated after several insertions, and it is the first truly dynamic solution to obtain an optimal time bound of O(v + e + b) over a batch b of edge insertions.
    [Show full text]