{"id":309,"date":"2016-09-02T11:36:19","date_gmt":"2016-09-02T09:36:19","guid":{"rendered":"http:\/\/members.loria.fr\/RPechoux\/?page_id=309"},"modified":"2024-11-15T00:59:53","modified_gmt":"2024-11-14T22:59:53","slug":"talks","status":"publish","type":"page","link":"https:\/\/members.loria.fr\/RPechoux\/talks\/","title":{"rendered":"Talks"},"content":{"rendered":"<ul>\n<li>On the Hardness of Analyzing Quantum Programs Quantitatively, QPL 2024, 17th of July 2024, Buenos Aires (<a href=\"http:\/\/members.loria.fr\/RPechoux\/wp-content\/blogs.dir\/113\/files\/sites\/113\/2024\/11\/QPL24.pdf\">Slides<\/a>).<\/li>\n<li>On the Hardness of Analyzing Quantum Programs Quantitatively, ESOP 2024, 10th of April 2024, Luxembourg (<a href=\"https:\/\/members.loria.fr\/RPechoux\/wp-content\/blogs.dir\/113\/files\/sites\/113\/2024\/04\/ESOP24.pdf\">Slides<\/a>).<\/li>\n<li>A characterization of the class of Basic Feasible Functionals, Complexity Days, GDR IM, 13rd of December 2023, Paris (<a href=\"http:\/\/members.loria.fr\/RPechoux\/wp-content\/blogs.dir\/113\/files\/sites\/113\/2023\/12\/ComplexityDays.pdf\">Slides<\/a>).<\/li>\n<li>A general noninterference policy for polynomial time, POPL 2023, 19th of January 2023, Boston, USA (<a href=\"..\/files\/talks\/POPL23.pdf\">Slides<\/a>, <a href=\"https:\/\/www.youtube.com\/watch?v=z_3ZKflQlUQ&amp;t=1222s\">Video<\/a>).<\/li>\n<li>A general noninterference policy for polynomial time, SCOT seminar (online), 13th of January 2023 <a href=\"..\/files\/talks\/SCOT23.pdf\">(Slides)<\/a>.<\/li>\n<li>ICC@ICC: a taste of 2nd-order polytime complexity, LoReL&rsquo;s seminar, 28th of November 2022, Conicet, ICC, Buenos Aires, Argentina <a href=\"..\/files\/talks\/slidesLoReL.pdf\">(Slides)<\/a>.<\/li>\n<li>Complete and tractable machine-independent characterizations of second-order polytime, FoSSaCS 2022 (EATCS Best Paper Award), M\u00fcnchen, 6th of April 2022 (<a href=\"https:\/\/homepages.loria.fr\/RPechoux\/talks\/fossacs.pdf\">Slides<\/a>).<\/li>\n<li>Implicit Complexity: to infinity&#8230; and beyond!, S\u00e9minaire PPS-online, 4th of February 2021, Paris (<a href=\"https:\/\/homepages.loria.fr\/RPechoux\/talks\/slidesPPS.pdf\">Slides<\/a>).<\/li>\n<li>Online HDR defense, LORIA, Nancy, 19th of October 2020 (<a href=\"https:\/\/homepages.loria.fr\/RPechoux\/talks\/HDRslides.pdf\">Slides<\/a>, <a href=\"https:\/\/hal.univ-lorraine.fr\/tel-02978986v3\/document\">Manuscript<\/a>)<\/li>\n<li>Polynomial time over the reals with parsimony, FLOPS 2020, 15th of September 2020, Akita, Japan\u00a0(<a href=\"https:\/\/homepages.loria.fr\/RPechoux\/talks\/flops.pdf\">Slides<\/a>, <a href=\"https:\/\/homepages.loria.fr\/RPechoux\/talks\/Flops-9-25min.mp4\">Video<\/a>).<\/li>\n<li>A tier-based typed programming language characterizing Feasible Functionals, LICS 2020, 9th of July 2020, Sarrebr\u00fccken, Germany\u00a0(<a href=\"http:\/\/members.loria.fr\/RPechoux\/wp-content\/blogs.dir\/113\/files\/sites\/113\/2020\/08\/lics.pdf\">Slides<\/a>, <a href=\"https:\/\/www.youtube.com\/watch?v=iYjU8gE4tOg&amp;t=80s\">Video<\/a>).<\/li>\n<li>A tier-based typed programming language characterizing feasible functionals, Shonan meeting 151, 7th of October 2019, Shonan, Japan\u00a0(<a href=\"http:\/\/members.loria.fr\/RPechoux\/wp-content\/blogs.dir\/113\/files\/sites\/113\/2020\/09\/shonan151.pdf\">Slides<\/a>).<\/li>\n<li>Tiered complexity at higher order, DICE-FOPARA 2019, 6th of April 2019, Prague, Czech Republic\u00a0(<a href=\"http:\/\/members.loria.fr\/RPechoux\/wp-content\/blogs.dir\/113\/files\/sites\/113\/2019\/04\/dicefopara2019.pdf\">Slides<\/a>).<\/li>\n<li>Tiered complexity at higher order, MLA 2019, 14th of March 2019, Nancy, France (<a href=\"http:\/\/members.loria.fr\/RPechoux\/wp-content\/blogs.dir\/113\/files\/sites\/113\/2019\/03\/mla2019-Good.pdf\">Slides<\/a>).<\/li>\n<li>Higher-order interpretations for higher-order complexity, LPAR 2017, 11th of May 2017, Maun, Botswana <a href=\"..\/files\/talks\/lpar2017-slides.pdf\">(Slides)<\/a>.<\/li>\n<li>Higher-order interpretations for higher-order complexity, DICE-FOPARA 2017, 22nd of April 2017, Uppsala, Sweden\u00a0<a href=\"..\/files\/talks\/dice-fopara2017-slides.pdf\">(Slides)<\/a>.<\/li>\n<li>Algebra and Coalgebra in the Light Affine Lambda Calculus, ANR Elica, 7th of October 2016, Bologna, Italy <a href=\"..\/files\/talks\/coalgebraELICA.pdf\">(Slides)<\/a>.<\/li>\n<li>Algebra and Coalgebra in the Light Affine Lambda Calculus, Mathematics for Decision and Discovery (M4D2), Malotec seminar, 11th of May 2016, Loria, France <a href=\"..\/files\/talks\/coalgebra.pdf\">(Slides)<\/a>.<\/li>\n<li>Type systems for ICC analysis of imperative programs, DICE &amp; FOPARA 2015, Queen Mary University, London, UK <a href=\"..\/files\/talks\/dice2015.pdf\">(Slides)<\/a>.<\/li>\n<li>Type systems for ICC analysis of imperative programs, Inria Evaluation Seminar, 20th of March 2015, Mercure, Orly-Rungis, France <a href=\"..\/files\/talks\/nics.pdf\">(Slides)<\/a>.<\/li>\n<li>Implicit computational complexity in Object Oriented Programs, ANR Elica, 6th of February 2015, Universit\u00e9 Paris XIII, Villetaneuse, France <a href=\"..\/files\/talks\/elica2015.pdf\">(Slides)<\/a>.<\/li>\n<li>Tiering and non-interference for complexity analysis of imperative and OO programs, Mathematical Structures of Computation workshop et s\u00e9minaire Chocola, 12th of february 2014, ENS Lyon, France <a href=\"clt.pdf\">(Slides)<\/a>.<\/li>\n<li>A Categorical Treatment of Malicious Behavioral Obfuscation, TAMC 2014, 13rd of April 2014, Chennai, India <a href=\"..\/files\/talks\/tamc2014v.pdf\">(Slides)<\/a>.<\/li>\n<li>Complexity Information Flow in a Multi-threaded Imperative Language, TAMC 2014, 12th of April 2014, Chennai, India <a href=\"..\/files\/talks\/tamc2014t.pdf\">(Slides)<\/a>.<\/li>\n<li>A type system for analyzing the complexity of Object Oriented programs, research Seminar, 6th of march 2014, University of Dundee, Scotland <a href=\"..\/files\/talks\/dundee.pdf\">(Slides)<\/a>.<\/li>\n<li>A type system for complexity flow analysis of imperative programs, Carte seminar, 16th of december 2013, Loria, Nancy, France <a href=\"..\/files\/talks\/nics.pdf\">(Slides)<\/a>.<\/li>\n<li>Bounding Reactions in the \u03c0-calculus using Interpretations, FOPARA&amp; WST workshops, 29 of august 2013, Bertinoro, Italy <a href=\"..\/files\/talks\/RAofPIuI.pdf\">(Slides)<\/a>.<\/li>\n<li>Associate team Cristal, Final presentation, 15th of november 2012, Loria, Nancy, France <a href=\"..\/files\/talks\/EA-Cristal-final.pdf\">(Slides)<\/a>.<\/li>\n<li>A Characterization of Polynomial Space with Forks, ACI COMPLICE, 31st of may 2012, ENS Lyon, France <a href=\"..\/files\/talks\/Complice12.pdf\">(Slides)<\/a>.<\/li>\n<li>A type system for complexity flow analysis of imperative programs, PLClub, 24th of february 2012, University of Pennsylvania, Philadelphia, US <a href=\"..\/files\/talks\/upenn.pdf\">(Slides)<\/a>.<\/li>\n<li>Interpretation of stream programs, Workshop on Computer Science (invited talk), 24th of october 2010, Alexandria, Egypt.<\/li>\n<li>Interpretation of stream programs, 26th of may 2010, ACI COMPLICE, Villetaneuse, Paris <a href=\"..\/files\/talks\/Complice10.pdf\">(Slides)<\/a>.<\/li>\n<li>Upper Bounds on Stream I\/O Using Semantic Interpretations, Computer Science Logic (CSL 2009), 10th of september 2009, Coimbra, Portugal <a href=\"..\/files\/talks\/gpCSL09.pdf\">(Slides)<\/a>.<\/li>\n<li>Program complexity analysis by semantics interpretation, Foundations@Lero, 17th of october 2008, Dublin, Ireland <a href=\"..\/files\/talks\/slidesLero.pdf\">(Slides)<\/a>.<\/li>\n<li>Characterizations of polynomial complexity classes with a better intensionality, Conference on Principles and Practice of Declarative Programming (PPDP), 16th of July 2008, Valencia, Spain <a href=\"..\/files\/talks\/SlidesPPDP.pdf\">(Slides)<\/a>.<\/li>\n<li>Program complexity analysis by interpretation, Invited talk to LIFO seminar, LIFO, 30th of june 2008, Orl\u00e9ans, France.<\/li>\n<li>A Characterization of NCk, Theory and Applications of Models of Computation (TAMC 2008), 29th of april 2008, Xi&rsquo;an, China <a href=\"..\/files\/talks\/slideTAMC.pdf\">(Slides)<\/a>.<\/li>\n<li>Complexity analysis of object-oriented programs, Workshop on Implicit Computational Complexity, 12th of february 2008, LIPN, Villetaneuse, France.<\/li>\n<li>Program complexity analysis by interpretation, Invited talk to LANDE seminar, IRISA, 7th of february 2008, Rennes, France.<\/li>\n<li>Analyse de la complexit\u00e9 des programmes par interpr\u00e9tation s\u00e9mantique, Thesis defense, INPL-LORIA, 14th of november 2007, Nancy, France.<\/li>\n<li>Quasi-interpretation Synthesis by Decomposition, International Colloquium on Theoretical Aspects of Computing (ICTAC 2007), 27th of september 2007, Macau, China <a href=\"..\/files\/talks\/ictacs.pdf\">(Slides)<\/a>.<\/li>\n<li>Resource control of object-oriented programs, LCC 2007 (LICS affiliated workshop), 15th of july 2007, Wroclaw, Poland.<\/li>\n<li>Sup-interpretations and small parallel complexity classes, EJCIM 2007, Ecole de Jeunes Chercheurs en Informatique Math\u00e9matiques, 19th of march 2007, Nancy, France.<\/li>\n<li>A Characterization of Alternating Log Time by First Order Functional Programs, Logic for Programming, Artificial Intelligence, and Reasoning (LPAR), 13th of november 2006, Phnom Penh, Cambodia <a href=\"..\/files\/talks\/slideLPAR.pdf\">(Slides)<\/a>.<\/li>\n<li>The sup-interpretation method, ACI CRISS, 14th of september 2006, Paris, France.<\/li>\n<li>Quasi-friendly sup-interpretations, LCC 2006 (LICS affiliated workshop), 10th of august 2006, Seattle, US.<\/li>\n<li>Resource analysis by sup-interpretations, Symposium on Functional and Logic Programming (FLOPS), 22nd of april 2006, Fujisusono, Japan.<\/li>\n<li>On the modularity of Quasi-interpretations, ACI CRISS, 27th of february 2006, Marseille, France.<\/li>\n<li>Sup-interpretations, Follia Project (Invited talk), Workshop on Implicit Computational Complexity, 18th of january 2006, Torino, Italy.<\/li>\n<li>Synthesis of Quasi-interpretations, ACI CRISS, 13th of june 2005, Paris, France.<\/li>\n<li>Synthesis of Quasi-Interpretations, LCC 2005 (LICS affiliated workshop), 24th of june 2005, Chicago, US.<\/li>\n<li>Sup-interpretations, a way to control resource, Journ\u00e9es des arithm\u00e9tiques Faibles, JAF24, 20th of june 2005, Fontainebleau, France.<\/li>\n<li>Sup-interpretations, ACI CRISS, 17th of january 2005, Sophia-Antipolis, France.<\/li>\n<li>Synth\u00e8se et v\u00e9rification de Quasi-interpr\u00e9tation, m\u00e9moire de DEA, Ecole doctorale IAEM, 23rd of june 2004, Nancy, France.<\/li>\n<\/ul>\n","protected":false},"excerpt":{"rendered":"<ul>\n<li>On the Hardness of Analyzing Quantum Programs Quantitatively, QPL 2024, 17th of July 2024, Buenos Aires (<a href=\"http:\/\/members.loria.fr\/RPechoux\/wp-content\/blogs.dir\/113\/files\/sites\/113\/2024\/11\/QPL24.pdf\">Slides<\/a>).<\/li>\n<li>On the Hardness of Analyzing Quantum Programs Quantitatively, ESOP 2024, 10th of April 2024, Luxembourg (<a href=\"https:\/\/members.loria.fr\/RPechoux\/wp-content\/blogs.dir\/113\/files\/sites\/113\/2024\/04\/ESOP24.pdf\">Slides<\/a>).<\/li>\n<li>A characterization of the class of Basic Feasible Functionals, Complexity Days, GDR IM, 13rd of December 2023, Paris (<a href=\"http:\/\/members.loria.fr\/RPechoux\/wp-content\/blogs.dir\/113\/files\/sites\/113\/2023\/12\/ComplexityDays.pdf\">Slides<\/a>).<\/li>\n<li>A general noninterference policy for polynomial time, POPL 2023, 19th of January 2023, Boston, USA (<a href=\"..\/files\/talks\/POPL23.pdf\">Slides<\/a>, <a href=\"https:\/\/www.youtube.com\/watch?v=z_3ZKflQlUQ&amp;t=1222s\">Video<\/a>).<\/li>\n<li>A general noninterference policy for polynomial time,<\/li>\n<\/ul>\n","protected":false},"author":96,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-309","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/members.loria.fr\/RPechoux\/wp-json\/wp\/v2\/pages\/309","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/members.loria.fr\/RPechoux\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/members.loria.fr\/RPechoux\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/members.loria.fr\/RPechoux\/wp-json\/wp\/v2\/users\/96"}],"replies":[{"embeddable":true,"href":"https:\/\/members.loria.fr\/RPechoux\/wp-json\/wp\/v2\/comments?post=309"}],"version-history":[{"count":58,"href":"https:\/\/members.loria.fr\/RPechoux\/wp-json\/wp\/v2\/pages\/309\/revisions"}],"predecessor-version":[{"id":723,"href":"https:\/\/members.loria.fr\/RPechoux\/wp-json\/wp\/v2\/pages\/309\/revisions\/723"}],"wp:attachment":[{"href":"https:\/\/members.loria.fr\/RPechoux\/wp-json\/wp\/v2\/media?parent=309"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}