.:. Browse > List by authors > Moyen .:.

11 documents ordered by : Date Title first author name document type Submit date

1 - 2

Quasi-interpretations a way to control resources Bonfante G., Marion J.-Y., Moyen J.-Y. Theoretical Computer Science 412, 25 (2011) 2776-2796 [hal-00591862 - version 1]

Heap-size analysis for assembly programs Marion J.-Y., Moyen J.-Y. (2006) [hal-00067838 - version 1]

Quasi-interpretation: a way to control ressources Bonfante G., Marion J.-Y., Moyen J.-Y. (2005) [inria-00001257 - version 1]

Quasi-interpretations and small space bounds Bonfante G., Marion J.-Y., Moyen J.-Y. (2005) [inria-00001234 - version 1]

Synthesis of Quasi-interpretations Bonfante G., Marion J.-Y., Moyen J.-Y., Péchoux R. Dans Seventh International Workshop on Logic and Computational Complexity - LCC 2005 (2005) [inria-00000660 - version 1]

On complexity analysis by quasi-interpretation Bonfante G., Marion J.-Y., Moyen J.-Y. In 2nd Appsem II workshop - APPSEM'04 (2004) 85-95 [inria-00100099 - version 1]

Termination and resource analysis of assembly programs by Petri nets Marion J.-Y., Moyen J.-Y. N° A03-R-348 || marion03a (2003) [inria-00147587 - version 1]

An Analyser of Rewriting Systems Complexity Moyen J.-Y. In Workshop on Implicit Computational Complexity (2001) 93-99 [hal-00153132 - version 1]

On lexicographic termination ordering with space bound certifications Bonfante G., Marion J.-Y., Moyen J.-Y. In International Andrei Ershov Memorial Conference - PSI'01 2244 (2001) 482-493 [inria-00100523 - version 1]

System presentation: An analyser of rewriting system complexity Moyen J.-Y. In Second International Workshop on Rule-Based Programming - RULE'01 59/4 (2001) 7 p [inria-00100525 - version 1]