Synthesis of Quasi-interpretations

@inproceedings{Bonfante2005SynthesisOQ,
  title={Synthesis of Quasi-interpretations},
  author={G. Bonfante and J. L. Marion and R. P{\'e}choux},
  year={2005}
}
This paper presents complexity results by showing that the synthesis of Max-Poly quasi-interpretations over R+ is decidable in exponential time with fixed polynomial degrees and fixed max-degree and that the synthesis of Max-Plus quasiinterpretations over R+ is NPtime-complete with fixed multiplicative degrees and fixed max-degree. Quasi-interpretations are a tool that allows to control resources like the runtime, the runspace or the size of a result in a program execution. Quasiinterpretations… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-10 of 17 references

A Decision Method for Elementary Algebra and Geometry

  • A. Tarski
  • 2nd ed. University of California Press
  • 1951
Highly Influential
6 Excerpts

Moyen. Quasi-interpretation and small space bounds

  • G. Bonfante, J.-Y. Marion, J.-Y
  • In 16th International Conference on Rewriting…
  • 2005
3 Excerpts

Similar Papers

Loading similar papers…