Electronic Notes in Theoretical Computer Science, Volume 287
Volume 287, November 2012
- Matthieu Martel: Accurate Evaluation of Arithmetic Expressions (Invited Talk). 3-16
- Mehdi Bouaziz: TreeKs: A Functor to Make Numerical Abstract Domains Scalable. 41-52
- Jedrzej Fulara: Generic Abstraction of Dictionaries and Arrays. 53-64
- Eric Goubault, Tristan Le Gall, Sylvie Putot: An Accurate Join for Zonotopes, Preserving Affine Input/Output Relations. 65-76
- Damien Massé: Proving Termination by Policy Iteration. 77-88
- Antoine Miné: Inferring Sufficient Conditions with Backward Polyhedral Under-Approximations. 89-100
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-17T202759 by the dblp team