Reasoning about pointers in refinement calculus

Proceedings - Asia-Pacific Software Engineering Conference, APSEC

Volumn 2003-January, Issue , 2003, Pages 425-434

  Back, Ralph Johan ^a   Fan, Xiaocong ^b   Preoteasa, Viorel ^a  

^a ÅBO AKADEMI UNIVERSITY   (Finland)

^b PENNSYLVANIA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; COMPUTATIONAL LINGUISTICS; SEMANTICS; SOFTWARE ENGINEERING;

INDUCTION PRINCIPLES; POINTER STRUCTURES; PROGRAMMING CONCEPTS; REFINEMENT CALCULI; USE REFINEMENT;

OBJECT ORIENTED PROGRAMMING;

EID: 33746087237     PISSN: 15301362     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/APSEC.2003.01254398     Document Type: Conference Paper

References (23)

1. R. Back and V. Preoteasa. Reasoning about recursive procedures with parameters. Technical Report 500, TUCS - Turku Centre for Computer Science, January 2003.
2. R. Back and J. Von Wright. Refinement Calculus. A systematic Introduction. Springer, 1998.
3. R. Back and J. Von Wright. Reasoning algebraically about loops. Acta Inform., 36(4):295-334, 1999.
4. F. L. Bauer and H. Wössner. Algorithmic Language and Program Development. Springer-Verlag, 1982.
5. R. Bird. Functional pearl: Unfolding pointer algorithms. Journal of Functional Programming, 11(3):347-358, May 2001.
6. R. Bornat. Proving pointer programs in Hoare logic. In Mathematics of Program Construction. Springer-Verlag, 2000.
7. R. M. Burstall. Some techniques for proving correctness of programs which alter data structures. Machine Intelligence, 7:23-50, 1972.
8. M. Butler. Calculational derivation of pointer algorithms from tree operations. Science of Computer Programming, 33(3):221-260, 1999.
9. C. Calcagno, S. Ishtiaq, and P. O'Hearn. Semantic analysis of pointer aliasing, allocation and disposal in Hoare logic. In ACM-SIGPLAN 2nd International Conference on Principles and practice of Declarative Programming (PPDP 2000). ACM Press, September 2000.
10. A. Church. A formulation of the simple theory of types. J. Symbolic logic, 5:56-68, 1940.
11. E. Dijkstra. Guarded commands, nondeterminacy and formal derivation of programs. Comm. ACM, 18(8):453-457, 1975.
12. R. Floyd. Assigning meanings to programs. In Proc. Sym-pos. Appl. Math., Vol. XIX, pages 19-32. Amer. Math. Soc., Providence, R. I., 1967.
13. M. Gordon and T. Melham, editors. Introduction to HOL. Cambridge University Press, Cambridge, 1993. A theorem proving environment for higher order logic, Appendix B by R. J. Boulton.
14. C. Hoare. An axiomatic basis for computer programming. Communications of the ACM, 12(10):576-580, 1969.
15. S. Ishtiaq and P. O'Hearn. Bi as an assertion language for mutable data structures. In Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, pages 14-26. ACM Press, 2001.
16. D. Luckham and N. Suzuki. Verification of array, record, and pointer operations in Pascal. ACM Transactions on Programming Languages and Systems (TOPLAS), 1(2):226-244, 1979.
17. B. Meyer. Towards practical proofs of class correctness. In ZB 2003: Formal Specification and Development in Z and B, Lecture Notes in Computer Science, volume 2651, pages 359-387. Springer-Verlag, 2003.
18. J. M. Morris. A general axiom of assignment, assignment and linked data stuctures, a proof of the Schorr-Waite algorithm. In Theoretical Foundations of Programming Methodology, Lecture notes of an International Summer School, pages 25-51. D. Reidel Publishing Company, 1982.
19. P. O'Hearn, J. Reynolds, and H. Yang. Local reasoning about programs that alter data structures. In Computer science logic (Paris, 2001), volume 2142 of Lecture Notes in Com-put. Sci., pages 1-19. Springer, Berlin, 2001.
20. S. Owre, N. Shankar, J. Rushby, and D. Stringer-Clavert. PVS Language Reference, 1999.
21. R. Paige, J. Ostroff, and P. Brooke. Formalising Eiffel reference and expanded types in PVS. In Proc. International Workshop on Aliasing, Confinement, and Ownership in Object-Oriented Programming, Darmstadt, Germany, July 2003.
22. J. Reynolds. Intuitionistic reasoning about shared mutable data structure. In Millenial Perspectives in Computer Science, 2000.
23. J. Reynolds. Separation logic: A logic for shared mutable data structures. In 17th Annual IEEE Symposium on Logic in Computer Science. IEEE, July 2002.