Max-plus quasi-interpretations

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2701, Issue , 2003, Pages 31-45

  Amadio, Roberto M ^a  

^a AIX MARSEILLE UNIV   (France)

Author keywords

Function algebras and implicit computational complexity; Functional languages and term rewriting; Polynomial interpretations and max plus algebras; Static analysis

Indexed keywords

BIOMINERALIZATION; COMPUTATIONAL COMPLEXITY; STATIC ANALYSIS; SYNTHESIS (CHEMICAL);

BINARY OPERATIONS; FIRST-ORDER FUNCTIONAL PROGRAMS; IMPLICIT COMPUTATIONAL COMPLEXITY; POLYNOMIAL INTERPRETATIONS AND MAX-PLUS ALGEBRAS; QUASI-INTERPRETATION; SYNTHESIS PROBLEMS; TERM REWRITING; TERM REWRITING SYSTEMS;

ALGEBRA;

EID: 33745959728     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44904-3_3     Document Type: Article

References (21)

1. R. Amadio. Max-plus quasi-interpretations. Research Report Laboratoire d'Informatique Fondamentale de Marseille 10-2002, December 2002.
2. S. Bellantoni and S. Cook. A new recursion-theoretic characterization of the polytime functions. Computational Complexity, 2:97-110, 1992.
3. F. Baccelli, G. Cohen, G. Olsder, and J.-P. Quadrat. Synchronization and linearity. Wiley, 1992.
4. G. Bonfante, J.-Y. Marion, and J.-Y. Moyen. On termination methods with space bound certifications. In Ershov 4th Int. Conf., Springer LNCS, 2001.
5. F. Baader and T. Nipkow. Term rewriting and all that. Cambridge University Press, 1998.
6. V. Caseiro. Equations for defining polytime functions. PhD thesis, University of Oslo, 1997.
7. P. Clote. Computation models and function algebras. In Proc. Logic and computational complexity, Springer Lecture Notes in Comp. Sci. 960, 1995.
8. A. Cobham. The intrinsic computational difficulty of functions. In Proc. Logic, Methodology, and Philosophy of Science II, North Holland, 1965.
9. S. Cook. Characterizations of pushdown machines in terms of time-bounded computers. Journal of the ACM, 18(1):4-18, 1971.
10. B. Gramlich. On proving termination by innermost termination. In Proc. RTA, Springer Lecture Notes in Comp. Sci. 1103, 1996.
11. M. Hofmann and S. Jost. Static prediction of heap space usage for first-order functional programs. In Proc. ACM POPL, 2003.
12. M. Hofmann. A type system for bounded space and functional in-place update. Nordic Journal of Computing, 7(4):258-289, 2000.
13. M. Hofmann. The strength of non size-increasing computation. In Proc. ACM POPL, 2002.
14. R. Hughes, L. Pareto, and A. Sabry. Proving the correctness of reactive systems using sized types. In Proc. ACM POPL, 1996.
15. N. Jones. Computability and complexity, from a programming perspective. MIT-Press, 1997.
16. D. Leivant. Predicative recurrence and computational complexity i: word recurrence and poly-time. Feasible mathematics II, Clote and Remmel (eds.), Birkhäuser: 320-343, 1994.
17. J.-Y. Marion. Complexité implicite des calculs, de la théorie à la pratique. PhD thesis, Universitè Nancy, 2000. Habilitation à diriger des recherches.
18. J.-Y. Marion and J.-Y. Moyen. Efficient first order functional program interpreter with time bound certifications. In Proc. LPAR, Springer Lecture Notes in Comp. Sci. 1955, 2000.
19. L. Pareto. Types for crash prevention. PhD thesis, Chalmers University, 2000.
20. W. Pugh. The omega test: a fast and practical integer programming algorithm for dependence analysis. In Communications of the ACM, 102-114, 1992.
21. D. Sannella. Mobile resource guarantee. Ist-global computing research proposal, U. Edinburgh, 2001. http://www.dcs.ed.ac.uk/home/mrg/.