© University of Kent - Contact | Feedback | Legal
The University of Kent, Canterbury, Kent, CT2 7NZ, T +44 (0)1227 764000
|
|||
|
Programming Languages and Systems: VIP
Verification with Integer Polyhedra
|
Support: EPSRC (EP/E033105/1) £119,854
|
The aim of this project is to devise algorithms for manipulating sets of integer points that are summarized with a finite number of linear inequalities. Such systems of inequalities are called polyhedra. Polyhedra are interesting computationally because they can be represented finitely and yet they can describe a possibly infinite number of points. Polyhedra are important in verification since they can be used to find faults in programs. One aim of the project is to make this form of verification more sensitive to the integrality of the underlying point sets; the conventional approach is to assume that the points are rational or real, but this preclude the verification of some correctness requirements.
People:
Publications:
(no publications recorded for this project)
Project support:
|
Engineering and Physical Sciences Research Council |