Filtrer vos résultats
- 42
- 3
- 31
- 6
- 3
- 2
- 1
- 1
- 1
- 2
- 45
- 1
- 1
- 3
- 5
- 5
- 2
- 2
- 2
- 4
- 1
- 4
- 2
- 2
- 2
- 3
- 3
- 3
- 1
- 43
- 2
- 45
- 41
- 4
- 3
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 45
- 21
- 18
- 4
- 4
- 3
- 3
- 3
- 3
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
45 résultats
|
|
triés par
|
|
Types for controlling heap and stack in JavaThird International Workshop on Foundational and Practical Aspects of Resource Analysis (FOPARA), Ugo Dal Lago and Ricardo Pena, Aug 2013, Bertinoro, Italy
Communication dans un congrès
hal-00910166v1
|
||
|
A General Noninterference Policy for Polynomial TimePOPL 23, Jan 2023, Boston, United States. pp.806 - 832, ⟨10.1145/3571221⟩
Communication dans un congrès
hal-04190355v1
|
||
|
A tier-based typed programming language characterizing Feasible FunctionalsLogical Methods in Computer Science, 2022, 18 (1), pp.31. ⟨10.46298/LMCS-18(1:33)2022⟩
Article dans une revue
hal-03722168v1
|
||
|
Algebras and Coalgebras in the Light Affine Lambda CalculusThe 20th ACM SIGPLAN International Conference on Functional Programming (ICFP 2015), Aug 2015, Vancouver, Canada
Communication dans un congrès
hal-01112165v1
|
||
|
A characterization of polynomial complexity classes using dependency pairs[Research Report] 2007, pp.12
Rapport
inria-00155287v1
|
||
|
Type-based complexity analysis for fork processes16th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS), Mar 2013, Rome, Italy. pp.305-320, ⟨10.1007/978-3-642-37075-5_20⟩
Communication dans un congrès
hal-00755450v2
|
||
|
Tiered complexity at higher orderDICE-FOPARA 2019 - Joint international workshop on Developments in Implicit Computational complExity and Foundational and Practical Aspects of Resource Analysis, Apr 2019, Praha, Czech Republic
Communication dans un congrès
hal-02499318v1
|
||
|
Sur l'efficacité des systèmes de formes normales de fonctions BooléennesLFA 2017 - 26èmes Rencontres Francophones sur la Logique Floue et ses Applications, Oct 2017, Amiens, France. pp.1-8
Communication dans un congrès
hal-01656033v1
|
||
|
Complete and tractable machine-independent characterizations of second-order polytimeFoSSaCS 2022 - 25th International Conference on Foundations of Software Science and Computation Structures, Apr 2022, Munich, Germany. pp.368-388, ⟨10.1007/978-3-030-99253-8_19⟩
Communication dans un congrès
hal-03722245v1
|
||
|
Complexity Information Flow in a Multi-threaded Imperative LanguageTAMC 2014, Apr 2014, Chennai, India. pp.124 - 140, ⟨10.1007/978-3-319-06089-7_9⟩
Communication dans un congrès
hal-01084043v1
|
||
|
Quasi-interpretation Synthesis by Decomposition : An application to higher-order programsICTAC, Sep 2007, Macao, China
Communication dans un congrès
inria-00130920v1
|
||
|
A feasible and unitary quantum programming language2024
Pré-publication, Document de travail
hal-04266203v3
|
||
|
Complexité implicite : bilan et perspectivesComplexité [cs.CC]. Université de Lorraine, 2020
HDR
tel-02978986v3
|
||
|
Type-based heap and stack space analysis in Java2013
Autre publication scientifique
hal-00773141v4
|
||
Higher order interpretations for Basic Feasible FunctionsDICE 2015 - Developments in Implicit Computational Complexity, Apr 2015, London, United Kingdom
Communication dans un congrès
hal-01207910v1
|
|||
|
A Characterization of NCk by First Order Functional Programs5th International Conference on Theory and Applications of Models of Computation - TAMC 2008, Xidian University, Apr 2008, Xian, China. pp.136-147, ⟨10.1007/978-3-540-79228-4⟩
Communication dans un congrès
inria-00332390v1
|
||
|
Objects in Polynomial TimeAPLAS 2015, Nov 2015, Pohang, South Korea. pp.387--404, ⟨10.1007/978-3-319-26529-2_21⟩
Communication dans un congrès
hal-01206161v1
|
||
|
A characterization of Alternating log time by first order functional programs13th International Conference on Logic for Programming Artificial Intelligence and Reasoning - LPAR-13, Nov 2006, Phnom Penh/Cambodia
Communication dans un congrès
inria-00110014v1
|
||
|
Synthesis of Quasi-interpretationsSeventh International Workshop on Logic and Computational Complexity - LCC 2005, Jun 2005, Chicago/USA
Communication dans un congrès
inria-00000660v1
|
||
|
Resource analysis by sup-interpretationEighth International Symposium on Functional and Logic Programming - FLOPS 2006, Apr 2006, Fuji Susono, Japan. pp.163--176, ⟨10.1007/11737414_12⟩
Communication dans un congrès
inria-00000661v2
|
||
|
Synthesis of sup-interpretations: a surveyTheoretical Computer Science, 2012, pp.24. ⟨10.1016/j.tcs.2012.11.003⟩
Article dans une revue
hal-00744915v1
|
||
|
A Type-Based Complexity Analysis of Object Oriented ProgramsInformation and Computation, 2018, Information and Computation, 261 (1), pp.78-115. ⟨10.1016/j.ic.2018.05.006⟩
Article dans une revue
hal-01712506v1
|
||
|
A tier-based typed programming language characterizing Feasible FunctionalsLICS '20 - 35th Annual ACM/IEEE Symposium on Logic in Computer Science, Jul 2020, Saarbrücken, Germany. pp.535-549, ⟨10.1145/3373718.3394768⟩
Communication dans un congrès
hal-02881308v1
|
||
Tiered complexity at higher orderMLA'2019 - Third Workshop on Mathematical Logic and its Applications, Mar 2019, Nancy, France
Communication dans un congrès
hal-02499348v1
|
|||
|
Higher order interpretations for higher order complexity8th Workshop on Developments in Implicit Computational complExity and 5th Workshop on Foundational and Practical Aspects of Resource Analysis, Apr 2017, Uppsala, Sweden
Communication dans un congrès
hal-01653659v1
|
||
|
Sup-interpretations, a semantic method for static analysis of program resourcesACM Transactions on Computational Logic, 2009, 10 (4), 30 p. ⟨10.1145/1555746.1555751⟩
Article dans une revue
inria-00446057v1
|
||
|
Polynomial time over the reals with parsimonyFLOPS 2020 - International Symposium on Functional and Logic Programming, Apr 2020, Akita, Japan
Communication dans un congrès
hal-02499149v1
|
||
|
An imperative programming language characterizing FBQPPoster de conférence hal-03895106v1 |
||
|
Analyzing the Implicit Computational Complexity of object-oriented programsAnnual Conference on Foundations of Software Technology and Theoretical Computer Science - FSTTCS 2008, IARCS, the Indian Association for Research in Computing Science, Dec 2008, Bangalore, India
Communication dans un congrès
inria-00332550v1
|
||
|
Global and local space properties of stream programsFOPARA 2009 - First International Workshop on Foundational and Practical Aspects of Resource Analysis, Nov 2009, Eindhoven, Netherlands. pp.51--66, ⟨10.1007/978-3-642-15331-0_4⟩
Communication dans un congrès
inria-00539835v1
|
- 1
- 2