Symbolic Abstract Heaps for Polymorphic Information-Flow Guard Inference
Abstract elided by the publisher.
Related papers
- Analysing memory resource bounds for low-level programs ISMM 2008
- Information flow inference for ML TOPLAS 2003
- Information flow inference for ML POPL 2002
- Thresher: precise refutations for heap reachability PLDI 2013
- Dynamic heap type inference for program understanding and debugging POPL 2007
- Checking type safety of foreign function calls TOPLAS 2008
- Scalable context-sensitive flow analysis using instantiation constraints PLDI 2000
- Polymorphic Splitting: An Effective Polyvariant Flow Analysis TOPLAS 1998