Compositional reasoning for pointer structures

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4014 LNCS, Issue , 2006, Pages 115-139

  Chan, Yifeng ^a   Sanders, J W ^b  

^a DURHAM UNIVERSITY   (United Kingdom)

^b UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMBINATORIAL MATHEMATICS; COMPUTATION THEORY; LOGIC PROGRAMMING; OBJECT ORIENTED PROGRAMMING; PARAMETER ESTIMATION;

BINARY COMBINATOR; COMPOSITIONAL DEFINITION; POINTER STRUCTURES; SEPARATION LOGIC;

COMPUTER SCIENCE;

EID: 33746045698     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (17)

1. Bornat, R.: Proving pointer programs in Hoare logic. In Backhouse, R. C., Oliveira, J. N., eds.: Proc. of 5th Int. Conf. of Mathematics of Program Construction, MPC '00, Vol. 1837 of Lect. Notes in Comput. Sci. Springer-Verlag (2000) 102-126
2. Cardelli, L., Gardner, P., and Ghelli, G.: A spatial logic for querying graphs. In Widmayer, P. et al., eds.: Proc. of 29th Int. Col,l on Automata, Languages and Programming, ICALP '02, Vol. 2380 of Lect. Notes in Comput, Sci. Springer-Verlag (2002) 597-610
3. Chen, Y.: Generic composition. Formal Aspects of Computing 14(2) (2002) 108-122
4. Harel, D.: Dynamic logic. In Gabbay, D., Guenthner, F., eds.; Handbook of Philosophical Logic, Vol. II: Extensions of Classical Logic. D. Reidel Publ. Co. (1984) 497-604
5. Hoare, C. A. R.: Communicating Sequential Processes. Prentice Hall (1985)
6. He, J., Hoare, C. A. R.: Unifying Theories of Programming Prentice Hall (1998)
7. He, J., Hoare, C. A. R.: A trace model for pointers and objects. In Guerraoui, R., ed.: Proc. of 13th Europ. Conf. on Object-Oriented Programming, ECOOP '99, Vol. 1628 of Lect. Notes in Comput. Sci. Springer-Verlag (1999) 1-17
8. Ishtiaq, S. S., O'Hearn, P. W.: BI as an assertion language for mutable data structures. In Conf. Record of 28th ACM SIGPLAN-SIGACT Symp. on Principles of Programming Languages, POPL '01. ACM Press (2001) 14-26
9. Mijajlović, I., Torp-Smith, N., O'Hearn, P. W.: Refinement and separation contexts. In Lodaya, K., Mahajan, M., eds.: Proc. of 24th Int. Conf. on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2004, Vol. 3328 of Lect. Notes in Comput. Sci. Springer-Verlag (2004) 421-433
10. Milner, R.: Communication and Concurrency. Prentice Hall (1989)
11. O'Hearn, P. W., Reynolds, J. C., Yang, H.: Local reasoning about programs that alter data structures. In Frlbourg, L., ed.: Proc. of 15th Int. Wksh. on Computer Science Logic, CSL 2001, Vol. 2142 of Lect. Notes in Comput. Sci. Springer-Verlag (2001) 1-19
12. O'Hearn, P. W., Reynolds, J. C., Yang, H.: Separation and information hiding. In Proc. of 31st ACM SIGPLAN-SIGACT Symp. on Principles of Programming Languages, POPL 2004. ACM Press (2004) 268-280
13. Paige, R. F., Ostroff, J. S.: ERC - an object-oriented refinement calculus for Eiffel. Formal Aspects of Computing 16(1) (2004) 51-79
14. Parkinson, M., Bierman, G.: Separation logic and abstraction. In Proc. of 32nd ACM SIGPLAN-SIGACT Symp. on Principles of Programming Languages, POPL '05. ACM Press (2005) 259-270
15. Reynolds, J. C.: Separation logic: a logic for shared mutable data structures. In: Proc. of 17th IEEE Syrnp. on Logic in Computer Science, LICS '02. IEEE Comput. Soc. Press (2002) 55-74
16. Yang, H.: Relational separation logic. Submitted to Theor. Comput. Sci.
17. Yang, H.: Verification of the Schorr-Waite graph marking algorithm by refinement. Workshop presentation (2003)