1 Search Results for "Pechoux, Romain"

Document
DOI: 10.4230/LIPIcs.FSTTCS.2008.1763
Analyzing the Implicit Computational Complexity of object-oriented programs

Authors: Jean-Yves Marion and Romain Pechoux

Published in: LIPIcs, Volume 2, IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (2008)

Abstract
A sup-interpretation is a tool which provides upper bounds on the size of the values computed by the function symbols of a program. Sup-interpretations have shown their interest to deal with the complexity of first order functional programs. This paper is an attempt to adapt the framework of sup-interpretations to a fragment of object-oriented programs, including loop and while constructs and methods with side effects. We give a criterion, called brotherly criterion, which uses the notion of sup-interpretation to ensure that each brotherly program computes objects whose size is polynomially bounded by the inputs sizes. Moreover we give some heuristics in order to compute the sup-interpretation of a given method.
Cite as

Jean-Yves Marion and Romain Pechoux. Analyzing the Implicit Computational Complexity of object-oriented programs. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 2, pp. 316-327, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)

Copy BibTex To Clipboard

@InProceedings{marion_et_al:LIPIcs.FSTTCS.2008.1763,
  author =	{Marion, Jean-Yves and Pechoux, Romain},
  title =	{{Analyzing the Implicit Computational Complexity of object-oriented programs}},
  booktitle =	{IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science},
  pages =	{316--327},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-08-8},
  ISSN =	{1868-8969},
  year =	{2008},
  volume =	{2},
  editor =	{Hariharan, Ramesh and Mukund, Madhavan and Vinay, V},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2008.1763},
  URN =		{urn:nbn:de:0030-drops-17638},
  doi =		{10.4230/LIPIcs.FSTTCS.2008.1763},
  annote =	{Keywords: Implicit computational complexity, object-oriented programs, sup-interpretation, resource upper bounds}
}
  • Refine by Author
  • 1 Marion, Jean-Yves
  • 1 Pechoux, Romain

  • Refine by Classification

  • Refine by Keyword
  • 1 Implicit computational complexity
  • 1 object-oriented programs
  • 1 resource upper bounds
  • 1 sup-interpretation

  • Refine by Type
  • 1 document

  • Refine by Publication Year
  • 1 2008

Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact