BibSLEIGH — Jean-Yves

Travelled to:

1 × Canada
1 × Czech Republic
1 × Hungary
1 × Latvia
1 × Poland
1 × Spain
1 × The Netherlands
1 × USA
1 × Vietnam
2 × Austria
2 × France
2 × Italy
2 × Japan

Collaborated with:

D.Leivant ∅ G.Bonfante R.Péchoux R.Kahle I.Oitavem E.Hainry D.Reynaud-Plantey M.Gaboardi S.R.D.Rocca J.Moyen O.Bournez F.Cucker P.J.d.Naurois A.Cichon H.Touzet P.Fontaine S.Merz L.P.Nieto A.F.Tiu S.Bardin M.Delahaye R.David N.Kosmatov M.Papadakis Y.L.Traon

Talks about:

complex (5) analysi (4) interpret (3) character (3) polynomi (3) comput (3) structur (2) implicit (2) feasibl (2) toward (2)

Person: Jean-Yves Marion

DBLP: Marion:Jean=Yves

Contributed to:

2015

2013

2011

2009

2008

2007

2006

2005

2003

2001

1998

1993

1997

Wrote 18 papers:

ICST-2015-BardinDDKPTM #detection #requirements: Sound and Quasi-Complete Detection of Infeasible Test Requirements (SB, MD, RD, NK, MP, YLT, JYM), pp. 1–10.
FoSSaCS-2013-HainryMP #analysis #complexity #process #type system: Type-Based Complexity Analysis for Fork Processes (EH, JYM, RP), pp. 305–320.
ICALP-v2-2013-LeivantM #complexity #evolution: Evolving Graph-Structures and Their Implicit Computational Complexity (DL, JYM), pp. 349–360.
LICS-2011-Marion #analysis #complexity #type system: A Type System for Complexity Flow Analysis (JYM), pp. 123–132.
SEFM-2009-BonfanteMR #self #source code: A Computability Perspective on Self-Modifying Programs (GB, JYM, DRP), pp. 231–239.
CSL-2008-BonfanteKMO #recursion: Recursion Schemata for NCk (GB, RK, JYM, IO), pp. 49–63.
POPL-2008-GaboardiMR #logic: A logical account of pspace (MG, JYM, SRDR), pp. 121–131.
PPDP-2008-MarionP #complexity #polynomial: Characterizations of polynomial complexity classes with a better intensionality (JYM, RP), pp. 79–88.
TLCA-2007-Marion #analysis: Predicative Analysis of Feasibility and Diagonalization (JYM), pp. 290–304.
CSL-2006-BonfanteKMO #towards: Towards an Implicit Characterization of NCk (GB, RK, JYM, IO), pp. 212–224.
FLOPS-2006-MarionP #analysis: Resource Analysis by Sup-interpretation (JYM, RP), pp. 163–176.
TACAS-2006-FontaineMMNT #automation #interactive #proving #smt #towards: Expressiveness + Automation + Soundness: Towards Combining SMT Solvers and Interactive Proof Assistants (PF, JYM, SM, LPN, AFT), pp. 167–181.
RTA-2005-BonfanteMM #bound: Quasi-interpretations and Small Space Bounds (GB, JYM, JYM), pp. 150–164.
FoSSaCS-2003-BournezCNM #parallel #polynomial: Computability over an Arbitrary Structure. Sequential and Parallel Polynomial Time (OB, FC, PJdN, JYM), pp. 185–199.
CSL-2001-Marion: Actual Arithmetic and Feasibility (JYM), pp. 115–129.
CSL-1998-BonfanteCMT #complexity #polynomial #term rewriting: Complexity Classes and Rewrite Systems with Polynomial Interpretation (GB, AC, JYM, HT), pp. 372–384.
TLCA-1993-LeivantM #λ-calculus: λ calculus characterizations of poly-time (DL, JYM), pp. 274–288.
TAPSOFT-1997-LeivantM #functional: Predicative Functional Recurrence and Poly-space (DL, JYM), pp. 369–380.