Reference count analysis with shallow aliasing

DOI10.1016/J.IPL.2010.08.003MaRDI QIDQ1944038zbMATH OpenOpenAlexFDO

Authors Akash Lal, G. Ramalingam

Publication date 4 April 2013

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2010.08.003

zbMATH Keywords

formal methodsstatic analysisprogram correctnessalias analysisaffine-relation analysistypestate verification

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Verifying Reference Counting Implementations
• A construction of distributed reference counting
• The space cost of lazy reference counting
• Cyclic reference counting
• Static analysis for optimizing reference counting

Cites work

• Affine relationships among variables of a program
• On the complexity of flow-sensitive dataflow analyses
• Precise interprocedural analysis through linear algebra
• Typestate verification: abstraction techniques and complexity results
• Verifying Reference Counting Implementations

Cited in

(2)

• Verifying Reference Counting Implementations
• scientific article; zbMATH DE number 1863302 (Why is no real title available?)

This page was built for publication: Reference count analysis with shallow aliasing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1944038)