Retrenching the purse: Finite sequence numbers, and the Tower Pattern

Lecture Notes in Computer Science

Volumn 3582, Issue , 2005, Pages 382-398

  Banach, Richard ^a   Poppleton, Michael ^b   Jeske, Czeslaw ^a   Stepney, Susan ^c  

^a UNIVERSITY OF MANCHESTER   (United Kingdom)

^b UNIVERSITY OF SOUTHAMPTON   (United Kingdom)

^c UNIVERSITY OF YORK   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; INTEGRATION; MATHEMATICAL MODELS;

FINITE SEQUENCE NUMBERS; REFINEMENT TECHNIQUES; TOWER PATTERN; VERIFICATION;

LOGIC PROGRAMMING;

EID: 26444507199     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11526841_26     Document Type: Conference Paper

References (21)

1. R. Banach. Maximally abstract retrenchments. In Proc. IEEE ICFEM2000, pages 133-142, York, August 2000. IEEE Computer Society Press.
2. R. Banach, C. Jeske, and M. Poppleton. Composition mechanisms for retrenchment. 2004. submitted, http://www.cs.man.ac.uk/~banach/some.pubs/ Retrench.Composition.pdf.
3. R. Banach and M. Poppleton. Retrenchment: An engineering variation on refinement. In D. Bert, editor, 2nd International B Conference, volume 1393 of LNCS, pages 129-147, Montpellier, France, April 1998. Springer.
4. R. Banach and M. Poppleton. Sharp retrenchment, modulated refinement and simulation. Formal Aspects of Computing, 11:498-540, 1999.
5. R. Banach and M. Poppleton. Retrenching partial requirements into system definitions: A simple feature interaction case study. Requirements Engineering Journal, 8(2), 2003. 22pp.
6. R. Banach, M. Poppleton, and C. Jeske. Retrenchment and promotion in Z. submitted for publication, 2004.
7. D. Bert, J.P. Bowen, S. King, and M. Waldén, editors. Proc. ZB2003: Formal Specification and Development in Z and B, volume 2651 of LNCS, Turku, Finland, June 2000. Springer.
8. D. Cooper, S. Stepney, and J. Woodcock. Derivation of Z refinement proof rules. Technical Report YCS-2002-347, University of York, 2002.
9. W.-P. de Roever and K. Engelhardt. Data Refinement: Model-Oriented Proof Methods and their Comparison. Cambridge University Press, 1998.
10. J. Derrick and E. Boiten. Refinement in Z and Object-Z. FACIT. Springer, 2001.
11. G. Grimmett and Stirzaker D. Probability and Random Processes. O.U.P., 3 edition, 2001.
12. C. Jeske. Algebraic Integration of Retrenchment and Refinement. PhD thesis, University of Manchester, 2005.
13. S. Karlin and H.M. Taylor. A First Course in Stochastic Processes. Academic, 1975.
14. Department of Trade and Industry. Information Technology Security Evaluation Criteria, 1991. http://www.cesg.gov.uk/site/iacs/itsec/media/formal- docs/Itsec.pdf.
15. M. Poppleton and R. Banach. Controlling control systems: An application of evolving retrenchment. In D. Bert, J.P. Bowen, M.C. Henson, and K. Robinson, editors, Second International Conference of B and Z Users, volume 2272 of LNCS, pages 42-61, Grenoble, France, January 2002. Springer.
16. S.L. Resnick. Adventures in Stochastic Processes. Birkhauser, 1992.
17. S. Stepney, D. Cooper, and J. Woodcock. More powerful Z data refinement: Pushing the state of the art in industrial refinement. In J.P. Bowen, A. Fett, and M.G. Hinchey, editors, 11th International Conference of Z Users, volume 1493 of LNCS, pages 284-307, Berlin, Germany, September 1998. Springer.
18. S. Stepney, D. Cooper, and J. Woodcock. An electronic purse: Specification, refinement and proof. Technical Report PRG-126, Oxford University Computing Laboratory, 2000.
19. S. Stepney, F. Polack, and I. Toyn. An outline pattern language for Z. In Bert et al. [7], pages 2-19.
20. S. Stepney, F. Polack, and I. Toyn. Patterns to guide practical refactoring. In Bert et al. [7], pages 20-39.
21. J. Woodcock and J. Davies. Using Z: Specification, Refinement and Proof. Prentice-Hall, 1996.