Efficient Strongly Relational Polyhedral Analysis
Authors:
- 1 January 2005
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 111-125
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- The Octahedron Abstract DomainLecture 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 New Numerical Abstract Domain Based on Difference-Bound Matrices2001
- Polyhedral Analysis for Synchronous Languages1999
- Verification of Real-Time Systems using Linear Relation AnalysisFormal Methods in System Design, 1997
- 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
- Affine relationships among variables of a programActa Informatica, 1976