Zhiming Liu Jim Woodcock Huibiao Zhu (Eds.) Theories of Programming and Formal Methods Festschrift LNCS 8051 Essays Dedicated to Jifeng He on the Occasion of His 70th Birthday 123 www.it-ebooks.info Lecture Notes in Computer Science 8051 Commenced Publication in 1973 Founding and Former Series Editors: Gerhard Goos, Juris Hartmanis, and Jan van Leeuwen Editorial Board David Hutchison Lancaster University, UK Takeo Kanade Carnegie Mellon University, Pittsburgh, PA, USA Josef Kittler University of Surrey, Guildford, UK Jon M. Kleinberg Cornell University, Ithaca, NY, USA Alfred Kobsa University of California, Irvine, CA, USA Friedemann Mattern ETH Zurich, Switzerland John C. Mitchell Stanford University, CA, USA Moni Naor Weizmann Institute of Science, Rehovot, Israel Oscar Nierstrasz University of Bern, Switzerland C. Pandu Rangan Indian Institute of Technology, Madras, India Bernhard Steffen TU Dortmund University, Germany Madhu Sudan Microsoft Research, Cambridge, MA, USA Demetri Terzopoulos University of California, Los Angeles, CA, USA Doug Tygar University of California, Berkeley, CA, USA Gerhard Weikum Max Planck Institute for Informatics, Saarbruecken, Germany www.it-ebooks.info Zhiming Liu JimWoodcock HuibiaoZhu (Eds.) Theories of Programming and Formal Methods Essays Dedicated to Jifeng He on the Occasion of His 70th Birthday 13 www.it-ebooks.info Volume Editors Zhiming Liu United Nations University International Institute for Software Technology P.O. Box 3058, Macau, China E-mail: z.liu@iist.unu.edu Jim Woodcock University of York, Department of Computer Science Deramore Lane, York YO10 5GH, UK E-mail: jim@cs.york.ac.uk Huibiao Zhu East China Normal University, Software Engineering Institute 3663 Zhongshan Road (North), Shanghai 200062, China E-mail: hbzhu@sei.ecnu.edu.cn ISSN 0302-9743 e-ISSN 1611-3349 ISBN 978-3-642-39697-7 e-ISBN 978-3-642-39698-4 DOI 10.1007/978-3-642-39698-4 Springer Heidelberg Dordrecht London New York Library of Congress Control Number: 2013943015 CR Subject Classification (1998): F.3, D.2.4, D.2, F.1, F.4, D.3, I.6 LNCS Sublibrary: SL 1 – Theoretical Computer Science and General Issues © Springer-Verlag Berlin Heidelberg 2013 This work is subject to copyright. All rights are reserved by the Publisher, whether the whole or part of the 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 storage and retrieval, electronic adaptation, computer software, or by similar or dissimilar methodology now known or hereafter developed. Exempted from this legal reservation are brief excerpts in connection with reviews or scholarly analysis or material supplied specifically for the purpose of being entered and executedon a computersystem, forexclusiveuse bythe purchaser ofthe work. Duplicationofthis publication or parts thereof is permitted only under the provisions of the Copyright Law of the Publisher’s location, in ist current version, and permission for use must always be obtained from Springer. Permissions for use may be obtained through RightsLink at the Copyright Clearance Center.Violations are liable to prosecution under the respective Copyright Law. The use of general descriptive names, registered names, trademarks, service marks, etc. in this publication does not imply, even in the absence of a specific statement, that such names are exempt from the relevant protective laws and regulations and therefore free for general use. While the advice and information in this book are believed to be true and accurate at the date of publication, neither the authors nor the editors nor the publisher can accept any legal responsibility for any errors or omissions that may be made. The publisher makes no warranty, express or implied, with respect to the material contained herein. Typesetting: Camera-ready by author, data conversion by Scientific Publishing Services, Chennai, India Printed on acid-free paper Springer is part of Springer Science+Business Media (www.springer.com) www.it-ebooks.info Jifeng He www.it-ebooks.info Foreword Jifeng He is an outstanding computer scientist. He was born on August 5, 1943, in Shanghai, China. In his long academic career, he has made significant and wide-ranging contributions to the theories of programming and formal software engineering methods. To celebrate his 70th birthday, we present three LNCS volumes in his honor. • Theories of Programming and Formal Methods. Essays Dedicated to Jifeng He on the Occasion of His 70th Birthday. Papers presented at a symposium held in Shanghai, September 1–3, 2013. LNCS volume 8051, Springer 2013. • Unifying Theories of Programming and Formal Engineering Methods.Inter- national Training School on Software Engineering, Shanghai, China, August 26–30, 2013. Advanced Lectures, LNCS volume 8050, Springer 2013. • Theoretical Aspects of Computing – ICTAC 2013. The 10th International Colloquium, Shanghai, China, September 4–6, 2013. Proceedings, LNCS vol- ume 8049, Springer 2013. He Jifeng is known for his seminal work in the theories of programming and formal methods for software engineering. He is particularly associated with Uni- fying Theories of Programming (UTP), the theory of data refinement and the laws of programming, and the rCOS formal method for object and component system construction. His book on UTP with Tony Hoare has been widely read and followed by a large number of researchers, and it has been used in many postgraduate courses. He was a senior researcher at Oxford during 1984-1998, and then a senior research fellow at the United Nations University Interna- tional Institute for Software Technology (UNU-IIST) in Macau during 1998- 2005. He has been a professor and is currently the Dean of the Institute of Software Engineering at East China Normal University, Shanghai, China. He was a founder of the International Conference of Formal Engineering Methods (ICEFM), the International Colloquium on Theoretical Aspects of Computing (ICTAC), and the International Symposium on Theoretical Aspects of Software Engineering (TASE). In 2005, He Jifeng was elected as an academician of the Chinese Academy of Sciences. He also received an honorary doctorate from the University of York. He has won a number of prestigious science and technology awards, including the second prize of the Natural Science Award from the State Council of China, the first prize of the Natural Science Award from the Ministry of Education of China, the first prize of Technology Innovation from the Ministry of Electronic Industry, and a number awards from Shanghai government. www.it-ebooks.info VIII Foreword We, the three organizers of the celebration events, have all worked with He Jifeng. We thank him for his years of generous, wise advice to us and to his many other colleagues, students, and friends. He has been constantly energetic, inspiring, enthusiastic, and encouraging. We wish him a happy birthday. June 2013 Zhiming Liu Jim Woodcock Huibiao Zhu www.it-ebooks.info Organization Program Chairs Zhiming Liu UNU-IIST, Macau SAR, China Jim Woodcock University of York, UK Huibiao Zhu East China Normal University, China Local Organization Mingsong Chen, Jian Guo, Xiao Liu, Geguang Pu, Fu Song, Min Zhang East China Normal University www.it-ebooks.info Table of Contents Set-Theoretic Models of Computations 1 Jean-Raymond Abrial Model-Based Mutation Testing of Reactive Systems: From Semantics to Automated Test-Case Generation 23 Bernhard K. Aichernig Pliant Modalities in Hybrid Event-B 37 Richard Banach A Relational Approach to an Algebraic Community: From Paul Erd˝os to He Jifeng 54 Jonathan P. Bowen Practical Theory Extension in Event-B 67 Michael Butler and Issam Maamria Simulink Timed Models for Program Verification 82 Ana Cavalcanti, Alexandre Mota, and Jim Woodcock Concept Analysis Based Approach to Statistical Web Testing 100 Chao Chen, Huaikou Miao, and Yihai Chen Algebraic Program Semantics for Supercomputing 118 Yifeng Chen Modeling and Specification of Real-Time Interfaces with UTP 136 Hung Dang Van and Hoang Truong Some Fixed-Point Issues in PPTL 151 Zhenhua Duan, Qian Ma, Cong Tian, and Nan Zhang The Value-Passing Calculus 166 Yuxi Fu Proving Safety of Traffic Manoeuvres on Country Roads 196 Martin Hilscher, Sven Linker, and Ernst-R¨udiger Olderog Generic Models of the Laws of Programming 213 Tony Hoare Ours Is to Reason Why 227 Cliff B. Jones, Leo Freitas, and Andrius Velykis www.it-ebooks.info XII Table of Contents Optimal Bounds for Multiweighted and Parametrised Energy Games 244 Line Juhl, Kim Guldstrand Larsen, and Jean-Fran¸cois Raskin On the Relationship between LTL Normal Forms and B¨uchi Automata 256 Jianwen Li, Geguang Pu, Lijun Zhang, Zheng Wang, Jifeng He, and Kim Guldstrand Larsen Managing Environment and Adaptation Risks for the Internetware Paradigm 271 Jian L¨u, Yu Huang, Chang Xu, and Xiaoxing Ma Safety versus Security in the Quality Calculus 285 Hanne Riis Nielson and Flemming Nielson Invariants Synthesis over a Combined Domain for Automated Program Verification 304 Shengchao Qin, Guanhua He, Wei-Ngan Chin, and Hongli Yang Slow Abstraction via Priority 326 A.W. Roscoe and Philippa J. Hopcroft Performance Estimation Using Symbolic Data 346 Jian Zhang Synthesizing Switching Controllers for Hybrid Systems by Generating Invariants 354 Hengjun Zhao, Naijun Zhan, and Deepak Kapur Graph-Based Object-Oriented Hoare Logic 374 Liang Zhao, Shuling Wang, and Zhiming Liu Towards a Modeling Language for Cyber-Physical Systems 394 Longfei Zhu, Yongxin Zhao, Huibiao Zhu, and Qiwen Xu Author Index 413 www.it-ebooks.info [...]... Recursion, and Unbounded Choice Cambridge University Press (1992) 11 Hoare, T.: Programs are Predicates Mathematical Logic and Programming Languages Prentice-Hall (1985) 12 Hoare, T., He, J.: Unifying Theories of Programming Prentice-Hall (1998) 13 Hoare, T.: An Axiomatic Basis for Computer Programming CACM (1969) 14 Jones, C.: Program Specification and Validation in VDM Logic of Programming and Calculi of. .. on Programming Languages and Systems (1988) 16 Morgan, C.: Programming from Specification Prentice-Hall (1990) 17 Morgan, C.: Of wp and CSP In: Beauty is our Business Springer (1990) 18 Morris, J.: A Theoretical Basis for Stepwise Refinement and the Programming Calculus Science of Computer Programming (1987) 19 Nelson, G.: A Generalization of Dijkstra’s Calculus ACM TOPLAS (1989) 20 Rodin: Event-B and. ..Set-Theoretic Models of Computations Jean-Raymond Abrial Marseille, France jrabrial@neuf.fr Abstract The purpose of this paper is to present some set-theoretic models of computation This topic and its usefulness are clearly related to those presented in the book by Hoare and He: “Unifying Theories of Programming [12] However, we prefer to use here the term “computation” to that of programming as our... 2 (Mutation of Models) Consider the UML diagram of a car alarm system in Figure 2 From the initial state OpenAndUnlocked one can traverse to ClosedAndLocked by closing all doors and locking the car Actions of closing, opening, locking, and unlocking are modelled by corresponding signals Close, Open, Lock, and Unlock The alarm system is armed after 20 seconds in ClosedAndLocked Upon entry of the Armed... System and Software Engineering Cambridge University Press (2010) 20 J.-R Abrial 3 Back, R.: On the Correctness of Refinement Steps in Program Development Technical Report University of Helsinki (1978) 4 Back, R., Kurki-Suonio, R.: Distributed Cooperation with Action Systems ACM Transaction on Programming Languages and Systems 10(4), 513–554 (1988) 5 Dijkstra, E.: Guarded Commands, Nondeterminacy and Formal. .. easy proofs are left to the reader We only give here the proof for the iteration combinator: S1 S2 ⇒ S1 S2 (45) Let F 1 and F 2 be the set transformers of S1 and S2 We have to prove: ∀q · F 1(q) ⊆ F 2(q) ⇒ (∀q · fix(q | F 1) ⊆ fix(q | F 2)) Proof ∀q · F 1(q) ⊆ F 2(q) HYP1 fix(q | F 1) ⊆ fix(q | F 2) ⇐ According to Theorem 1 of Appendix 1 (q | F 1)(fix(q | F 2)) ⊆ fix(q | F 2) ⇔ According to Theorem 2 of Appendix... limitation of size for such a paper: more proofs (notice again that all important mentioned proofs were mechanically checked with the prover of the Rodin Platform [20]), more appendices could have been written in order to ease the reading and make the paper self-contained, more results concerning infinite iterations and modalities, more explanations on the various combinators of section 2.4, and so on... is not so much to unify various ways of programming (using different programming languages) but rather to see how various mechanical computation paradigms (be they sequential, distributed, parallel, and so on) can be given a unified mathematical theory Our purpose is also to study how these computations can be specified and then developed by means of refinements and proofs 1 Introduction This study is clearly... to Theorem 2 of Appendix 1 F (F (q) ∪ F (q)) ∩ (q | F )(FIX(q | F )) ⊆ F ⇔ (q) According to Definitions (18) and (19) F (F (q) ∪ F (q)) ∩ q ∩ F (F (q)) ⊆ F ⇔ (q) According to (5) q ∩ F (F (q) ∩ F (q)) ⊆ F ⇔ (q) According to (18), (19), and Theorem 5 of Appendix 1 (q|F )(F (q)) ⊆ F (q) ⇔ F (q) According to Definition (19) According to (18) and Theorem 6 of Appendix 1 (q) ⊆ F (q) End of Proof It remains... thus replace p in what follows by expanding its definition, yielding; = p {q | p ∩ r−1 [q] ⊆ q} r)−1 [l] and we have to prove l = ∅ The proof is by contraWe assume l ⊆ (p diction We assume thus x ∈ l for some x and we want to derive a contradiction The proof is left to the reader Relation of the Abstract Iteration By translating equation (21) in terms of the relations r and r we obtain the following fixpoint . the theories of programming and formal methods for software engineering. He is particularly associated with Uni- fying Theories of Programming (UTP), the theory of data refinement and the laws of. and wide-ranging contributions to the theories of programming and formal software engineering methods. To celebrate his 70th birthday, we present three LNCS volumes in his honor. • Theories of. Zhiming Liu Jim Woodcock Huibiao Zhu (Eds.) Theories of Programming and Formal Methods Festschrift LNCS 8051 Essays Dedicated to Jifeng He on the Occasion of His 70th Birthday 123 www.it-ebooks.info Lecture