Reachability Problems : 11th International Workshop, RP 2017, London, UK, September 7-9, 2017 : proceedings PDF
Preview Reachability Problems : 11th International Workshop, RP 2017, London, UK, September 7-9, 2017 : proceedings
Matthew Hague Igor Potapov (Eds.) 6 0 5 0 1 S C Reachability Problems N L 11th International Workshop, RP 2017 London, UK, September 7–9, 2017 Proceedings 123 Lecture Notes in Computer Science 10506 Commenced Publication in 1973 Founding and Former Series Editors: Gerhard Goos, Juris Hartmanis, and Jan van Leeuwen Editorial Board David Hutchison Lancaster University, Lancaster, UK Takeo Kanade Carnegie Mellon University, Pittsburgh, PA, USA Josef Kittler University of Surrey, Guildford, UK Jon M. Kleinberg Cornell University, Ithaca, NY, USA Friedemann Mattern ETH Zurich, Zurich, Switzerland John C. Mitchell Stanford University, Stanford, CA, USA Moni Naor Weizmann Institute of Science, Rehovot, Israel C. Pandu Rangan Indian Institute of Technology, Madras, India Bernhard Steffen TU Dortmund University, Dortmund, Germany Demetri Terzopoulos University of California, Los Angeles, CA, USA Doug Tygar University of California, Berkeley, CA, USA Gerhard Weikum Max Planck Institute for Informatics, Saarbrücken, Germany More information about this series at http://www.springer.com/series/7407 Matthew Hague Igor Potapov (Eds.) (cid:129) Reachability Problems 11th International Workshop, RP 2017 – London, UK, September 7 9, 2017 Proceedings 123 Editors MatthewHague Igor Potapov RoyalHolloway University ofLondon University of Liverpool London Liverpool UK UK ISSN 0302-9743 ISSN 1611-3349 (electronic) Lecture Notesin Computer Science ISBN 978-3-319-67088-1 ISBN978-3-319-67089-8 (eBook) DOI 10.1007/978-3-319-67089-8 LibraryofCongressControlNumber:2017951439 LNCSSublibrary:SL1–TheoreticalComputerScienceandGeneralIssues ©SpringerInternationalPublishingAG2017 Thisworkissubjecttocopyright.AllrightsarereservedbythePublisher,whetherthewholeorpartofthe material is concerned, specifically the rights of translation, reprinting, reuse of illustrations, recitation, broadcasting, reproduction on microfilms or in any other physical way, and transmission or information storageandretrieval,electronicadaptation,computersoftware,orbysimilarordissimilarmethodologynow knownorhereafterdeveloped. Theuseofgeneraldescriptivenames,registerednames,trademarks,servicemarks,etc.inthispublication doesnotimply,evenintheabsenceofaspecificstatement,thatsuchnamesareexemptfromtherelevant protectivelawsandregulationsandthereforefreeforgeneraluse. Thepublisher,theauthorsandtheeditorsaresafetoassumethattheadviceandinformationinthisbookare believedtobetrueandaccurateatthedateofpublication.Neitherthepublishernortheauthorsortheeditors give a warranty, express or implied, with respect to the material contained herein or for any errors or omissionsthatmayhavebeenmade.Thepublisherremainsneutralwithregardtojurisdictionalclaimsin publishedmapsandinstitutionalaffiliations. Printedonacid-freepaper ThisSpringerimprintispublishedbySpringerNature TheregisteredcompanyisSpringerInternationalPublishingAG Theregisteredcompanyaddressis:Gewerbestrasse11,6330Cham,Switzerland Preface This volume contains the papers presented at the 11th International Workshop on Reachability Problems (RP), held on September 7–9, 2017, at Royal Holloway, University of London, UK. Previous workshops in the series were located at: Aalborg University (2016), theUniversityofWarsaw(2015),theUniversity ofOxford (2014), Uppsala University (2013), the University of Bordeaux (2012), the University of Genoa (2011), Masaryk University Brno (2010), École Polytechnique (2009), the University of Liverpool (2008), and Turku University (2007). The aim of the conference is to bring together scholars from diverse fields with a shared interest in reachability problems, and to promote the exploration of new approaches for the modelling and analysis of computational processes by combining mathematical, algorithmic, and computational techniques. Topics of interest include (but are not limited to): reachability for infinite state systems; rewriting systems; reachability analysis in counter/timed/cellular/communicating automata; Petri nets; computationalaspectsofsemigroups,groups,andrings;reachabilityindynamicaland hybrid systems; frontiers between decidable and undecidable reachability problems; complexity and decidability aspects; predictability in iterative maps, and new com- putational paradigms. The invited speakers at the 2017 workshop were: – Hana Chockler, King’s College London – Laurent Doyen, LSV-ENS Cachan – Raphaël Jungers, Université catholique de Louvain – Andreas Podelski, University of Freiburg The workshop received 17 submissions. Each submission was reviewed by three Program Committee (PC) members. The members of the PC and the list of external reviewers can be found on the next two pages. The PC is grateful for the high quality workproducedbytheseexternalreviewers.Basedonthesereviews,thePCdecidedto accept 12papers,inadditiontothefour invited talks.Overall thisvolumecontains 12 contributed papers and one paper by an invited speaker. The workshop also provided the opportunity to researchers to give informal presentations, prepared shortly before the event, informing the participants about current research and work in progress. ItisapleasuretothanktheteambehindtheEasyChairsystemandtheLectureNotes in Computer Science team at Springer, who together made the production of this volume possible in time for the workshop. Finally, we thank all the authors for their high-quality contributions, and the participants for making RP 2017 a success. September 2017 Igor Potapov Matthew Hague Organization Program Committee C. Aiswarya Chennai Mathematical Institute, India Paul Bell Liverpool John Moores University, UK Patricia Bouyer-Decitre LSV, CNRS & ENS Cachan, Université Paris Saclay, France Laura Bozzelli Technical University of Madrid (UPM), Spain Giorgio Delzanno DIBRIS, Università di Genova, Italy Matthew Hague Royal Holloway, University of London, UK Piotrek Hofman University of Warsaw, Poland Salvatore La Torre Università degli studi di Salerno, Italy Peter Lammich TU Munich, Germany Martin Lange University of Kassel, Germany Ranko Lazic University of Warwick, UK Ondrej Lengal Brno University of Technology, Czech Republic Jerome Leroux CNRS, France Rupak Majumdar MPI-SWS, Germany Igor Potapov The University of Liverpool, UK Ahmed Rezine Linköping University, Sweden Tachio Terauchi Japan Advanced Institute of Science and Technology, Japan Hsu-Chun Yen National Taiwan University, Taiwan Additional Reviewers Haddad, Serge Kreiker, Joerg Prianychnykova, Olena Sorrentino, Loredana Abstracts of Invited Talks Trace Abstraction Andreas Podelski University of Freiburg, Germany Abstract. Trace abstraction refers to a new approach to program verification algorithms.Insteadoftryingtoconstructaprooffortheinputprogramdirectly, we firstconstruct auxiliary programs fromproofs. Weconstruct eachauxiliary program (which can be of general form) from the proof for a program in a specific form, namely a program in the form of a trace (i.e., a sequence of statements). A trace is a program (where the statements have a semantics). At thesame time,atrace isawordoverafinitealphabet(wherethe semanticsof statements is ignored).Asaword,asequenceof statements canbereadbyan automaton. Just as we ask whether there exists an accepting run of a given automatononasequenceofletters,wecanaskwhetherthereexistsacorrectness prooffor a sequence of statements, a correctness proof that can be assembled from a given finite set of Hoare triples. We iteratively construct auxiliary pro- gramsfromproofsfortraces.Theiterationstopswhentheconstructedprograms togethercoverallpossiblebehaviorsoftheinputprogram.Acrucialstephereis thecoveringcheck.Thisstepisbasedonalgorithmsforautomata(inclusiontest, minimization,…).Theapproachappliestoarangeofverificationproblems,for sequential programs with (possibly recursive) procedures and concurrent pro- grams with possibly unboundedly many threads, and even to real-time programs. How Do We Know That Our System Is Correct? Hana Chockler King’sCollege London,UK Abstract. A negative answer from the model-checking procedure is accompa- nied by a counterexample – a trace demonstrating what went wrong. On the other hand, when the answer from the model-checker is positive, usually no furtherinformationisgiven.Theissueof“suspectingthepositiveanswer”first aroseinindustry,wherepositiveanswersfrommodel-checkersoftenconcealed serious bugsin hardware designs. In this talk, I discuss some reasons why the positive answer from the model-checker may require further investigation and briefly and in broad terms describe algorithms for such investigations, called sanity checks. The talk also (briefly) introduces the theory of causality and counterfactual reasoning and its applications to model-checking, mostly in the context of the subjectofthistalk,includingsomerecentcomplexityresultsandapplicationsof structure-based causality. The talk then attempts to define the main goal of the sanity checks, expla- nations, and related algorithms, or at least provide some food for thought regarding the question of the mailgoal. I concludethe talk with outliningsome promisingfuture directions. Thetalkisbasedonmanypaperswrittenbymanypeople,andisnotlimited to myown research. It isreasonablyself-contained.
The list of books you might like
