Formalised inductive reasoning in the logic of bunched implications

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

Volumn 4634 LNCS, Issue , 2007, Pages 87-103

  Brotherston, James ^a  

^a IMPERIAL COLLEGE LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; DIFFERENTIATION (CALCULUS); FORMAL LOGIC; GRAPH THEORY;

BUNCHED IMPLICATIONS; INDUCTION RULES; PROOF STRUCTURES; PROOF SYSTEMS;

CASE BASED REASONING;

EID: 38149090270     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74061-2_6     Document Type: Conference Paper

References (25)

1. Aczel, P.: An introduction to inductive definitions. In: Barwise, J. (ed.) Handbook of Mathematical Logic, North-Holland, pp. 739-782 (1977)
2. Berdine, J., Calcagno, C., O'Hearn, P.W.: Smallfoot: Modular automatic assertion checking with separation logic. In: de Boer, F.S., Bonsangue, M.M., Graf, S., de Roever, W.-P. (eds.) FMCO 2005. LNCS, vol. 4111, pp. 115-137. Springer, Heidelberg (2006)
3. Berdine, J., Calcagno, C., O'Hearn, P.W.: Symbolic execution with separation logic. In: Yi, K. (ed.) APLAS 2005. LNCS, vol. 3780, pp. 52-68. Springer, Heidelberg (2005)
4. Berdine, J., Cook, B., Distefano, D., O'Hearn, P.W.: Automatic termination proofs for programs with shape-shifting heaps. In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol. 4144, pp. 386-400. Springer, Heidelberg (2006)
5. Biering, B., Birkedal, L., Torp-Smith, N.: BI hyperdoctrines and separation logic. In: Sagiv, M. (ed.) ESOP 2005. LNCS, vol. 3444, pp. 233-247. Springer, Heidelberg (2005)
6. Birkedal, L., Torp-Smith, N., Reynolds, J.C.: Local reasoning about a copying garbage collector. In: Proceedings of POPL'04, pp. 220-231 (2004)
7. Bornat, R., Calcagno, C., O'Hearn, P.: Local reasoning, separation and aliasing. In: Proceedings of SPACE'04 (January 2004)
8. Brotherston, J.: Cyclic proofs for first-order logic with inductive definitions. In: Beckert, B. (ed.) TABLEAUX 2005. LNCS (LNAI), vol. 3702, pp. 78-92. Springer, Heidelberg (2005)
9. Brotherston, J.: Sequent Calculus Proof Systems for Inductive Definitions. PhD thesis, University of Edinburgh (November 2006)
10. Brotherston, J., Simpson, A.: Complete sequent calculi for induction and infinite descent. In: Proceedings of LICS-22 (to appear)
11. Brotherston, J., Calcagno, C., Bornat, R.: Cyclic proofs of termination in separation logic. Forthcoming
12. Bundy, A.: The automation of proof by mathematical induction. In: Robinson, A., Voronkov, A. (eds.) Handbook of Automated Reasoning, vol. I, ch. 13, pp. 845-911. Elsevier Science, North-Holland, Amsterdam (2001)
13. Calcagno, C., Distefano, D., O'Hearn, P.W., Yang, H.: Beyond reachability: Shape abstraction in the presence of pointer arithmetic. In: Yi, K. (ed.) SAS 2006. LNCS, vol. 4134, pp. 182-203. Springer, Heidelberg (2006)
14. Distefano, D., O'Hearn, P.W., Yang, H.: A local shape analysis based on separation logic. In: Hermanns, H., Palsberg, J. (eds.) TACAS 2006 and ETAPS 2006. LNCS, vol. 3920, pp. 287-302. Springer, Heidelberg (2006)
15. Guo, B., Vachharajani, N., August, D.I.: Shape analysis with inductive recursion synthesis. In: Proceedings of PLDI'07 (to appear)
16. Ishtiaq, S., O'Hearn, P. W.: BI as an assertion language for mutable data structures. In: Proceedings of POPL'01 (January 2001)
17. Martin-Löf, P.: Haupstatz for the intuitionistic theory of iterated inductive definitions. In: Fenstad, J.E.(ed.) Proceedings of the Second Scandinavian Logic Symposium. North-Holland, pp. 179-216 (1971)
18. Nguyen, H.H., David, C., Qin, S., Chin, W.-N.: Automated verification of shape and size properties via separation logic. In: Cook, B., Podelski, A. (eds.) VMCAI 2007. LNCS, vol. 4349, Springer, Heidelberg (2007)
19. O'Hearn, P.W., Pym, D.J.: The logic of bunched implications. Bulletin of Symbolic Logic 5(2), 215-244 (1999)
20. Pym, D.: The Semantics and Proof Theory of the Logic of Bunched Implications. In: Applied Logic Series, Kluwer, Dordrecht (2002)
21. Reynolds, J.C.: Separation logic: A logic for shared mutable data structures. In: Proceedings of LICS-17 (2002)
22. Élodie-Jane, S.: Extending separation logic with fixpoints and postponed substitution. Theoretical Computer Science 351(2), 258-275 (2006)
23. Sprenger, C., Dam, M.: On the structure of inductive reasoning: circular and tree-shaped proofs in the μ-calculus. In: Gordon, A.D. (ed.) ETAPS 2003 and FOSSACS 2003. LNCS, vol. 2620, pp. 425-440. Springer, Heidelberg (2003)
24. Sprenger, C., Dam, M.: A note on global induction mechanisms in a μ-calculus with explicit approximations. Theoretical Informatics and Applications (July 2003)
25. Yang, H.: An example of local reasoning in BI pointer logic: the Schorr-Waite graph marking algorithm. In: Proceedings of SPACE 2001 (2001)