Refinement and retrenchment for programming language data types

Formal Aspects of Computing

Volumn 17, Issue 4, 2005, Pages 423-442

  Beckert, Bernhard ^a   Schlager, Steffen ^b  

^a University of Koblenz Landau ^*  (Germany)

^b UNIVERSITY OF KARLSRUHE   (Germany)

Author keywords

Formal specification; Integer arithmetic; Java; Retrenchment refinement; Software verification; UML OCL

Indexed keywords

INTEGER PROGRAMMING; JAVA PROGRAMMING LANGUAGE;

DATA TYPES;

SOFTWARE ENGINEERING;

EID: 28144449436     PISSN: 09345043     EISSN: 1433299X     Source Type: Journal    
DOI: 10.1007/s00165-005-0073-x     Document Type: Conference Paper

References (33)

1. [Abr96] Abrial J-R (1996) The B-book: assigning programs to meanings. ISBN 0-521-49619-5. Cambridge: Cambridge University Press, UK
2. +05] Ahrendt W, Baar T, Beckert B, Bubel R, Giese M, Hähnle R, Menzel W, Mostowski W, Roth A, Schlager S, Schmitt PH (2005) The KeY tool. Softw Syst Model 4:32-54
3. +00] Ahrendt W, Baar T, Beckert B, Giese M, Habermalz E, Hähnle R, Menzel W, Schmitt PH (2000) The KeY Approach: integrating object oriented design and formal verification. In: Ojeda-Aciego M, de Guzman IP, Brewka G, Pereira LM (eds) Proceedings, logics in artificial intelligence (JELIA), Malaga, Spain, LNCS 1919, Springer, Berlin Heidelberg New York
4. +00] Balser M, Reif W, Schellhorn G, Stenzel K, Thums A (2000) Formal system development with KIV. In: Maibaum T (ed) Fundamental approaches to software engineering, vol 1783 of LNCS. Springer, Berlin Heidelberg New York
5. [BJ04] Banach R, Jeske C (2004) Output retrenchments, defaults, stronger compositions, feature engineering. Available at http://www.cs.man.ac.uk/~banach/ Recent.publications.html
6. [BP98] Banach R, Poppleton (1998) Retrenchment: an engineering variation on refinement. In: Bert D. (ed) B'98: Recent advances in the development and use of the B method Second international B Conference, Montpellier, France, April 22-24, 1998, Proceedings, LNCS 1393, pp 129-147. Springer, Berlin Heidelberg New York
7. [BP99] Banach R, Poppleton M (1999) Sharp retrenchment, modulated refinement and punctured simulation. Formal Aspects Comput 11:498-540
8. [Bec01] Beckert B (2001) A Dynamic Logic for the Formal Verification of Java Card Programs. In: Attali I., Jensen T. (eds) Java on smart cards: programming and security. Revised papers, Java card 2000, International workshop Cannes, France, LNCS 2041, pp 6-24. Springer, Berlin Heidelberg New York
9. [BK04] Beckert B, Klebanov V (2004) Proof reuse for deductive program verification. In: Cuellar J, Liu Z (eds) Proceedings, software engineering and formal methods (SEFM), Beijing, China. IEEE Press
10. [BD98] Boiten EA, Derrick J (1998) IO-refinement in Z. In: Evans A, Duke D, Clark T (eds) 3rd BCS-FACS Northern formal methods workshop, Electronic Workshops in Computing. Springer, Berlin Heidelberg New York
11. [Cha03] Chalin P (2003) Improving JML: for a safer and more effective language. In: Araki K, Gnesi S, Mandrioli D (eds) Proceedings FME 2003: formal methods, Pisa, Italy, LNCS 2805, pp 440-461. Springer, Berlin Heidelberg New York
12. [DB01] Derrick J, Boiten E (2001) Refinement in Z and object-Z: foundations and advanced applications. Formal Approaches to Computing and Information Technology. Springer, Berlin Heidelberg New York
13. [ESC] ESC/Java (Extended static checking for Java). http://research. compaq.com/SRC/esc/
14. [ESA96] European Space Agency. Ariane 501 inquiry board report, July 1996. Available at: http://ravel.esrin.esa.it/docs/esa-x-1819eng.pdf
15. [GJSB00] Gosling J, Joy B, Steele G, Bracha G (2000) The Java language specification. 2nd edn, Addison Wesley, USA
16. [Har84] Harel D (1984) Dynamic Logic. In: Gabbay D, Guenthner F (eds) Handbook of philosophical logic, vol II. Extensions of classical logic, chapter 10, pp 497-604. Reidel, Dordrecht
17. [HKT00] Harel D, Kozen D, Tiuryn J (2000) Dynamic Logic. MIT Press, Cambridge, USA
18. [Har99] Harrison J (1999) A machine-checked theory of floating point arithmetic. In: Bertot Y, Dowek G, Hirschowitz A, Paulin C, Théry L (eds) Proceedings, theorem proving in higher order logics (TPHOLs), Nice, France, LNCS 1690, pp 113-130. Springer, Berlin Heidelberg New York
19. [Har00] Harrison J (2000) Formal verification of IA-64 division algorithms. In: J. Harrison, M. Aagaard (eds) Proceedings, Theorem Proving in Higher Order Logics (TPHOLs), LNCS 1869, pp 234-251. Springer, Berlin Heidelberg New York
20. [HHS86] He J, Hoare CAR, Sanders JW (1986) Data refinement refined. In: Robinet B, Wilhelm R (eds) European symposium on programming, vol LNCS 213, pp 187-196. Springer, Berlin Heidelberg New York
21. [Hui01] Huisman M (2001) Java program verification in higher-order logic with PVS and isabelle. PhD thesis, University of Nijmegen, The Netherlands
22. +96] Hutter D, Langenstein B, Sengler C, Siekmann JH, Stephan W (1996) Deduction in the verification support environment (VSE). In: Gaudel M-C, Woodcock J (ed) Proceedings, international symposium of formal methods Europe (FME), Oxford, UK, LNCS 1051. Springer, Berlin Heidelberg New York
23. [Jac03] Jacobs B (2003) Java's Integral types in PVS. In: Najim E, Nestmann U, Stevens P (eds) Formal methods for open object-based distributed systems (FMOODS 2003), vol 2884 of LNCS, pp 1-15. Springer, Berlin Heidelberg New York
24. [KT90] Kozen D, Tiuryn J (1990) Logic of programs. In: van Leeuwen J (ed) Handbook of theoretical computer science, vol B, Formal models and semantics, Chapter 14, pp 789-840. Elsevier, Amsterdam
25. [LBR99] Leavens GT, Baker AL, Ruby C (1999) JML: a notation for detailed design. In: Kilov H, Rumpe B, Simmonds I (eds) Behavioral specifications of businesses and systems, pp 175-188. Kluwer, Dordrecht
26. [Obj99] Object Management Group, Inc., Framingham/MA, USA, www.omg.org. OMG Unified Modeling Language Specification Version 1.3, June 1999
27. [PHM99] Poetzsch-Heffter A, Müller P (1999) A programming logic for sequential Java. In: Swierstra SD (ed) Proceedings, European symposium on programming (ESOP), LNCS 1576, Amsterdam, The Netherlands
28. [Pra77] Pratt VR (1977) Semantical Considerations on Floyd-Hoare Logic. In: Proceedings, 18th Annual IEEE Symposium on Foundation of Computer Science
29. [Sch02] Schlager S (2002) Handling of integer arithmetic in the verification of Java programs. Master's thesis, Universität Karlsruhe, 2002. Available at: http://www.key-project.org/doc/2002/DA-Schlager.ps.gz
30. [Spi92] Spivey JM (1992) The Z notation: a reference manual. Prentice Hall International Series in Computer Science, 2nd edn, USA
31. [Ste01] Stenzel K (2001) Verification of JavaCard programs. Technical report 2001-5, Institut für Informatik, Universität Augsburg, Germany, 2001. Available at: http://www.informatik.uni-augsburg.de/swt/fmg/papers/
32. [SBD02] Stump A, and Barrett CW, Dill DL (2002) CVC: A cooperating validity checker. In: Brinksma E, Larsen KG (ed) 14th International Conference on Computer Aided Verification (CAV), vol 2404 of Lecture Notes in Computer Science, pp 500-504. Springer, Copenhagen, Denmark
33. [vO01] von Oheimb D (2001) Analyzing Java in isabelle/HOL: formalization, type safety and hoare logic. PhD thesis, Technische Universität München, 2001