An Efficient Inclusion-Based Points-To Analysis for Strictly-Typed Languages
No abstract available.
Related papers
- Parallel inclusion-based points-to analysis OOPSLA 2010
- Points-To Analysis for Java using Annotated Constraints OOPSLA 2001
- Strictly declarative specification of sophisticated points-to analyses OOPSLA 2009
- A GPU implementation of inclusion-based points-to analysis PPoPP 2012
- Exploiting the structure of the constraint graph for efficient points-to analysis ISMM 2012
- A Quasi Optimal Bit-Vector Encoding of Tree Hierarchies. Application to Efficient Type Inclusion Tests ECOOP 2001
- Prioritizing constraint evaluation for efficient points-to analysis CGO 2011
- Efficient Generation of Correctness Certificates for the Abstract Domain of Polyhedra SAS 2013