1. Inferring sufficient conditions with backward polyhedral under-approximations;Miné;Electron. Notes Theor. Comput. Sci.,2012
2. Uncovering hidden contracts: The .NET example;Arnout;Computer,2003
3. Inferring definite counterexamples through under-approximation;Brauer,2012
4. A practical and precise inference and specializer for array bound checks elimination;Popeea,2008
5. Temporal property-driven verification by abstract interpretation;Massé,2002