termination.templates.hh File Reference

#include "globals.defs.hh"
#include "Variable.defs.hh"
#include "Generator.defs.hh"
#include "Constraint_System.defs.hh"
#include "C_Polyhedron.defs.hh"
#include "NNC_Polyhedron.defs.hh"
#include <stdexcept>
Include dependency graph for termination.templates.hh:
This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Namespaces

namespace  Parma_Polyhedra_Library
 

The entire library is confined to this namespace.


namespace  Parma_Polyhedra_Library::Implementation
 

Implementation related data and functions.


namespace  Parma_Polyhedra_Library::Implementation::Termination

Defines

#define PRINT_DEBUG_INFO   0

Functions

void Parma_Polyhedra_Library::Implementation::Termination::assign_all_inequalities_approximation (const Constraint_System &cs_in, Constraint_System &cs_out)
template<typename PSET >
void Parma_Polyhedra_Library::Implementation::Termination::assign_all_inequalities_approximation (const PSET &pset, Constraint_System &cs)
template<>
void Parma_Polyhedra_Library::Implementation::Termination::assign_all_inequalities_approximation (const C_Polyhedron &ph, Constraint_System &cs)
void Parma_Polyhedra_Library::Implementation::Termination::shift_unprimed_variables (Constraint_System &cs)
template<typename PSET >
void Parma_Polyhedra_Library::Implementation::Termination::assign_all_inequalities_approximation (const PSET &pset_before, const PSET &pset_after, Constraint_System &cs)
bool Parma_Polyhedra_Library::Implementation::Termination::termination_test_MS (const Constraint_System &cs)
bool Parma_Polyhedra_Library::Implementation::Termination::one_affine_ranking_function_MS (const Constraint_System &cs, Generator &mu)
void Parma_Polyhedra_Library::Implementation::Termination::all_affine_ranking_functions_MS (const Constraint_System &cs, C_Polyhedron &mu_space)
void Parma_Polyhedra_Library::Implementation::Termination::all_affine_quasi_ranking_functions_MS (const Constraint_System &cs, C_Polyhedron &decreasing_mu_space, C_Polyhedron &bounded_mu_space)
bool Parma_Polyhedra_Library::Implementation::Termination::termination_test_PR (const Constraint_System &cs_before, const Constraint_System &cs_after)
bool Parma_Polyhedra_Library::Implementation::Termination::one_affine_ranking_function_PR (const Constraint_System &cs_before, const Constraint_System &cs_after, Generator &mu)
void Parma_Polyhedra_Library::Implementation::Termination::all_affine_ranking_functions_PR (const Constraint_System &cs_before, const Constraint_System &cs_after, NNC_Polyhedron &mu_space)
bool Parma_Polyhedra_Library::Implementation::Termination::termination_test_PR_original (const Constraint_System &cs)
bool Parma_Polyhedra_Library::Implementation::Termination::one_affine_ranking_function_PR_original (const Constraint_System &cs, Generator &mu)
void Parma_Polyhedra_Library::Implementation::Termination::all_affine_ranking_functions_PR_original (const Constraint_System &cs, NNC_Polyhedron &mu_space)
template<typename PSET >
bool Parma_Polyhedra_Library::termination_test_MS (const PSET &pset)
 Termination test using an improvement of the method by Mesnard and Serebrenik [BMPZ10].
template<typename PSET >
bool Parma_Polyhedra_Library::termination_test_MS_2 (const PSET &pset_before, const PSET &pset_after)
 Termination test using an improvement of the method by Mesnard and Serebrenik [BMPZ10].
template<typename PSET >
bool Parma_Polyhedra_Library::one_affine_ranking_function_MS (const PSET &pset, Generator &mu)
 Termination test with witness ranking function using an improvement of the method by Mesnard and Serebrenik [BMPZ10].
template<typename PSET >
bool Parma_Polyhedra_Library::one_affine_ranking_function_MS_2 (const PSET &pset_before, const PSET &pset_after, Generator &mu)
 Termination test with witness ranking function using an improvement of the method by Mesnard and Serebrenik [BMPZ10].
template<typename PSET >
void Parma_Polyhedra_Library::all_affine_ranking_functions_MS (const PSET &pset, C_Polyhedron &mu_space)
 Termination test with ranking function space using an improvement of the method by Mesnard and Serebrenik [BMPZ10].
template<typename PSET >
void Parma_Polyhedra_Library::all_affine_ranking_functions_MS_2 (const PSET &pset_before, const PSET &pset_after, C_Polyhedron &mu_space)
 Termination test with ranking function space using an improvement of the method by Mesnard and Serebrenik [BMPZ10].
template<typename PSET >
void Parma_Polyhedra_Library::all_affine_quasi_ranking_functions_MS (const PSET &pset, C_Polyhedron &decreasing_mu_space, C_Polyhedron &bounded_mu_space)
 Computes the spaces of affine quasi ranking functions using an improvement of the method by Mesnard and Serebrenik [BMPZ10].
template<typename PSET >
void Parma_Polyhedra_Library::all_affine_quasi_ranking_functions_MS_2 (const PSET &pset_before, const PSET &pset_after, C_Polyhedron &decreasing_mu_space, C_Polyhedron &bounded_mu_space)
 Computes the spaces of affine quasi ranking functions using an improvement of the method by Mesnard and Serebrenik [BMPZ10].
template<typename PSET >
bool Parma_Polyhedra_Library::termination_test_PR_2 (const PSET &pset_before, const PSET &pset_after)
 Like termination_test_MS_2() but using an alternative formalization of the method by Podelski and Rybalchenko [BMPZ10].
template<typename PSET >
bool Parma_Polyhedra_Library::termination_test_PR (const PSET &pset)
 Like termination_test_MS() but using the method by Podelski and Rybalchenko [BMPZ10].
template<typename PSET >
bool Parma_Polyhedra_Library::one_affine_ranking_function_PR_2 (const PSET &pset_before, const PSET &pset_after, Generator &mu)
 Like one_affine_ranking_function_MS_2() but using an alternative formalization of the method by Podelski and Rybalchenko [BMPZ10].
template<typename PSET >
bool Parma_Polyhedra_Library::one_affine_ranking_function_PR (const PSET &pset, Generator &mu)
 Like one_affine_ranking_function_MS() but using the method by Podelski and Rybalchenko [BMPZ10].
template<typename PSET >
void Parma_Polyhedra_Library::all_affine_ranking_functions_PR_2 (const PSET &pset_before, const PSET &pset_after, NNC_Polyhedron &mu_space)
 Like all_affine_ranking_functions_MS_2() but using an alternative formalization of the method by Podelski and Rybalchenko [BMPZ10].
template<typename PSET >
void Parma_Polyhedra_Library::all_affine_ranking_functions_PR (const PSET &pset, NNC_Polyhedron &mu_space)
 Like all_affine_ranking_functions_MS() but using the method by Podelski and Rybalchenko [BMPZ10].

Define Documentation

#define PRINT_DEBUG_INFO   0

Definition at line 36 of file termination.templates.hh.

Generated on Sun Feb 27 16:20:01 2011 for PPL by  doxygen 1.6.3