Filtrer vos résultats
- 10
- 9
- 10
- 3
- 3
- 2
- 1
- 2
- 18
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 2
- 2
- 3
- 1
- 1
- 3
- 1
- 19
- 11
- 10
- 10
- 2
- 1
- 1
- 1
- 1
- 1
- 19
- 9
- 6
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
19 résultats
|
|
|
triés par
|
|
|
Synthesis of Quasi-interpretationsSeventh International Workshop on Logic and Computational Complexity - LCC 2005, Jun 2005, Chicago/USA
Communication dans un congrès
inria-00000660v1
|
||
|
|
On quasi-interpretations, blind abstractions and implicit complexity.Mathematical Structures in Computer Science, 2012, 22 (04), pp.549-580. ⟨10.1017/S0960129511000685⟩
Article dans une revue
hal-00798377v1
|
||
System presentation: An analyser of rewriting system complexitySecond International Workshop on Rule-Based Programming - RULE'01, Université de Florence, 2001, Firenze, Italy, 7 p
Communication dans un congrès
inria-00100525v1
|
|||
Efficient first order functional program interpreter with time bound certificationsInternational Conference on Logic Programming & Automated Reasoning - LPAR'2000, Nov 2000, Reunion Island, France, pp.25-42
Communication dans un congrès
inria-00099178v1
|
|||
|
|
Heap-size analysis for assembly programs2006
Pré-publication, Document de travail
hal-00067838v1
|
||
On complexity analysis by quasi-interpretation2nd Appsem II workshop - APPSEM'04, 2004, Tallinn, Estonia, pp.85-95
Communication dans un congrès
inria-00100099v1
|
|||
|
|
Resource Control GraphsACM Transactions on Computational Logic, 2009, 10 (4), ⟨10.1145/1555746.1555753⟩
Article dans une revue
hal-00107145v3
|
||
Quasi-interpretation: a way to control ressources[Intern report] 2005, pp.35
Rapport
inria-00001257v1
|
|||
On lexicographic termination ordering with space bound certificationsInternational Andrei Ershov Memorial Conference - PSI'01, 2001, Novosibirsk, Russia, pp.482-493
Communication dans un congrès
inria-00100523v1
|
|||
Loop Quasi-Invariant Chunk DetectionAutomated Technology for Verification and Analysis. ATVA 2017, pp.91-108, 2017, ⟨10.1007/978-3-319-68167-2_7⟩
Chapitre d'ouvrage
hal-02345688v1
|
|||
|
|
Study of the NP-completeness of the compact table problemJAC 2008, Apr 2008, Uzès, France. pp.228-237
Communication dans un congrès
hal-00274004v1
|
||
|
|
Quasi-interpretations and small space bounds[Research Report] 2005, pp.19
Rapport
inria-00001234v1
|
||
|
|
On Quasi-Interpretations, Blind Abstractions and Implicit Complexity8th International Workshop on Logic and Computational Complexity (LCC'06), August 10 - 11, 2006 (Satellite Workshop of FLOC-LICS 2006), 2006, Seattle, United States
Communication dans un congrès
hal-00023668v1
|
||
|
|
SCT and the idempotence condition2008
Pré-publication, Document de travail
hal-00278943v1
|
||
Termination and resource analysis of assembly programs by Petri nets[Research Report] A03-R-348 || marion03a, 2003, 13 p
Rapport
inria-00147587v1
|
|||
|
|
Quasi-interpretations a way to control resourcesTheoretical Computer Science, 2011, 412 (25), pp.2776-2796. ⟨10.1016/j.tcs.2011.02.007⟩
Article dans une revue
hal-00591862v1
|
||
Formal proof of polynomial-time complexity with quasi-interpretations7th ACM SIGPLAN International Conference on Certified Programs and Proofs, CPP 2018, Jan 2018, Los Angeles, United States. ⟨10.1145/3167097⟩
Communication dans un congrès
hal-01712390v1
|
|||
|
|
Detection of Non-Size Increasing Programs in CompilersDevelopment in Implicit Computational Complexity (DICE 2016), Damiano Mazza, Apr 2016, Eindhoven, Netherlands
Communication dans un congrès
hal-01310898v1
|
||
An Analyser of Rewriting Systems ComplexityWorkshop on Implicit Computational Complexity, May 2001, Aarhus, Denmark. pp.93-99
Communication dans un congrès
hal-00153132v1
|