Refinement to Certify Abstract Interpretations: Illustrated on Linearization for Polyhedra
Authors:
- 10 November 2018
- journal article
- research article
- Published by Springer Nature in Journal of Automated Reasoning
- Vol. 62 (4) , 505-530
Abstract
No abstract availableKeywords
Funding Information
- FP7 Ideas: European Research Council (306595)
This publication has 22 references indexed in Scilit:
- A Formally-Verified C Static Analyzer2015
- The Bernstein polynomial basis: A centennial retrospectiveComputer Aided Geometric Design, 2012
- Deciding Kleene Algebras in CoqLogical Methods in Computer Science, 2012
- Formal verification of a realistic compilerCommunications of the ACM, 2009
- Constructive design of a hierarchy of semantics of a transition system by abstract interpretationTheoretical Computer Science, 2002
- The discoveries of continuationsHigher-Order and Symbolic Computation, 1993
- Representing polynomials by positive linear functions on compact convex polyhedraPacific Journal of Mathematics, 1988
- Automatic discovery of linear restraints among variables of a program1978
- Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints1977
- Guarded commands, nondeterminacy and formal derivation of programsCommunications of the ACM, 1975