Quasi-interpretation Synthesis by Decomposition
Identifieur interne : 002B55 ( Istex/Corpus ); précédent : 002B54; suivant : 002B56Quasi-interpretation Synthesis by Decomposition
Auteurs : Guillaume Bonfante ; Jean-Yves Marion ; Romain PéchouxSource :
- Lecture Notes in Computer Science [ 0302-9743 ]
Abstract
Abstract: Quasi-interpretation analysis belongs to the field of implicit computational complexity (ICC) and has shown its interest to deal with resource analysis of first-order functional programs, which are terminating or not. In this paper, we tackle the issue of program decomposition wrt quasi-interpretations analysis. For that purpose, we use the notion of modularity. Firstly, modularity decreases the complexity of the quasi-interpretation search algorithms. Secondly, modularity increases the intentionality of the quasi-interpretation method, that is the number of captured programs. Finally, we take advantage of modularity conditions to extend smoothly quasi-interpretations to higher-order programs. We study the modularity of quasi-interpretations through the notions of constructor-sharing and hierarchical unions of programs. We show that, in both cases, the existence of quasi-interpretations is no longer a modular property. However, we can still certify the complexity of programs by showing, under some restrictions, that the size of the values computed by a program remains polynomially bounded by the inputs size.
Url:
DOI: 10.1007/978-3-540-75292-9_28
Links to Exploration step
ISTEX:B7AD047A197CA9BDA641EBDACEB0C8BF30823A7FLe document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Quasi-interpretation Synthesis by Decomposition</title><author><name sortKey="Bonfante, Guillaume" sort="Bonfante, Guillaume" uniqKey="Bonfante G" first="Guillaume" last="Bonfante">Guillaume Bonfante</name><affiliation><mods:affiliation>Nancy-Université, Loria, Carte team, B.P. 239, 54506 Vandœuvre-lès-Nancy Cedex, France, and École Nationale Supérieure des Mines de Nancy, INPL, France</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: Guillaume.Bonfante@loria.fr</mods:affiliation></affiliation></author><author><name sortKey="Marion, Jean Yves" sort="Marion, Jean Yves" uniqKey="Marion J" first="Jean-Yves" last="Marion">Jean-Yves Marion</name><affiliation><mods:affiliation>Nancy-Université, Loria, Carte team, B.P. 239, 54506 Vandœuvre-lès-Nancy Cedex, France, and École Nationale Supérieure des Mines de Nancy, INPL, France</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: Jean-Yves.Marion@loria.fr</mods:affiliation></affiliation></author><author><name sortKey="Pechoux, Romain" sort="Pechoux, Romain" uniqKey="Pechoux R" first="Romain" last="Péchoux">Romain Péchoux</name><affiliation><mods:affiliation>Nancy-Université, Loria, Carte team, B.P. 239, 54506 Vandœuvre-lès-Nancy Cedex, France, and École Nationale Supérieure des Mines de Nancy, INPL, France</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: Romain.Pechoux@loria.fr</mods:affiliation></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:B7AD047A197CA9BDA641EBDACEB0C8BF30823A7F</idno><date when="2007" year="2007">2007</date><idno type="doi">10.1007/978-3-540-75292-9_28</idno><idno type="url">https://api.istex.fr/ark:/67375/HCB-ZZDZNFTN-7/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">002B55</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">002B55</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Quasi-interpretation Synthesis by Decomposition</title><author><name sortKey="Bonfante, Guillaume" sort="Bonfante, Guillaume" uniqKey="Bonfante G" first="Guillaume" last="Bonfante">Guillaume Bonfante</name><affiliation><mods:affiliation>Nancy-Université, Loria, Carte team, B.P. 239, 54506 Vandœuvre-lès-Nancy Cedex, France, and École Nationale Supérieure des Mines de Nancy, INPL, France</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: Guillaume.Bonfante@loria.fr</mods:affiliation></affiliation></author><author><name sortKey="Marion, Jean Yves" sort="Marion, Jean Yves" uniqKey="Marion J" first="Jean-Yves" last="Marion">Jean-Yves Marion</name><affiliation><mods:affiliation>Nancy-Université, Loria, Carte team, B.P. 239, 54506 Vandœuvre-lès-Nancy Cedex, France, and École Nationale Supérieure des Mines de Nancy, INPL, France</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: Jean-Yves.Marion@loria.fr</mods:affiliation></affiliation></author><author><name sortKey="Pechoux, Romain" sort="Pechoux, Romain" uniqKey="Pechoux R" first="Romain" last="Péchoux">Romain Péchoux</name><affiliation><mods:affiliation>Nancy-Université, Loria, Carte team, B.P. 239, 54506 Vandœuvre-lès-Nancy Cedex, France, and École Nationale Supérieure des Mines de Nancy, INPL, France</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: Romain.Pechoux@loria.fr</mods:affiliation></affiliation></author></analytic><monogr></monogr><series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: Quasi-interpretation analysis belongs to the field of implicit computational complexity (ICC) and has shown its interest to deal with resource analysis of first-order functional programs, which are terminating or not. In this paper, we tackle the issue of program decomposition wrt quasi-interpretations analysis. For that purpose, we use the notion of modularity. Firstly, modularity decreases the complexity of the quasi-interpretation search algorithms. Secondly, modularity increases the intentionality of the quasi-interpretation method, that is the number of captured programs. Finally, we take advantage of modularity conditions to extend smoothly quasi-interpretations to higher-order programs. We study the modularity of quasi-interpretations through the notions of constructor-sharing and hierarchical unions of programs. We show that, in both cases, the existence of quasi-interpretations is no longer a modular property. However, we can still certify the complexity of programs by showing, under some restrictions, that the size of the values computed by a program remains polynomially bounded by the inputs size.</div></front></TEI><istex><corpusName>springer-ebooks</corpusName><author><json:item><name>Guillaume Bonfante</name><affiliations><json:string>Nancy-Université, Loria, Carte team, B.P. 239, 54506 Vandœuvre-lès-Nancy Cedex, France, and École Nationale Supérieure des Mines de Nancy, INPL, France</json:string><json:string>E-mail: Guillaume.Bonfante@loria.fr</json:string></affiliations></json:item><json:item><name>Jean-Yves Marion</name><affiliations><json:string>Nancy-Université, Loria, Carte team, B.P. 239, 54506 Vandœuvre-lès-Nancy Cedex, France, and École Nationale Supérieure des Mines de Nancy, INPL, France</json:string><json:string>E-mail: Jean-Yves.Marion@loria.fr</json:string></affiliations></json:item><json:item><name>Romain Péchoux</name><affiliations><json:string>Nancy-Université, Loria, Carte team, B.P. 239, 54506 Vandœuvre-lès-Nancy Cedex, France, and École Nationale Supérieure des Mines de Nancy, INPL, France</json:string><json:string>E-mail: Romain.Pechoux@loria.fr</json:string></affiliations></json:item></author><arkIstex>ark:/67375/HCB-ZZDZNFTN-7</arkIstex><language><json:string>eng</json:string></language><originalGenre><json:string>OriginalPaper</json:string></originalGenre><abstract>Abstract: Quasi-interpretation analysis belongs to the field of implicit computational complexity (ICC) and has shown its interest to deal with resource analysis of first-order functional programs, which are terminating or not. In this paper, we tackle the issue of program decomposition wrt quasi-interpretations analysis. For that purpose, we use the notion of modularity. Firstly, modularity decreases the complexity of the quasi-interpretation search algorithms. Secondly, modularity increases the intentionality of the quasi-interpretation method, that is the number of captured programs. Finally, we take advantage of modularity conditions to extend smoothly quasi-interpretations to higher-order programs. We study the modularity of quasi-interpretations through the notions of constructor-sharing and hierarchical unions of programs. We show that, in both cases, the existence of quasi-interpretations is no longer a modular property. However, we can still certify the complexity of programs by showing, under some restrictions, that the size of the values computed by a program remains polynomially bounded by the inputs size.</abstract><qualityIndicators><score>8.872</score><pdfWordCount>6152</pdfWordCount><pdfCharCount>30038</pdfCharCount><pdfVersion>1.3</pdfVersion><pdfPageCount>15</pdfPageCount><pdfPageSize>430 x 660 pts</pdfPageSize><refBibsNative>false</refBibsNative><abstractWordCount>156</abstractWordCount><abstractCharCount>1135</abstractCharCount><keywordCount>0</keywordCount></qualityIndicators><title>Quasi-interpretation Synthesis by Decomposition</title><chapterId><json:string>28</json:string><json:string>Chap28</json:string></chapterId><genre><json:string>conference</json:string></genre><serie><title>Lecture Notes in Computer Science</title><language><json:string>unknown</json:string></language><copyrightDate>2007</copyrightDate><issn><json:string>0302-9743</json:string></issn><eissn><json:string>1611-3349</json:string></eissn><editor><json:item><name>David Hutchison</name></json:item><json:item><name>Takeo Kanade</name></json:item><json:item><name>Josef Kittler</name></json:item><json:item><name>Jon M. Kleinberg</name></json:item><json:item><name>Friedemann Mattern</name></json:item><json:item><name>John C. Mitchell</name></json:item><json:item><name>Moni Naor</name></json:item><json:item><name>Oscar Nierstrasz</name></json:item><json:item><name>C. Pandu Rangan</name></json:item><json:item><name>Bernhard Steffen</name></json:item><json:item><name>Madhu Sudan</name></json:item><json:item><name>Demetri Terzopoulos</name></json:item><json:item><name>Doug Tygar</name></json:item><json:item><name>Moshe Y. Vardi</name></json:item><json:item><name>Gerhard Weikum</name></json:item></editor></serie><host><title>Theoretical Aspects of Computing – ICTAC 2007</title><language><json:string>unknown</json:string></language><copyrightDate>2007</copyrightDate><doi><json:string>10.1007/978-3-540-75292-9</json:string></doi><issn><json:string>0302-9743</json:string></issn><eissn><json:string>1611-3349</json:string></eissn><eisbn><json:string>978-3-540-75292-9</json:string></eisbn><bookId><json:string>978-3-540-75292-9</json:string></bookId><isbn><json:string>978-3-540-75290-5</json:string></isbn><volume>4711</volume><pages><first>410</first><last>424</last></pages><genre><json:string>book-series</json:string></genre><editor><json:item><name>Cliff B. Jones</name></json:item><json:item><name>Zhiming Liu</name></json:item><json:item><name>Jim Woodcock</name></json:item></editor><subject><json:item><value>Computer Science</value></json:item><json:item><value>Computer Science</value></json:item><json:item><value>Computation by Abstract Devices</value></json:item><json:item><value>Logics and Meanings of Programs</value></json:item><json:item><value>Mathematical Logic and Formal Languages</value></json:item><json:item><value>Programming Languages, Compilers, Interpreters</value></json:item><json:item><value>Software Engineering</value></json:item><json:item><value>Computer Communication Networks</value></json:item></subject></host><ark><json:string>ark:/67375/HCB-ZZDZNFTN-7</json:string></ark><publicationDate>2007</publicationDate><copyrightDate>2007</copyrightDate><doi><json:string>10.1007/978-3-540-75292-9_28</json:string></doi><id>B7AD047A197CA9BDA641EBDACEB0C8BF30823A7F</id><score>1</score><fulltext><json:item><extension>pdf</extension><original>true</original><mimetype>application/pdf</mimetype><uri>https://api.istex.fr/ark:/67375/HCB-ZZDZNFTN-7/fulltext.pdf</uri></json:item><json:item><extension>zip</extension><original>false</original><mimetype>application/zip</mimetype><uri>https://api.istex.fr/ark:/67375/HCB-ZZDZNFTN-7/bundle.zip</uri></json:item><istex:fulltextTEI uri="https://api.istex.fr/ark:/67375/HCB-ZZDZNFTN-7/fulltext.tei"><teiHeader><fileDesc><titleStmt><title level="a" type="main" xml:lang="en">Quasi-interpretation Synthesis by Decomposition</title></titleStmt><publicationStmt><authority>ISTEX</authority><availability><licence>Springer-Verlag Berlin Heidelberg</licence></availability><date when="2007">2007</date></publicationStmt><notesStmt><note type="conference" source="proceedings" scheme="https://content-type.data.istex.fr/ark:/67375/XTP-BFHXPBJJ-3">conference</note><note type="publication-type" subtype="book-series" scheme="https://publication-type.data.istex.fr/ark:/67375/JMC-0G6R5W5T-Z">book-series</note></notesStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Quasi-interpretation Synthesis by Decomposition</title><author><persName><forename type="first">Guillaume</forename><surname>Bonfante</surname></persName><email>Guillaume.Bonfante@loria.fr</email><affiliation><orgName type="institution">Nancy-Université, Loria, Carte team, B.P. 239, 54506 Vandœuvre-lès-Nancy Cedex, France, and École Nationale Supérieure des Mines de Nancy, INPL</orgName><address><country key="FR">FRANCE</country></address></affiliation></author><author><persName><forename type="first">Jean-Yves</forename><surname>Marion</surname></persName><email>Jean-Yves.Marion@loria.fr</email><affiliation><orgName type="institution">Nancy-Université, Loria, Carte team, B.P. 239, 54506 Vandœuvre-lès-Nancy Cedex, France, and École Nationale Supérieure des Mines de Nancy, INPL</orgName><address><country key="FR">FRANCE</country></address></affiliation></author><author><persName><forename type="first">Romain</forename><surname>Péchoux</surname></persName><email>Romain.Pechoux@loria.fr</email><affiliation><orgName type="institution">Nancy-Université, Loria, Carte team, B.P. 239, 54506 Vandœuvre-lès-Nancy Cedex, France, and École Nationale Supérieure des Mines de Nancy, INPL</orgName><address><country key="FR">FRANCE</country></address></affiliation></author><idno type="istex">B7AD047A197CA9BDA641EBDACEB0C8BF30823A7F</idno><idno type="ark">ark:/67375/HCB-ZZDZNFTN-7</idno><idno type="DOI">10.1007/978-3-540-75292-9_28</idno></analytic><monogr><title level="m" type="main">Theoretical Aspects of Computing – ICTAC 2007</title><title level="m" type="sub">4th International Colloquium, Macau, China, September 26-28, 2007. Proceedings</title><idno type="DOI">10.1007/978-3-540-75292-9</idno><idno type="book-id">978-3-540-75292-9</idno><idno type="ISBN">978-3-540-75290-5</idno><idno type="eISBN">978-3-540-75292-9</idno><idno type="chapter-id">Chap28</idno><editor><persName><forename type="first">Cliff</forename><forename type="first">B.</forename><surname>Jones</surname></persName><email>cliff.jones@ncl.ac.uk</email></editor><editor><persName><forename type="first">Zhiming</forename><surname>Liu</surname></persName><email>z.liu@iist.unu.edu</email></editor><editor><persName><forename type="first">Jim</forename><surname>Woodcock</surname></persName><email>jim@cs.york.ac.uk</email></editor><imprint><biblScope unit="vol">4711</biblScope><biblScope unit="page" from="410">410</biblScope><biblScope unit="page" to="424">424</biblScope><biblScope unit="chapter-count">32</biblScope></imprint></monogr><series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title><editor><persName><forename type="first">David</forename><surname>Hutchison</surname></persName></editor><editor><persName><forename type="first">Takeo</forename><surname>Kanade</surname></persName></editor><editor><persName><forename type="first">Josef</forename><surname>Kittler</surname></persName></editor><editor><persName><forename type="first">Jon</forename><forename type="first">M.</forename><surname>Kleinberg</surname></persName></editor><editor><persName><forename type="first">Friedemann</forename><surname>Mattern</surname></persName></editor><editor><persName><forename type="first">John</forename><forename type="first">C.</forename><surname>Mitchell</surname></persName></editor><editor><persName><forename type="first">Moni</forename><surname>Naor</surname></persName></editor><editor><persName><forename type="first">Oscar</forename><surname>Nierstrasz</surname></persName></editor><editor><persName><forename type="first">C.</forename><surname>Pandu Rangan</surname></persName></editor><editor><persName><forename type="first">Bernhard</forename><surname>Steffen</surname></persName></editor><editor><persName><forename type="first">Madhu</forename><surname>Sudan</surname></persName></editor><editor><persName><forename type="first">Demetri</forename><surname>Terzopoulos</surname></persName></editor><editor><persName><forename type="first">Doug</forename><surname>Tygar</surname></persName></editor><editor><persName><forename type="first">Moshe</forename><forename type="first">Y.</forename><surname>Vardi</surname></persName></editor><editor><persName><forename type="first">Gerhard</forename><surname>Weikum</surname></persName></editor><idno type="pISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="seriesID">558</idno></series></biblStruct></sourceDesc></fileDesc><profileDesc><abstract xml:lang="en"><head>Abstract</head><p>Quasi-interpretation analysis belongs to the field of <hi rend="italic">implicit computational complexity (ICC)</hi> and has shown its interest to deal with resource analysis of first-order functional programs, which are terminating or not. In this paper, we tackle the issue of program decomposition wrt quasi-interpretations analysis. For that purpose, we use the notion of modularity. Firstly, modularity decreases the complexity of the quasi-interpretation search algorithms. Secondly, modularity increases the intentionality of the quasi-interpretation method, that is the number of captured programs. Finally, we take advantage of modularity conditions to extend smoothly quasi-interpretations to higher-order programs.</p><p>We study the modularity of quasi-interpretations through the notions of constructor-sharing and hierarchical unions of programs. We show that, in both cases, the existence of quasi-interpretations is no longer a modular property. However, we can still certify the complexity of programs by showing, under some restrictions, that the size of the values computed by a program remains polynomially bounded by the inputs size.</p></abstract><textClass ana="subject"><keywords scheme="book-subject-collection"><list><label>SUCO11645</label><item><term>Computer Science</term></item></list></keywords></textClass><textClass ana="subject"><keywords scheme="book-subject"><list><label>I</label><item><term type="Primary">Computer Science</term></item><label>I16013</label><item><term type="Secondary" subtype="priority-1">Computation by Abstract Devices</term></item><label>I1603X</label><item><term type="Secondary" subtype="priority-2">Logics and Meanings of Programs</term></item><label>I16048</label><item><term type="Secondary" subtype="priority-3">Mathematical Logic and Formal Languages</term></item><label>I14037</label><item><term type="Secondary" subtype="priority-4">Programming Languages, Compilers, Interpreters</term></item><label>I14029</label><item><term type="Secondary" subtype="priority-5">Software Engineering</term></item><label>I13022</label><item><term type="Secondary" subtype="priority-6">Computer Communication Networks</term></item></list></keywords></textClass><langUsage><language ident="EN"></language></langUsage></profileDesc></teiHeader></istex:fulltextTEI><json:item><extension>txt</extension><original>false</original><mimetype>text/plain</mimetype><uri>https://api.istex.fr/ark:/67375/HCB-ZZDZNFTN-7/fulltext.txt</uri></json:item></fulltext><metadata><istex:metadataXml wicri:clean="corpus springer-ebooks not found" wicri:toSee="no header"><istex:xmlDeclaration>version="1.0" encoding="UTF-8"</istex:xmlDeclaration><istex:docType PUBLIC="-//Springer-Verlag//DTD A++ V2.4//EN" URI="http://devel.springer.de/A++/V2.4/DTD/A++V2.4.dtd" name="istex:docType"></istex:docType><istex:document><Publisher><PublisherInfo><PublisherName>Springer Berlin Heidelberg</PublisherName><PublisherLocation>Berlin, Heidelberg</PublisherLocation></PublisherInfo><Series><SeriesInfo SeriesType="Series" TocLevels="0"><SeriesID>558</SeriesID><SeriesPrintISSN>0302-9743</SeriesPrintISSN><SeriesElectronicISSN>1611-3349</SeriesElectronicISSN><SeriesTitle Language="En">Lecture Notes in Computer Science</SeriesTitle></SeriesInfo><SeriesHeader><EditorGroup><Editor><EditorName DisplayOrder="Western"><GivenName>David</GivenName><FamilyName>Hutchison</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>Takeo</GivenName><FamilyName>Kanade</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>Josef</GivenName><FamilyName>Kittler</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>Jon</GivenName><GivenName>M.</GivenName><FamilyName>Kleinberg</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>Friedemann</GivenName><FamilyName>Mattern</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>John</GivenName><GivenName>C.</GivenName><FamilyName>Mitchell</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>Moni</GivenName><FamilyName>Naor</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>Oscar</GivenName><FamilyName>Nierstrasz</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>C.</GivenName><FamilyName>Pandu Rangan</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>Bernhard</GivenName><FamilyName>Steffen</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>Madhu</GivenName><FamilyName>Sudan</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>Demetri</GivenName><FamilyName>Terzopoulos</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>Doug</GivenName><FamilyName>Tygar</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>Moshe</GivenName><GivenName>Y.</GivenName><FamilyName>Vardi</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>Gerhard</GivenName><FamilyName>Weikum</FamilyName></EditorName></Editor></EditorGroup></SeriesHeader><Book Language="En"><BookInfo BookProductType="Proceedings" ContainsESM="No" Language="En" MediaType="eBook" NumberingStyle="Unnumbered" OutputMedium="All" TocLevels="0"><BookID>978-3-540-75292-9</BookID><BookTitle>Theoretical Aspects of Computing – ICTAC 2007</BookTitle><BookSubTitle>4th International Colloquium, Macau, China, September 26-28, 2007. Proceedings</BookSubTitle><BookVolumeNumber>4711</BookVolumeNumber><BookSequenceNumber>4711</BookSequenceNumber><BookDOI>10.1007/978-3-540-75292-9</BookDOI><BookTitleID>156902</BookTitleID><BookPrintISBN>978-3-540-75290-5</BookPrintISBN><BookElectronicISBN>978-3-540-75292-9</BookElectronicISBN><BookChapterCount>32</BookChapterCount><BookCopyright><CopyrightHolderName>Springer-Verlag Berlin Heidelberg</CopyrightHolderName><CopyrightYear>2007</CopyrightYear></BookCopyright><BookSubjectGroup><BookSubject Code="I" Type="Primary">Computer Science</BookSubject><BookSubject Code="I16013" Priority="1" Type="Secondary">Computation by Abstract Devices</BookSubject><BookSubject Code="I1603X" Priority="2" Type="Secondary">Logics and Meanings of Programs</BookSubject><BookSubject Code="I16048" Priority="3" Type="Secondary">Mathematical Logic and Formal Languages</BookSubject><BookSubject Code="I14037" Priority="4" Type="Secondary">Programming Languages, Compilers, Interpreters</BookSubject><BookSubject Code="I14029" Priority="5" Type="Secondary">Software Engineering</BookSubject><BookSubject Code="I13022" Priority="6" Type="Secondary">Computer Communication Networks</BookSubject><SubjectCollection Code="SUCO11645">Computer Science</SubjectCollection></BookSubjectGroup></BookInfo><BookHeader><EditorGroup><Editor><EditorName DisplayOrder="Western"><GivenName>Cliff</GivenName><GivenName>B.</GivenName><FamilyName>Jones</FamilyName></EditorName><Contact><Email>cliff.jones@ncl.ac.uk</Email></Contact></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>Zhiming</GivenName><FamilyName>Liu</FamilyName></EditorName><Contact><Email>z.liu@iist.unu.edu</Email></Contact></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>Jim</GivenName><FamilyName>Woodcock</FamilyName></EditorName><Contact><Email>jim@cs.york.ac.uk</Email></Contact></Editor></EditorGroup></BookHeader><Chapter ID="Chap28" Language="En"><ChapterInfo ChapterType="OriginalPaper" ContainsESM="No" NumberingStyle="Unnumbered" TocLevels="0"><ChapterID>28</ChapterID><ChapterDOI>10.1007/978-3-540-75292-9_28</ChapterDOI><ChapterSequenceNumber>28</ChapterSequenceNumber><ChapterTitle Language="En">Quasi-interpretation Synthesis by Decomposition</ChapterTitle><ChapterSubTitle Language="En">An Application to Higher-Order Programs</ChapterSubTitle><ChapterFirstPage>410</ChapterFirstPage><ChapterLastPage>424</ChapterLastPage><ChapterCopyright><CopyrightHolderName>Springer-Verlag Berlin Heidelberg</CopyrightHolderName><CopyrightYear>2007</CopyrightYear></ChapterCopyright><ChapterGrants Type="Regular"><MetadataGrant Grant="OpenAccess"></MetadataGrant><AbstractGrant Grant="OpenAccess"></AbstractGrant><BodyPDFGrant Grant="Restricted"></BodyPDFGrant><BodyHTMLGrant Grant="Restricted"></BodyHTMLGrant><BibliographyGrant Grant="Restricted"></BibliographyGrant><ESMGrant Grant="Restricted"></ESMGrant></ChapterGrants><ChapterContext><SeriesID>558</SeriesID><BookID>978-3-540-75292-9</BookID><BookTitle>Theoretical Aspects of Computing – ICTAC 2007</BookTitle></ChapterContext></ChapterInfo><ChapterHeader><AuthorGroup><Author AffiliationIDS="Aff1"><AuthorName DisplayOrder="Western"><GivenName>Guillaume</GivenName><FamilyName>Bonfante</FamilyName></AuthorName><Contact><Email>Guillaume.Bonfante@loria.fr</Email></Contact></Author><Author AffiliationIDS="Aff1"><AuthorName DisplayOrder="Western"><GivenName>Jean-Yves</GivenName><FamilyName>Marion</FamilyName></AuthorName><Contact><Email>Jean-Yves.Marion@loria.fr</Email></Contact></Author><Author AffiliationIDS="Aff1"><AuthorName DisplayOrder="Western"><GivenName>Romain</GivenName><FamilyName>Péchoux</FamilyName></AuthorName><Contact><Email>Romain.Pechoux@loria.fr</Email></Contact></Author><Affiliation ID="Aff1"><OrgName>Nancy-Université, Loria, Carte team, B.P. 239, 54506 Vandœuvre-lès-Nancy Cedex, France, and École Nationale Supérieure des Mines de Nancy, INPL</OrgName><OrgAddress><Country>France</Country></OrgAddress></Affiliation></AuthorGroup><Abstract ID="Abs1" Language="En"><Heading>Abstract</Heading><Para>Quasi-interpretation analysis belongs to the field of <Emphasis Type="Italic">implicit computational complexity (ICC)</Emphasis> and has shown its interest to deal with resource analysis of first-order functional programs, which are terminating or not. In this paper, we tackle the issue of program decomposition wrt quasi-interpretations analysis. For that purpose, we use the notion of modularity. Firstly, modularity decreases the complexity of the quasi-interpretation search algorithms. Secondly, modularity increases the intentionality of the quasi-interpretation method, that is the number of captured programs. Finally, we take advantage of modularity conditions to extend smoothly quasi-interpretations to higher-order programs.</Para><Para>We study the modularity of quasi-interpretations through the notions of constructor-sharing and hierarchical unions of programs. We show that, in both cases, the existence of quasi-interpretations is no longer a modular property. However, we can still certify the complexity of programs by showing, under some restrictions, that the size of the values computed by a program remains polynomially bounded by the inputs size.</Para></Abstract></ChapterHeader><NoBody></NoBody></Chapter></Book></Series></Publisher></istex:document></istex:metadataXml><mods version="3.6"><titleInfo lang="en"><title>Quasi-interpretation Synthesis by Decomposition</title><subTitle>An Application to Higher-Order Programs</subTitle></titleInfo><titleInfo type="alternative" contentType="CDATA"><title>Quasi-interpretation Synthesis by Decomposition</title></titleInfo><name type="personal"><namePart type="given">Guillaume</namePart><namePart type="family">Bonfante</namePart><affiliation>Nancy-Université, Loria, Carte team, B.P. 239, 54506 Vandœuvre-lès-Nancy Cedex, France, and École Nationale Supérieure des Mines de Nancy, INPL, France</affiliation><affiliation>E-mail: Guillaume.Bonfante@loria.fr</affiliation><role><roleTerm type="text">author</roleTerm></role></name><name type="personal"><namePart type="given">Jean-Yves</namePart><namePart type="family">Marion</namePart><affiliation>Nancy-Université, Loria, Carte team, B.P. 239, 54506 Vandœuvre-lès-Nancy Cedex, France, and École Nationale Supérieure des Mines de Nancy, INPL, France</affiliation><affiliation>E-mail: Jean-Yves.Marion@loria.fr</affiliation><role><roleTerm type="text">author</roleTerm></role></name><name type="personal"><namePart type="given">Romain</namePart><namePart type="family">Péchoux</namePart><affiliation>Nancy-Université, Loria, Carte team, B.P. 239, 54506 Vandœuvre-lès-Nancy Cedex, France, and École Nationale Supérieure des Mines de Nancy, INPL, France</affiliation><affiliation>E-mail: Romain.Pechoux@loria.fr</affiliation><role><roleTerm type="text">author</roleTerm></role></name><typeOfResource>text</typeOfResource><genre displayLabel="OriginalPaper" authority="ISTEX" authorityURI="https://content-type.data.istex.fr" type="conference" valueURI="https://content-type.data.istex.fr/ark:/67375/XTP-BFHXPBJJ-3">conference</genre><originInfo><publisher>Springer Berlin Heidelberg</publisher><place><placeTerm type="text">Berlin, Heidelberg</placeTerm></place><dateIssued encoding="w3cdtf">2007</dateIssued><copyrightDate encoding="w3cdtf">2007</copyrightDate></originInfo><language><languageTerm type="code" authority="rfc3066">en</languageTerm><languageTerm type="code" authority="iso639-2b">eng</languageTerm></language><abstract lang="en">Abstract: Quasi-interpretation analysis belongs to the field of implicit computational complexity (ICC) and has shown its interest to deal with resource analysis of first-order functional programs, which are terminating or not. In this paper, we tackle the issue of program decomposition wrt quasi-interpretations analysis. For that purpose, we use the notion of modularity. Firstly, modularity decreases the complexity of the quasi-interpretation search algorithms. Secondly, modularity increases the intentionality of the quasi-interpretation method, that is the number of captured programs. Finally, we take advantage of modularity conditions to extend smoothly quasi-interpretations to higher-order programs. We study the modularity of quasi-interpretations through the notions of constructor-sharing and hierarchical unions of programs. We show that, in both cases, the existence of quasi-interpretations is no longer a modular property. However, we can still certify the complexity of programs by showing, under some restrictions, that the size of the values computed by a program remains polynomially bounded by the inputs size.</abstract><relatedItem type="host"><titleInfo><title>Theoretical Aspects of Computing – ICTAC 2007</title><subTitle>4th International Colloquium, Macau, China, September 26-28, 2007. Proceedings</subTitle></titleInfo><name type="personal"><namePart type="given">Cliff</namePart><namePart type="given">B.</namePart><namePart type="family">Jones</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Zhiming</namePart><namePart type="family">Liu</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Jim</namePart><namePart type="family">Woodcock</namePart><role><roleTerm type="text">editor</roleTerm></role></name><genre type="book-series" authority="ISTEX" authorityURI="https://publication-type.data.istex.fr" valueURI="https://publication-type.data.istex.fr/ark:/67375/JMC-0G6R5W5T-Z">book-series</genre><originInfo><publisher>Springer</publisher><copyrightDate encoding="w3cdtf">2007</copyrightDate><issuance>monographic</issuance></originInfo><subject><genre>Book-Subject-Collection</genre><topic authority="SpringerSubjectCodes" authorityURI="SUCO11645">Computer Science</topic></subject><subject><genre>Book-Subject-Group</genre><topic authority="SpringerSubjectCodes" authorityURI="I">Computer Science</topic><topic authority="SpringerSubjectCodes" authorityURI="I16013">Computation by Abstract Devices</topic><topic authority="SpringerSubjectCodes" authorityURI="I1603X">Logics and Meanings of Programs</topic><topic authority="SpringerSubjectCodes" authorityURI="I16048">Mathematical Logic and Formal Languages</topic><topic authority="SpringerSubjectCodes" authorityURI="I14037">Programming Languages, Compilers, Interpreters</topic><topic authority="SpringerSubjectCodes" authorityURI="I14029">Software Engineering</topic><topic authority="SpringerSubjectCodes" authorityURI="I13022">Computer Communication Networks</topic></subject><identifier type="DOI">10.1007/978-3-540-75292-9</identifier><identifier type="ISBN">978-3-540-75290-5</identifier><identifier type="eISBN">978-3-540-75292-9</identifier><identifier type="ISSN">0302-9743</identifier><identifier type="eISSN">1611-3349</identifier><identifier type="BookTitleID">156902</identifier><identifier type="BookID">978-3-540-75292-9</identifier><identifier type="BookChapterCount">32</identifier><identifier type="BookVolumeNumber">4711</identifier><identifier type="BookSequenceNumber">4711</identifier><part><date>2007</date><detail type="volume"><number>4711</number><caption>vol.</caption></detail><extent unit="pages"><start>410</start><end>424</end></extent></part><recordInfo><recordOrigin>Springer-Verlag Berlin Heidelberg, 2007</recordOrigin></recordInfo></relatedItem><relatedItem type="series"><titleInfo><title>Lecture Notes in Computer Science</title></titleInfo><name type="personal"><namePart type="given">David</namePart><namePart type="family">Hutchison</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Takeo</namePart><namePart type="family">Kanade</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Josef</namePart><namePart type="family">Kittler</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Jon</namePart><namePart type="given">M.</namePart><namePart type="family">Kleinberg</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Friedemann</namePart><namePart type="family">Mattern</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">John</namePart><namePart type="given">C.</namePart><namePart type="family">Mitchell</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Moni</namePart><namePart type="family">Naor</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Oscar</namePart><namePart type="family">Nierstrasz</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">C.</namePart><namePart type="family">Pandu Rangan</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Bernhard</namePart><namePart type="family">Steffen</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Madhu</namePart><namePart type="family">Sudan</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Demetri</namePart><namePart type="family">Terzopoulos</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Doug</namePart><namePart type="family">Tygar</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Moshe</namePart><namePart type="given">Y.</namePart><namePart type="family">Vardi</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Gerhard</namePart><namePart type="family">Weikum</namePart><role><roleTerm type="text">editor</roleTerm></role></name><originInfo><publisher>Springer</publisher><copyrightDate encoding="w3cdtf">2007</copyrightDate><issuance>serial</issuance></originInfo><identifier type="ISSN">0302-9743</identifier><identifier type="eISSN">1611-3349</identifier><identifier type="SeriesID">558</identifier><recordInfo><recordOrigin>Springer-Verlag Berlin Heidelberg, 2007</recordOrigin></recordInfo></relatedItem><identifier type="istex">B7AD047A197CA9BDA641EBDACEB0C8BF30823A7F</identifier><identifier type="ark">ark:/67375/HCB-ZZDZNFTN-7</identifier><identifier type="DOI">10.1007/978-3-540-75292-9_28</identifier><identifier type="ChapterID">28</identifier><identifier type="ChapterID">Chap28</identifier><accessCondition type="use and reproduction" contentType="copyright">Springer-Verlag Berlin Heidelberg, 2007</accessCondition><recordInfo><recordContentSource authority="ISTEX" authorityURI="https://loaded-corpus.data.istex.fr" valueURI="https://loaded-corpus.data.istex.fr/ark:/67375/XBH-RLRX46XW-4">springer</recordContentSource><recordOrigin>Springer-Verlag Berlin Heidelberg, 2007</recordOrigin></recordInfo></mods><json:item><extension>json</extension><original>false</original><mimetype>application/json</mimetype><uri>https://api.istex.fr/ark:/67375/HCB-ZZDZNFTN-7/record.json</uri></json:item></metadata></istex></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Istex/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 002B55 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Corpus/biblio.hfd -nk 002B55 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Istex
|étape= Corpus
|type= RBID
|clé= ISTEX:B7AD047A197CA9BDA641EBDACEB0C8BF30823A7F
|texte= Quasi-interpretation Synthesis by Decomposition
}}
| This area was generated with Dilib version V0.6.33. |  |