Engineering and theoretical underpinnings of retrenchment

Science of Computer Programming

Volumn 67, Issue 2-3, 2007, Pages 301-329

  Banach, R ^a   Poppleton, M ^b   Jeske, C ^a   Stepney, S ^c  

^a UNIVERSITY OF MANCHESTER   (United Kingdom)

^b UNIVERSITY OF SOUTHAMPTON   (United Kingdom)

^c UNIVERSITY OF YORK   (United Kingdom)

Author keywords

Digital redesign; Model evolution; Mondex purse; Refinement; Requirements engineering; Retrenchment; Simulation

Indexed keywords

COMPUTER SIMULATION; CONTROL THEORY; REQUIREMENTS ENGINEERING; RETREADING;

ADOPTION; DIGITAL REDESIGN; IMPLEMENTATION MECHANISM; MODEL EVOLUTION; MONDEX PURSE; SCENARIOS;

UNDERPINNINGS;

EID: 34250785707     PISSN: 01676423     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.scico.2007.04.002     Document Type: Article

References (148)

1. Abadi M., and Lamport L. The existence of refinement mappings. Theoret. Comput. Sci. 82 (1991) 253-284
2. Abrial J.R. The B-Book (1996), Cambridge University Press
3. Abrial J.R. Event based sequential program development: application to constructing a pointer program. In: Mandrioli D., Araki H., and Gnesi S. (Eds). Proc. FM-03. LNCS vol. 2805 (2003), Springer 51-74
4. J.R. Abrial, B. Event, Cambridge University Press, 2007 (to appear)
5. Abrial J.R., Cansell D., and Méry D. Refinement and reachability in event-B. In: Treharne H., King S., Henson M., and Schneider S. (Eds). Proc. ZB-05. LNCS vol. 3455 (2005), Springer 222-241
6. Alur R., and Dill D. A theory of timed automata. Theoret. Comput. Sci. 126 (1994) 183-235
7. In: Alur R., Henzinger T., and Sontag E. (Eds). Hybrid Systems III: Verification and Control. LNCS vol. 1066 (1996), Springer
8. In: Alur R., and Pappas G. (Eds). Hybrid Systems: Computation and Control. LNCS vol. 2993 (2004), Springer
9. Andrews B. An Introduction to Mathematical Logic and Type Theory: To Truth Through Proof (1986), Academic Press
10. Back R.J.R. On correct refinement of programs. J. Comp. Sys. Sci. 23 (1981) 49-68
11. Back R.J.R. A calculus of refinements for program derivations. Acta Inf. 25 (1988) 593-624
12. Back R.J.R., and Kurki-Suonio R. Decentralisation of process nets with centralised control. Proc. 2nd ACM SIGACT-SIGOPS Symp. on Princ. Dist. Comp. (1983), ACM 131-142
13. Back R.J.R., and Sere K. Superposition refinement of reactive systems. Form. Asp. Comp. 8 (1996) 324-346
14. Back R.J.R., and von Wright J. Refinement calculus Part I: Sequential nondeterministic programs. In: de Roever W.-P., and Rozenberg G. (Eds). Proc. REX Workshop, Stepwise Refinement of Distributed Systems. LNCS vol. 430 (1989), Springer 42-66
15. Back R.J.R., and von Wright J. Refinement Calculus, A Systematic Introduction (1998), Springer
16. In: Bajard J.-C., Frougny C., Kornerup P., and Muller J.-M. (Eds). Proc. Fourth Conference on Real Numbers and Computers. Schloss Dagstuhl, Germany, Dagstuhl Conference No. 00162, DMTCS (2000), Springer
17. R. Banach, Maximally abstract retrenchments, in: Proc. IEEE ICFEM-00, 2000, pp. 133-142
18. R. Banach, Retrenchment and System Properties, 2003 (submitted for publication)
19. Banach R., and Bozzano M. Retrenchment, and the generation of fault trees for static, dynamic and cyclic systems. Proc. SAFECOMP-06. LNCS vol. 4166 (2006), Springer 127-141
20. Banach R., and Cross R. Safety requirements and fault trees using retrenchment. Proc. SAFECOMP-04. LNCS vol. 3219 (2004), Springer 210-223
21. R. Banach, C. Jeske, Stronger Compositions for Retrenchments, and Feature Engineering (2002) (submitted for publication)
22. R. Banach, C. Jeske, M. Poppleton, Composition Mechanisms for Retrenchments (2004) (submitted for publication)
23. Banach R., and Poppleton M. Retrenchment: An engineering variation on refinement. In: Bert D. (Ed). Proc. B-98. LNCS vol. 1393 (1998), Springer 129-147. http://www.cs.man.ac.uk/cstechrep See also: UMCS Tech. Rep. UMCS-99-3-2
24. Banach R., and Poppleton M. Retrenchment and punctured simulation. In: Araki H., Gallway A., and Taguchi K. (Eds). Proc. IFM-99 (1999), Springer 457-476
25. Banach R., and Poppleton M. Sharp retrenchment, modulated refinement and punctured simulation. Form. Asp. Comp. 11 (1999) 498-540
26. Banach R., and Poppleton M. Retrenchment, refinement and simulation. In: Bowen J., Dunne S., Galloway A., and King S. (Eds). Proc. ZB00. LNCS vol. 1878 (2000), Springer 304-323
27. R. Banach, M. Poppleton, Fragmented retrenchment, concurrency and fairness, in: Proc. IEEE ICFEM-00, 2000, pp. 143-151
28. R. Banach, M. Poppleton, Model based engineering of specifications by retrenching partial requirements, in: Proc. IEEE MBRE-01, 2001, pp. 1-8
29. Banach R., and Poppleton M. Retrenching partial requirements into system definitions: A simple feature interaction case study. Req. Eng. J. 8 (2003) 266-288
30. Banach R., Poppleton M., Jeske C., and Stepney S. Retrenching the purse: Finite sequence numbers, and the tower pattern. In: Fitzgerald J., Hayes I., and Tarlecki A. (Eds). Proc. FM-05. LNCS vol. 3582 (2005), Springer 382-398
31. R. Banach, C. Jeske, M. Poppleton, S. Stepney, Retrenching the purse: finite exception logs, and validating the small, in: Proc. IEEE/NASA SEW30-06, 2006
32. R. Banach, C. Jeske, M. Poppleton, S. Stepney, Retrenching the purse: Hashing injective CLEAR codes, and security properties, in: Proc. IEEE ISOLA-06, 2006 (in press)
33. Banach R., Poppleton M., Jeske C., and Stepney S. Retrenching the purse: The Balance enquiry quandary, and generalised and (1,1) forward refinements. Fund. Inf. 77 (2007) 29-69
34. Barroca L.M., and McDermid J.A. Formal methods: Use and relevance for the development of safety-critical systems. Comput. J. 35 (1992) 579-599
35. Blikle A. The clean termination of iterative programs. Acta Inf. 16 (1981) 199-217
36. Börger E. Why use evolving algebras for hardware and software engineering?. In: Bartosek M., Staudek J., and Wiedermann J. (Eds). Proc. SOFSEM-95. LNCS vol. 1012 (1995), Springer 236-271
37. In: Börger E. (Ed). Specification and Validation Methods (1995), Oxford University Press
38. Börger E. High level system analysis and design using abstract state machines. In: Hutter D., Stephan W., Traverso P., and Ullmann M. (Eds). Proc. FM-Trends-98. LNCS vol. 1641 (1999), Springer 1-43
39. Börger E., and Schulte W. A programmer friendly modular definition of the semantics of java. In: Alves-Foss J. (Ed). Formal Syntax and Semantics of Java. LNCS vol. 1523 (1998), Springer 353-404
40. Börger E., and Schulte W. Modular design for the java virtual machine. In: Börger (Ed). Architecture Design and Validation Methods (2000), Springer 297-357
41. Börger E., and Stärk R. Abstract State Machines (2003), Springer
42. E. Boiten, J. Derrick, IO-Refinement in Z, in: Proc. Third BCS-FACS Northern Formal Methods Workshop, Ilkley, UK, B.C.S., 1998. http://www.ewic.org.uk/ewic/workshop/view.cfm/NFM-98
43. Boiten E., and Derrick J. Grey box data refinement. In: Grundy J., Schwenke M., and Vickers T. (Eds). Proc. IRW&FMPacific-98. Disc. Maths. and Theor. Comp. Sci. (1998), Springer 45-59
44. Brinksma E., Scollo G., and Steenbergen C. LOTOS specifications, their implementations and their tests. In: Sarikaya B., and Bochmann G. (Eds). Proc. IFIP Protocol Specification, Testing and Verification (PSTV6) (1987), Elsevier, North-Holland 349-360
45. Brinksma E. A theory for the derivation of tests. In: Aggarwal S., and Sabnani K. (Eds). Proc. IFIP Protocol Specification, Testing and Verification (PSTV-8) (1988), Elsevier, North-Holland 63-74
46. Broy M., and Wirsing M. Partial abstract types. Acta Inf. 18 (1982) 47-64
47. Broy M., and Wirsing M. Generalised heterogeneous algebras and partial interpretations. In: Gruska J., Rovan B., and Wiedermann J. (Eds). Proc. CAAP-83. LNCS vol. 233 (1983), Springer 29-43
48. Broy M. Partial interpretations of higher order algebraic types. In: Ausiello, and Protasi (Eds). Proc. MFCS-86. LNCS vol. 159 (1986), Springer 1-34
49. Broy M., and Stølen K. Specification and Development of Interactive Systems (2001), Springer
50. J.A. Clark, S. Stepney, H. Chivers, Breaking the model: Finalisation and a taxonomy of security attacks, Technical Report YCS-2004-371, University of York, 2004
51. Coleman D., and Hughes J.W. The clean termination of pascal programs. Acta Inf. 11 (1979) 195-210
52. Crocker D. Safe object-oriented software: The verified design-by-contract paradigm. In: Redmill, and Anderson (Eds). Proc. Twelfth Safety-Critical Systems Symposium (2004), Springer 19-41. http://www.eschertech.com/papers See also
53. Derrick J., and Boiten E. Refinement in Z and Object-Z, Foundations and Advanced Applications (2001), FACIT, Springer
54. Derrick J., and Boiten E. Relational concurrent refinement. Form. Asp. Comp. 15 (2003) 182-214
55. Derrick J., Bowman H., Boiten E., and Steen M. Comparing LOTOS and Z refinement relations. Proc. FORTE/PSTV-9 (1996), Chapman and Hall 501-516
56. de Roever W.-P., de Boer F., Hannemann U., Hooman J., Lakhnech Y., Poel M., and Zwiers J. Concurrency Verification (2001), Cambridge University Press
57. de Roever W.-P., and Engelhardt K. Data Refinement: Model-Oriented Proof Methods and their Comparison (1998), Cambridge University Press
58. In: Di Benedetto M.D., and Sangiovanni-Vincentelli A. (Eds). Hybrid Systems: Computation and Control. LNCS vol. 2034 (2001), Springer
59. Dijkstra E.W. Notes on structured programming. Structured Programming (1972), Academic Press
60. Dijkstra E.W., and Scholten C.S. Predicate Calculus and Program Semantics (1990), Springer
61. Doornbos H. A relational model of programs without the restriction to egli-milner constructs. In: Olderog E.-R. (Ed). Proc. PROCOMET-94 (1994), IFIP 357-376
62. D.T.I. Information Technology Security Evaluation Criteria Department of Trade and Industry. 1991. http://www.cesg.gov.uk/site/iacs/itsec/media/formal-docs/Itsec.pdf
63. S. Dunne, A case for general correctness. Sch. Comp. Math. Univ. Teeside Preprint, 2001
64. S. Dunne, Recasting Hoare and He's Relational theory of programs in the context of general correctness, in: A. Butterfield, G. Strong, C. Pahl (Eds.), Proceedings of the 5th Irish Workshop in Formal Methods, IWFM 2001, Workshops in Computing, British Computer Society, 2001. http://ewic.bcs.org/conferences/2001/5thformal/papers
65. S. Dunne, A. Galloway, B. Stoddart, Specification and Refinement in General Correctness, in: Proc. Third BCS-FACS Northern Formal Methods Workshop, Ilkley, U K, B.C.S., 1998 http://www.ewic.org.uk/ewic/workshop/view.cfm/NFM-98
66. Ehrig H., and Grosse-Rhode M. Functorial theory of parameterised specifications in generalised specification frameworks. Theoret. Comput. Sci. 135 (1994) 221-266
67. Ehrig H., and Mahr B. Fundamentals of Algebraic Specification I (1985), Springer
68. Ehrig H., and Mahr B. Fundamentals of Algebraic Specification II (1990), Springer
69. Fiadeiro J., and Maibaum T. Categorical semantics of parallel program. Design. Sci. Comp. Prog. 28 (1997) 111-138
70. Fitzgerald J., and Larsen P.G. Modelling Systems: Practical Tools and Techniques in Software Development (1998), Cambridge University Press
71. Fleuriot J. A Combination of Geometry Theorem Proving and Nonstandard Analysis, with Application to Newton's Principia (2001), Springer Also Ph.D. Thesis, Cambridge University Computing Laboratory 1999, see also Cambridge University Computing Laboratory Technical Report No. 442
72. Francez N., and Forman I.R. Superimposition for interactive processes. In: Baeten J., and Klop J.-W. (Eds). Proc. CONCUR-90. LNCS vol. 458 (1990), Springer 230-245
73. Franklin M.L., Powell G.F., and Workman J.D. Digital Control of Dynamic Systems (1998), Addison Wesley Longman
74. Goguen J.A., and Meseguer J. Order-sorted algebra I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations. Theoret. Comput. Sci. 105 (1992) 217-273
75. Harrison J.R. Theorem Proving with the Real Numbers (1998), Springer Also Ph.D. Thesis, Cambridge University Computing Laboratory 1996, also Cambridge University Computing Laboratory Technical Report No. 408
76. Hayes I.J. Specification Case Studies. 2nd ed. (1993), Prentice-Hall
77. Hayes I.J., and Sanders J.W. Specification by interface separation. Form. Asp. Comp. 7 (1995) 430-439
78. Hehner E.C.R. A Practical Theory of Programming (1993), Springer
79. Hentzinger T., and Sastry S. Hybrid Systems: Computation and Control. LNCS vol. 1386 (1998), Springer
80. Hildebrand F.B. Advanced Calculus for Applications (1962), Prentice-Hall
81. Hoare C.A.R. Proof of correctness of Data representations. Acta Inf. 1 (1972) 271-281
82. Hoare C.A.R., and Jifeng H. Unifying Theories of Programming (1998), Prentice-Hall
83. Hodges W. Model Theory (1993), Cambridge University Press
84. International Standards Organisation, Common Criteria for Information Security Evaluation, ISO 15408, v. 3.0 rev. 2, 2005
85. Jeffreys H., and Jeffreys B.S. Methods of Mathematical Physics. 3rd ed. (1956), Cambridge University Press
86. C. Jeske, Algebraic integration of retrenchment and refinement, Ph.D. Thesis, Manchester University, Department of Computer Science, 2005
87. Jeske C., and Banach R. Minimally and maximally abstract retrenchments. In: Butler M., Petre L., and Sere K. (Eds). Proc. IFM-02. LNCS vol. 2335 (2002), Springer 380-399
88. Jones C.B. Tentative steps towards a development method for interfering programs. ACM Trans. Prog. Lang. Sys. 5 (1983) 596-619
89. Jones C.B. Systematic Software Development Using VDM. 2nd ed. (1990), Prentice-Hall
90. Jones C.B., and Shaw R.C. Case Studies in Systematic Software Development (1990), Prentice-Hall
91. Kamin S., and Archer M. Partial implementations of abstract data types: A dissenting view. In: Kahn G., MacQueen D., and Plotkin G. (Eds). Proc. Semantics of Data Types. LNCS vol. 173 (1984), Springer 317-336
92. Katz S. A superimposition control construct for distributed systems. ACM Trans. Prog. Lang. Sys. 15 (1993) 337-356
93. In: Krogh B., and Lynch N. (Eds). Hybrid Systems: Computation and Control. LNCS vol. 1790 (2000), Springer
94. Kuo B.C. Digital Control Systems. 2nd ed. (1992), Oxford University Press
95. Lamport L. A simple approach to specifying concurrent systems. Comm. ACM 32 (1989) 32-45
96. Lamport L. A temporal logic of actions. ACM Trans. Prog. Lang. Sys. 16 (1994) 872-923
97. Lano K., and Haughton H. Specification in B: An Introduction Using the B-Toolkit (1996), Imperial College Press
98. Lester D. Using PVS to validate the inverse trigonometric functions of an exact arithmetic. In: Alt R., Frommer A., Kearfott R., and Luther W. (Eds). Numerical Software with Result Verification. LNCS vol. 2991 (2003), Springer 259-273
99. Liskov B., and Wing J.M. A behavioural notion of subtyping. ACM Trans. Prog. Lang. Sys. 16 (1994) 1811-1841
100. Liu S. Evolution: A More practical approach than refinement for software development. Proc. ICECCS-97 (1997), IEEE 142-151
101. B. Mahony, The specification and refinement of timed processes, Ph.D. Thesis, Dept. of Computer Science, Queensland University, 1992
102. In: Maler O. (Ed). Hybrid and Real-Time Systems. LNCS vol. 1201 (1997), Springer
103. In: Maler O., and Pnueli A. (Eds). Hybrid Systems: Computation and Control. LNCS vol. 2623 (2003), Springer
104. Manna Z., and Pnueli A. The Temporal Logic of Reactive and Concurrent Systems: Specification (1992), Springer
105. Meyer B. Object Oriented Construction (1988), Prentice-Hall
106. Miarka R., Boiten E., and Derrick J. Guards, preconditions and refinement in Z. In: Bowen J., Dunne S., Galloway A., and King S. (Eds). Proc. ZB-00. LNCS vol. 1878 (2000), Springer 286-303
107. Mikhajlova A., and Sekerinski E. Class refinement and interface refinement in object-oriented programs. In: Fitzgerald J., Jones C., and Lucas P. (Eds). Proc. FME-97. LNCS vol. 1313 (1997), Springer 82-101
108. Morgan C. Programming from Specifications. 2nd ed. (1994), Prentice-Hall
109. Morris J.M. A theoretical basis for stepwise refinement and the programming calculus. Sci. Comp. Prog. 9 (1987) 287-306
110. Morris J.M., and Bunkenburg A. Partiality and nondeterminacy in program proofs. Form. Asp. Comp. 10 (1998) 76-96
111. J.M. Morris, A. Bunkenburg, Term transformer semantics, ACM Trans. Prog. Lang. Sys. (2000) (submitted for publication)
112. Munoz C., and Lester D. Real number calculations and theorem proving. In: Hurd J., and Melham T. (Eds). TPHOLs05. LNCS vol. 3603 (2005), Springer 195-210
113. Nielsen M., Havelund K., Wagner K.R., and George C. The RAISE language method and tools. Form. Asp. Comp. 1 (1989) 85-114
114. D.S. Neilson, From Z to C: Illustration of a rigorous development Method, Ph.D. Thesis, Oxford University Computing Laboratory Programming Research Group, Technical Monograph PRG-101, 1990
115. Nelson G. A generalisation of Dijkstra's calculus. ACM Trans. Prog. Lang. Sys. 11 (1989) 517-561
116. O. Owe, An Approach to Program Reasoning Based on a First Order Logic for Partial Functions, University of Oslo Institute of Informatics Research Report No. 89, ISBN: 82-90230-88-5, 1985
117. Owe O. Partial logics reconsidered: a conservative approach. Form. Asp. Comp. 3 (1993) 1-16
118. M.R. Poppleton, Formal Methods for Continuous Systems: Liberalising Refinement in B, Ph.D. Thesis, Manchester University, Department of Computer Science, 2001
119. M.R. Poppleton, R. Banach, Retrenchment: Extending the reach of refinement, in: Proc. IEEE ASE-99, 1999, pp. 158-165
120. M.R. Poppleton, R. Banach, Retrenchment: Extending Refinement for Continuous and Control Systems, in: Proc. IWFM-00, 2000, 26pp., http://ewic.org.uk/ewic/workshop/view.cfm/IWFM-00
121. Poppleton M.R., and Banach R. Controlling control systems: An application of evolving retrenchment. In: Bert D. (Ed). Proc. BZ-02. LNCS vol. 2272 (2002), Springer 42-61
122. Retrenchment Homepage; http://www.cs.man.ac.uk/retrenchment
123. RODIN. The RODIN Project. Rigorous Open Development Environment for Complex Systems, 2004 http://rodin.cs.ncl.ac.uk/index.html
124. Sambin G. In: Skordev D. (Ed). Intuitionistic Formal Spaces-a First Communication. Mathematical Logic and its Applications (1987), Plenum, New York 187-204
125. Sambin G., and Gebellato S. A preview of the basic picture: A new perspective on formal topology. In: Altenkirch T., Naraschewski W., and Reus B. (Eds). Proc. TYPES-98. LNCS vol. 1657 (1999), Springer 194-207
126. G. Schellhorn, Verification of abstract state machines, Ph.D. Thesis, University of Ulm Fakultät für Informatik, 1999
127. Schellhorn G. Verification of ASM refinements using generalized forward simulation. JUCS 7 (2001) 952-979
128. Schneider F.B. On Concurrent Programming (1997), Springer
129. Sekerinski E., and Sere K. Program Development by Refinement: Case Studies Using the B Method (1998), Springer
130. Smith G. Stepwise development from ideal specifications. Proc. IEEE ACSC-00. Aus. Comp. Sci. Comm. 22 (2000) 227-233
131. Smith G., and Fidge C. Incremental development of real-time requirements: The light control case study. JUCS 6 (2000) 704-730
132. Spivey J.M. The Z Notation: A Reference Manual. 2nd ed. (1993), Prentice-Hall
133. Srinivas Y.V., and Jullig R. Specware(TM): Formal support for composing software. In: Moller B. (Ed). Proc. MPC-95. LNCS vol. 947 (1995), Springer 399-422. http://www.kestrel.edu Also: Kestrel Institute Technical Report KES.U.94.5
134. Stärk R., Schmid J., and Börger E. Java and the Java Virtual Machine, Definition, Verification, Validation (2001), Springer
135. Stepney S., Cooper D., and Woodcock J. More powerful Z data refinement: Pushing the state of the art in industrial refinement. In: Bowen J., Fett A., and Hinchey M. (Eds). Proc. ZUM-98. LNCS vol. 1493 (1998), Springer 284-307
136. S. Stepney, D. Cooper, J. Woodcock, An electronic purse: specification, refinement and proof, Technical Report PRG-126, Oxford University Computing Laboratory, 2000
137. Strulo B. How firing conditions help inheritance. In: Bowen J., and Hinchey M. (Eds). Proc. ZUM-95. LNCS vol. 967 (1996), Springer 264-275
138. Swartout W., and Balzer R. On the inevitable intertwining of specification and implementation. Comm. ACM 25 (1982) 438-440
139. Vaandrager F., and van Schuppen J. Hybrid Systems: Computation and Control. LNCS vol. 1569 (1999), Springer
140. van Dalen D. Logic and Structure. 3rd ed. (1997), Springer
141. van Eijk P.H.J., Vissers C.A., and Diaz M. The Formal Specification Technique LOTOS (1989), Elsevier, North Holland
142. Waldinger R., Blaine L., Spinoza D., Gilham L.-M., Goldberg A., Green C., Jullig R., Liu J., McDonald J., Smith D.R., Srinavas Y.V., Wang T.C., and Westfold S. Specware Language Manual (1998), Kestrel Institute. http://www.kestrel.edu
143. Wehrheim H. Behavioral subtyping relations for active objects. Form. Methods Syst. Des. 23 (2003) 143-170
144. Weihrauch K. An Introduction to Computable Analysis (2000), Springer
145. Wirth N. The development of programs by stepwise refinement. Comm. ACM 14 (1971) 221-227
146. Woodcock J., and Davies J. Using Z: Specification, Refinement, and Proof (1996), Prentice-Hall
147. Wordsworth J.B. Software Engineering with B (1996), Addison-Wesley
148. von Wright J. The lattice of data refinement. Acta Inf. 31 (1994) 105-135