Abstract
Theories of programming languages formalize pointers by formalizing the addresses, the heap and the stack of a computer storage. These are implementation concepts. The aim of this paper is a theory that formalizes pointers in terms of concepts from high-level programming languages. We begin with a graph theory, which formalizes the implementation concepts but avoids some common distinctions. From it, we calculate the theory of trace equivalences, which formalizes concepts of high-level programming languages. From that theory, we calculate definitions in terms of weakest (liberal) preconditions. We consider the assignment and the copy operation, which is introduced in the paper; the object creation (i.e. the new-statement) is a sequential composition of them. Those wlp/wp-definitions and the concept of trace equivalence are the result of the paper. They are intended as a foundation for program design; in particular, for an object-oriented one.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Abadi, M., Rustan, K., Leino, M.: A logic of object-oriented programs. Research Report 161, Digital Systems Research Center, 130 Lytton Avenue, Palo Alto, California 94301 (September 1998)
America, P., de Boer, F.: Reasoning about dynamically evolving process structures. Formal Aspects of Computing 6, 269–316 (1994)
Bornat, R.: Proving pointer programs in Hoare logic. In: Backhouse, R., Oliveira, J.N. (eds.) MPC 2000. LNCS, vol. 1837, pp. 102–126. Springer, Heidelberg (2000)
Calcagno, C., Ishtiaq, S., O’Hearn, P.W.: Semantic analysis of pointer aliasing, allocation and disposal in Hoare logic. In: Gabbrielli, M., Pfenning, F. (eds.) Principles and Practice of Declarative Programming. LNCS, Springer, Heidelberg (2000), http://www.dcs.qmw.ac.uk/~ccris/ftp/ppdp00.ps
Cavalcanti, A., Naumann, D.A.: A weakest precondition semantics for an object-oriented language of refinement. In: Woodcock, J.C.P., Davies, J., Wing, J.M. (eds.) FM 1999. LNCS, vol. 1709, pp. 1439–1459. Springer, Heidelberg (1999)
de Boer, F.S.: A WP-calculus for OO. In: Thomas, W. (ed.) FOSSACS 1999. LNCS, vol. 1578, pp. 135–149. Springer, Heidelberg (1999)
Dijkstra, E.W.: A Discipline of Programming. Prentice Hall, Englewood Cliffs (1976)
Dijkstra, E.W., Scholten, C.S.: Predicate Calculus and Program Semantics. Springer, Heidelberg (1990)
Hoare, C.A.R., Jifeng, H.: A trace model for pointers and objects. In: Broy, M., Steinbrüggen, R. (eds.) Calculational System Design. NATO Science Series F: Computer and Systems Sciences, vol. 173, pp. 3–23. IOS Press, Amsterdam (1999)
Kranakis, E., He, J.: A Trace Model for Pointers and Objects. In: Guerraoui, R. (ed.) ECOOP 1999. LNCS, vol. 1628, pp. 1–17. Springer, Heidelberg (1999)
Möller, B.: Calculating with pointer structures. In: Bird, R., Meertens, L. (eds.) Algorithmic Languages and Calculi, pp. 24–48. Chapman & Hall, Boca Raton (1997)
Möller, B.: Linked lists calculated. Technical Report 1997-07, Universität Augsburg, Institut für Informatik, D-86135 Augsburg, Germany (December 1997)
O’Hearn, P.W., Reynolds, J.C., Yang, H.: Local reasoning about programs that alter data structures. In: Fribourg, L. (ed.) CSL 2001 and EACSL 2001. LNCS, vol. 2142, pp. 1–19. Springer, Heidelberg (2001)
Paul, M., Güntzer, U.: On a uniform formal description of data structures. In: Blum, E.K., Paul, M., Takasu, S. (eds.) Mathematical Studies of Information Processing. LNCS, vol. 75, pp. 322–405. Springer, Heidelberg (1979)
Poetzsch-Heffter, A.: Specification and Verification of Object-Oriented Programs. Habilitationsschrift, Fakultät für Informatik, Technische Universität München (January 1997), http://softech.informatik.uni-kl.de/en/publications/habil.html
Reynolds, J.C.: Intuitionistic reasoning about shared mutable data structure. In: Davies, J., Roscoe, B., Woodcock, J. (eds.) Millennial Perspectives in Computer Science, pp. 303–321. Palgrave (2000)
Reynolds, J.C.: Separation logic: A logic for shared mutable data structures. In: Logic in Computer Science, pp. 55–74. IEEE, Los Alamitos (2002), http://www-2.cs.cmu.edu/afs/cs.cmu.edu/%hspace0ptuser/jcr/www/
Reynolds, J.C.: Separation logic: Course CS 819A4, http://www-2.cs.cmu.edu/afs/cs.cmu.edu/project/fox-19/member/jcr/www15819A4s2003/cs819A4-03.html (March 2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Schieder, B. (2004). Pointer Theory and Weakest Preconditions without Addresses and Heap. In: Kozen, D. (eds) Mathematics of Program Construction. MPC 2004. Lecture Notes in Computer Science, vol 3125. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27764-4_19
Download citation
DOI: https://doi.org/10.1007/978-3-540-27764-4_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22380-1
Online ISBN: 978-3-540-27764-4
eBook Packages: Springer Book Archive