Abstract
We are interested in static analysis of programs which use shared mutable data structures. We introduce a backward and a forward analyses with a separation logic called BI μν. This logic is an extension of BI logic [7], to which we add fixpoint connectives and a postponed substitution. This allows us to express recursive definitions within the logic as well as the axiomatic semantics of while statements. Unlike the existing rule-based approach to program proof using separation logic, our approach does not have syntactical restrictions on the use of rules.
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.
References
Calcagno, C., Yang, H., O’Hearn, P.W.: Computability and complexity results for a spatial assertion language for data structures. In: Hariharan, R., Mukund, M., Vinay, V. (eds.) FSTTCS 2001. LNCS, vol. 2245, p. 108. Springer, Heidelberg (2001)
Cousot, P., Cousot, R.: Systematic design of program analysis frameworks. In: POPL 1979, San Antonio, Texas, pp. 269–282. ACM Press, New York (1979)
de Bakker, J.W.: Mathematical Theory of Program Correctness. Prentice Hall, Englewood Cliffs (1980)
Dijkstra, E.W.: A Discipline of Programming. Prentice Halll, Englewood Cliffs (1976)
Galmiche, D., Mery, D.: Connection-based proof search in propositional BI logic. In: Voronkov, A. (ed.) CADE 2002. LNCS (LNAI), vol. 2392, pp. 111–128. Springer, Heidelberg (2002)
Hoare, C.A.R.: An axiomatic basis for computer programming. Comm. ACM 12, 576–580 (1969)
Ishtiaq, S., O’Hearn, P.: BI as an assertion language for mutable data structures. In: POPL 2001, pp. 14–26 (2001)
Yang, H., O’Hearn, P., Reynolds, J.: Syntactic control of interference. In: POPL 2004, Italy, ACM Press, New York (2004)
Reynolds, J.C.: Syntactic control of interference. In: POPL 1978, pp. 39–46. ACM Press, New York (1978)
Reynolds, J.C.: Separation logic: A logic for shared mutable data structures. In: LICS 2002, Denmark, pp. 55–74. IEEE Computer Society, Los Alamitos (2002)
Yang, H., O’Hearn, P.: A semantic basis for local reasoning. In: Nielsen, M., Engberg, U. (eds.) FOSSACS 2002. LNCS, vol. 2303, pp. 402–416. Springer, Heidelberg (2002)
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
Sims, ÉJ. (2004). Extending Separation Logic with Fixpoints and Postponed Substitution. In: Rattray, C., Maharaj, S., Shankland, C. (eds) Algebraic Methodology and Software Technology. AMAST 2004. Lecture Notes in Computer Science, vol 3116. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27815-3_36
Download citation
DOI: https://doi.org/10.1007/978-3-540-27815-3_36
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22381-8
Online ISBN: 978-3-540-27815-3
eBook Packages: Springer Book Archive