Possibly Not Closed Convex Polyhedra and the Parma Polyhedra Library

This publication has 19 references indexed in Scilit:

• Comparing the Galois connection and widening/narrowing approaches to abstract interpretation
  Published by Springer Nature ,2005
• Cleanness Checking of String Manipulations in C Programs via Integer Analysis
  Published by Springer Nature ,2001
• Synthesis of Linear Ranking Functions
  Published by Springer Nature ,2001
• Polyhedral Analysis for Synchronous Languages
  Published by Springer Nature ,1999
• Inferring argument size relationships with CLP( $$\mathcal{R}$$ )
  Published by Springer Nature ,1997
• Automatic discovery of linear restraints among variables of a program
  Published by Association for Computing Machinery (ACM) ,1978
• Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints
  Published by Association for Computing Machinery (ACM) ,1977
• Algorithm for discovering the set of all the solutions of a linear programming problem
  USSR Computational Mathematics and Mathematical Physics, 1968
• Algorithm for finding a general formula for the non-negative solutions of a system of linear inequalities
  USSR Computational Mathematics and Mathematical Physics, 1965
• Algorithm for finding a general formula for the non-negative solutions of a system of linear equations
  USSR Computational Mathematics and Mathematical Physics, 1964