Generation of Basic Semi-algebraic Invariants Using Convex Polyhedra
Authors:
- 1 January 2005
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 19-34
Abstract
No abstract availableKeywords
This publication has 27 references indexed in Scilit:
- Precise widening operators for convex polyhedraScience of Computer Programming, 2005
- The ASTREÉ Analyzer2005
- Proving Program Invariance and Termination by Parametric Abstraction, Lagrangian Relaxation and Semidefinite Programming2005
- Approximating the Algebraic Relational Semantics of Imperative ProgramsLecture Notes in Computer Science, 2004
- Precise Widening Operators for Convex PolyhedraLecture Notes in Computer Science, 2003
- FAST: Fast Acceleration of Symbolic Transition Systems2003
- Possibly Not Closed Convex Polyhedra and the Parma Polyhedra Library2002
- A Transformational Approach for Generating Non-linear Invariants2000
- Systematic design of program analysis frameworks1979
- Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints1977