Decidable logics combining heap structures and data

@inproceedings{Madhusudan2011DecidableLC,
  title={Decidable logics combining heap structures and data},
  author={P. Madhusudan and Gennaro Parlato and Xiaokang Qiu},
  booktitle={POPL},
  year={2011}
}
We define a new logic, STRAND, that allows reasoning with heap-manipulating programs using deductive verification and SMT solvers. STRAND logic ("STRucture ANd Data" logic) formulas express constraints involving heap structures and the data they contain; they are defined over a class of pointer-structures R defined using MSO-defined relations over trees, and are of the form ∃→x∀→y (→x,→) x" , where "φ" is a monadic second-order logic (MSO) formulawith additional quantification that combines… CONTINUE READING
Highly Cited
This paper has 77 citations. REVIEW CITATIONS
49 Citations
4 References
Similar Papers

Citations

Publications citing this paper.

77 Citations

0102030'12'14'16'18
Citations per Year
Semantic Scholar estimates that this publication has 77 citations based on the available data.

See our FAQ for additional information.

Similar Papers

Loading similar papers…