Proving Program Invariance and Termination by Parametric Abstraction, Lagrangian Relaxation and Semidefinite Programming
- 1 January 2005
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- A nonlinear programming algorithm for solving semidefinite programs via low-rank factorizationMathematical Programming, 2003
- Synthesis of Linear Ranking FunctionsPublished by Springer Nature ,2001
- Approximating the domains of functional and imperative programsScience of Computer Programming, 1999
- Linear Matrix Inequalities in System and Control TheoryPublished by Society for Industrial & Applied Mathematics (SIAM) ,1994
- Abstract Interpretation FrameworksJournal of Logic and Computation, 1992
- Abstract interpretation and application to logic programsThe Journal of Logic Programming, 1992
- Partial Cylindrical Algebraic Decomposition for quantifier eliminationJournal of Symbolic Computation, 1991
- Affine relationships among variables of a programActa Informatica, 1976
- An axiomatic basis for computer programmingCommunications of the ACM, 1969
- Assigning meanings to programsPublished by American Mathematical Society (AMS) ,1967