Abstract. We are interested in separation-logic-based static analysis of programs that use shared mutable data structures. In this paper, we introduce backward and forward analysis for a separation logic called BI µν , an extension of separation logic [Ishtiaq & O'Hearn, POPL'01], to which we add fixpoint connectives and postponed substitution. This allows us to express recursive definitions within the logic as well as the axiomatic semantics of while statements.
Sims REF extends separation logic with fixpoint connectives and postponed substitution to express recursively defined formulae to model the analysis of while-loops.
Extending separation logic with fixpoints and postponed substitution
Theor. Comput. Sci.
Theor. Comput. Sci.
Computer Science