Lecture Notes in Computer Science 7253 CommencedPublicationin1973 FoundingandFormerSeriesEditors: GerhardGoos,JurisHartmanis,andJanvanLeeuwen EditorialBoard DavidHutchison LancasterUniversity,UK TakeoKanade CarnegieMellonUniversity,Pittsburgh,PA,USA JosefKittler UniversityofSurrey,Guildford,UK JonM.Kleinberg CornellUniversity,Ithaca,NY,USA AlfredKobsa UniversityofCalifornia,Irvine,CA,USA FriedemannMattern ETHZurich,Switzerland JohnC.Mitchell StanfordUniversity,CA,USA MoniNaor WeizmannInstituteofScience,Rehovot,Israel OscarNierstrasz UniversityofBern,Switzerland C.PanduRangan IndianInstituteofTechnology,Madras,India BernhardSteffen TUDortmundUniversity,Germany MadhuSudan MicrosoftResearch,Cambridge,MA,USA DemetriTerzopoulos UniversityofCalifornia,LosAngeles,CA,USA DougTygar UniversityofCalifornia,Berkeley,CA,USA GerhardWeikum MaxPlanckInstituteforInformatics,Saarbruecken,Germany Farhad Arbab Peter Csaba Ölveczky (Eds.) Formal Aspects of Component Software 8th International Symposium, FACS 2011 Oslo, Norway, September 14-16, 2011 Revised Selected Papers 1 3 VolumeEditors FarhadArbab CentreforMathematics andComputerScience(CWI) SciencePark123 1098XGAmsterdam,TheNetherlands E-mail:[email protected] PeterCsabaÖlveczky UniversityofOslo DepartmentofInformatics Postboks1080Blindern 0316Oslo,Norway E-mail:peterol@ifi.uio.no ISSN0302-9743 e-ISSN1611-3349 ISBN978-3-642-35742-8 e-ISBN978-3-642-35743-5 DOI10.1007/978-3-642-35743-5 SpringerHeidelbergDordrechtLondonNewYork LibraryofCongressControlNumber:2012954139 CRSubjectClassification(1998):D.2.4,D.2,F.4,F.3,H.3.5,D.3,D.1,K.6.3 LNCSSublibrary:SL2–ProgrammingandSoftwareEngineering ©Springer-VerlagBerlinHeidelberg2012 Thisworkissubjecttocopyright.Allrightsarereserved,whetherthewholeorpartofthematerialis concerned,specificallytherightsoftranslation,reprinting,re-useofillustrations,recitation,broadcasting, reproductiononmicrofilmsorinanyotherway,andstorageindatabanks.Duplicationofthispublication orpartsthereofispermittedonlyundertheprovisionsoftheGermanCopyrightLawofSeptember9,1965, initscurrentversion,andpermissionforusemustalwaysbeobtainedfromSpringer.Violationsareliable toprosecutionundertheGermanCopyrightLaw. Theuseofgeneraldescriptivenames,registerednames,trademarks,etc.inthispublicationdoesnotimply, evenintheabsenceofaspecificstatement,thatsuchnamesareexemptfromtherelevantprotectivelaws andregulationsandthereforefreeforgeneraluse. Typesetting:Camera-readybyauthor,dataconversionbyScientificPublishingServices,Chennai,India Printedonacid-freepaper SpringerispartofSpringerScience+BusinessMedia(www.springer.com) Preface This volume contains the revised versions of accepted regular papers presented at the 8th International Symposium on Formal Aspects of Component Soft- ware (FACS 2011), held at the Department of Informatics, University of Oslo, on September 14–16, 2011. It also contains contributions by the three invited speakers at this event: Jos´e Meseguer, John Rushby, and Ketil Stølen. FACS 2011 was the eighth event in a series founded by the International InstituteforSoftwareTechnologyoftheUnitedNationsUniversity(UNU-IIST). The objective of FACS is to bring researchers and practitioners of component softwareandformalmethods togetherin orderto foster a deeper understanding of reliable component-based systems development and their applications, us- ing formal methods. The component-based software development approach has emerged as a promising paradigm to cope with the complexity of present-day softwaresystemsbybringingsoundengineeringprinciplesintosoftwareengineer- ing. However,many challenging conceptual and technologicalissues still remain inthetheoryandpracticeofcomponent-basedsoftwaredevelopment.Moreover, the advent of service-oriented computing has brought to the fore new dimen- sions, such as quality of service and robustness to withstand inevitable faults, that require revisiting established component-based concepts in order to meet the new requirements of the service-orientedparadigm. We received 46 submissions from 26 countries, out of which the Program Committee accepted 16 as regular papers, and, furthermore, conditionally ac- cepted 4 additional papers. The revised versions of 18 of these papers appear in this volume. Each submission to FACS 2011 was reviewed by at least three referees. Many colleagues and friends contributed to FACS 2011. First, we thank the authors who submitted their work to FACS 2011 and who, by their contribu- tions and participation, made this symposium a high-quality event. We thank the Program Committee members and their sub-reviewers for their timely and insightful reviews as well as for their involvement in the post-reviewing discus- sions. We are also grateful to the FACS Steering Committee for its guidance, to the invited speakers, and to Lucian Bentea for all his assistance in organiz- ing this event. Finally, we thank Andrei Voronkov for the excellent EasyChair conference system, and the ResearchCouncil of Norwayand the Department of Informatics at the University of Oslo for financially supporting the symposium. April 2012 Farhad Arbab Peter O¨lveczky Organization Program Chairs Farhad Arbab CWI and Leiden University, The Netherlands Peter Csaba O¨lveczky University of Oslo, Norway Steering Committee Zhiming Liu (Coordinator) IIST UNU, Macau Farhad Arbab CWI and Leiden University, The Netherlands Lu´ıs Barbosa University of Minho, Portugal Carlos Canal University of Ma´laga,Spain Markus Lumpe Swinburne University of Technology,Australia Eric Madelaine INRIA, Centre Sophia Antipolis, France Peter Csaba O¨lveczky University of Oslo, Norway Corina Pa˘s˘areanu NASA Ames, USA Bernhard Sch¨atz fortiss GmbH, Germany Program Committee Erika A´braha´m RWTH Aachen University, Germany Farhad Arbab CWI and Leiden University, The Netherlands Christel Baier Technical University of Dresden, Germany Lu´ıs Barbosa Universidade do Minho, Portugal Mihaela Bobaru NASA/JPL, USA Christiano Braga Universidade Federal Fluminense, Brazil Roberto Bruni University of Pisa, Italy Carlos Canal University of Ma´laga,Spain Frank De Boer CWI, The Netherlands Francisco Duran University of Ma´laga,Spain Rolf Hennicker Ludwig-Maximilians-Universit¨atMu¨nchen, Germany Alexander Knapp Augsburg University, Germany Zhiming Liu IIST UNU, Macau Markus Lumpe Swinburne University of Technology,Australia Eric Madelaine INRIA, Centre Sophia Antipolis, France Sun Meng Peking University, China Peter Csaba O¨lveczky University of Oslo, Norway Corina Pa˘s˘areanu NASA Ames, USA Frantiˇsek Pl´aˇsil Charles University, Czech Republic VIII Organization Gwen Salau¨n Grenoble INP - INRIA, France Bernhard Sch¨atz fortiss GmbH, Germany Wolfram Schulte Microsoft Research, USA Nishant Sinha NEC Labs, Princeton, USA Marjan Sirjani Reykjavik University, Iceland Volker Stolz University of Oslo, Norway Carolyn Talcott SRI International, USA Emilio Tuosto University of Leicester, UK Additional Reviewers Adam, Ludwig Khamespanah, Ehsan Ardourel, Gilles Khosravi,Ramtin Bauer, Sebastian Kofron, Jan Baumeister, Hubert Komuravelli,Anvesh Bertolini, Cristiano Lang, Fr´ed´eric Blech, Jan Olaf Lepri, Daniela Chen, Zhenbang Lluch Lafuente, Alberto Choppy, Christine Loup, Ulrich Corzilius, Florian Malohlava, Michal Dan, Li Melgratti, Hernan Faber, Johannes Morisset, Charles Guanciale, Roberto Nellen, Johanna Helvensteijn, Michiel Ouederni, Meriem Henrio, Ludovic Pfaller, Christian H¨olzl, Florian Poch, Tomas Jaghoori,Mohammad Mahdi Ramalho, Franklin Jansen, Nils Rodrigues, Genaina Jezek, Pavel Sabouri, Hamideh Jongmans, Sung Schlatte, Rudolf Kemper, Stephanie Sch¨af, Martin Keznikl, Jaroslav Verdejo, Alberto Khakpour, Narges Vogler, Walter Khalil, Maged Table of Contents Taming Distributed System Complexity through Formal Patterns ...... 1 Jos´e Meseguer Composing Safe Systems.......................................... 3 John Rushby A Denotational Model for Component-BasedRisk Analysis............ 12 Gyrd Brændeland, Atle Refsdal, and Ketil Stølen Synthesis of HierarchicalSystems .................................. 42 Benjamin Aminof, Fabio Mogavero, and Aniello Murano A Modal Specification Theory for Components with Data ............. 61 Sebastian S. Bauer, Kim Guldstrand Larsen, Axel Legay, Ulrik Nyman, and Andrzej Wasowski (cid:2) Evaluating the Performance of Model Transformation Styles in Maude.......................................................... 79 Roberto Bruni and Alberto Lluch Lafuente Interactive Transformations from Object-Oriented Models to Component-Based Models......................................... 97 Dan Li, Xiaoshan Li, Zhiming Liu, and Volker Stolz Runtime Verification of Temporal Patterns for Dynamic Reconfigurations of Components ................................... 115 Julien Dormoy, Olga Kouchnarenko, and Arnaud Lanoix Timed Conformance Testing for Orchestrated Service Discovery........ 133 Jose Pablo Escobedo, Christophe Gaston, and Pascale Le Gall Realizability of Choreographies for Services Interacting Asynchronously.................................................. 151 Gregor G¨ossler and Gwen Salau¨n Networks of Real-Time Actors: Schedulability Analysis and Coordination .................................................... 168 Mohammad Mahdi Jaghoori, O´lafur Hlynsson, and Marjan Sirjani A FormalModelofObjectMobility inResource-RestrictedDeployment Scenarios ....................................................... 187 Einar Broch Johnsen, Rudolf Schlatte, and Silvia Lizeth Tapia Tarifa X Table of Contents The Logic of XACML ............................................ 205 Carroline Dewi Puspa Kencana Ramli, Hanne Riis Nielson, and Flemming Nielson A Proof Assistant Based Formalization of MDE Components .......... 223 Mounira Kezadri, Benoˆıt Combemale, Marc Pantel, and Xavier Thirioux Controlling an Iteration-Wise Coherence in Dataflow ................. 241 S´ebastien Limet, Sophie Robert, and Ahmed Turki Learning from Failures: A Lightweight Approach to Run-Time BehaviouralAdaptation .......................................... 259 Jos´e Antonio Mart´ın, Antonio Brogi, and Ernesto Pimentel Verifying Safety of Fault-Tolerant Distributed Components............ 278 Rab´ea Ameur-Boulifa, Raluca Halalai, Ludovic Henrio, and Eric Madelaine Reducing the Model Checking Cost of Product Lines Using Static Analysis Techniques.............................................. 296 Hamideh Sabouri and Ramtin Khosravi BigraphicalModelling of Architectural Patterns...................... 313 Alejandro Sanchez, Lu´ıs Soares Barbosa, and Daniel Riesco Coordinated Execution of Heterogeneous Service-OrientedComponents by Abstract State Machines ....................................... 331 Davide Brugali, Luca Gherardi, Elvinia Riccobene, and Patrizia Scandurra Verifying Temporal Properties of Use-Cases in Natural Language....... 350 Viliam Simko, David Hauzar, Tomas Bures, Petr Hnetynka, and Frantisek Plasil Author Index.................................................. 369 Taming Distributed System Complexity (cid:2) through Formal Patterns Jos´e Meseguer Universityof Illinois at Urbana-Champaign Many current and future distributed systems are or will be: – real-time and cyber-physical – probabilistic in their operating environments and/or their algorithms – safety-critical, with strong qualitative and quantitative formal requirements – reflective and adaptive, to operate in changing and potentially hostile envi- ronments. Theirdistributedfeatures,theiradaptationneeds,andtheirreal-timeandprob- abilisticaspectsmakesuchsystemsquite complexandhardtodesign,buildand verify, yet their safety-critical nature makes their verificationessential. One im- portantsourceofcomplexity,causingmanyunforeseendesignerrors,arisesfrom ill-understood and hard-to-test interactions between their different distributed components. Methods to tame and greatly reduce system complexity are badly needed. System complexity has many aspects, including the complexity and associated cost of: – designing – verifying – developing – maintaining and – evolving such systems. The main goal of this talk is to propose the use of formal patterns as a way of drastically reducing all the above system complexity aspects. By a ”formal pattern” I mean a solution to a commonly occurring problem that is: – asgenericas possible, withprecisesemantic requirementsforits parameters – formally specified – executable, and – comes with strong formal guarantees. (cid:2) PartiallysupportedbyNSFGrantCCF09-05584,AFOSRGrantFA8750-11-2-0084, and Boeing Grant C8088. F.ArbabandP.C.O¨lveczky(Eds.):FACS2011,LNCS7253,pp.1–2,2012. (cid:2)c Springer-VerlagBerlinHeidelberg2012 2 J. Meseguer This means that a formal pattern can be applied to a potentially infinite set of concrete instances, where each such instance is correct by construction and enjoys the formal guarantees ensured by meeting the semantic requirements of the pattern’s parameters. The overall vision is that distributed systems should be designed, verified, andbuiltbycomposingformalpatternsthatarehighlygenericandreusableand comewithstrongformalguarantees.Alargepartoftheverificationeffortisspent in an up-front, fully generic manner, and is then amortized across a potentially infinite number of instances. As I show through concrete examples, this can achieveverydrasticreductionsinallaspectsofsystemcomplexity,includingthe formalverificationaspect. Itcanleadto high-quality,highly reliabledistributed systems at a fraction of the cost required when not using such patterns. Todevelopformalpatternsfordistributedsystemswithfeaturessuchasthose mentionedaboveanappropriatesemantic frameworkis needed, one supporting: – concurrency – logical reflection – distributed reflection and adaptation – real time and probabilities – executability, and – formal verification methods. I use rewriting logic as such a semantic framework, and illustrate with several examples its adequacy to specify and verify formal patterns of this nature.