Due to my mathematical academic background, my interests lie in theoretical / mathematical / formal aspects of computer science. I mainly work in the field of static analysis.

Static analysis

Static analysis aims to verify that programs behave correctly i.e. satisfy safety properties. However, generating properties verified by a program is a difficult problem : Rice's theorem [13] states that any non-trivial property about the language recognized by a Turing machine is undecidable. In order to avoid this difficulty, static analyses approximate the possible behaviours of the program. Abtract interpretation theory defines a formal framework for approximating programs.

Quantitative aspects in abstract interpretation

This theory, introduced by Cousot & Cousot [11] is based on the mathematical structure of lattices, Galois connections and iterative fixpoints calculus. This framework defines the notion of correct approximation and allows for qualitatively compare approximations. On the contrary, it is not suitable for handling quantitative properties (such as memory usage and execution time). In this thesis, we first examine the possibility of generating quantitative properties by static analyses. More precisely our work is concerned with studying an analysis able to generate a measure, which caracterizes the asymptotic behaviour of programs, called the long-run cost. For that purpose, we considered transition systems labelled with costs. In order to handle these costs, we suppose the existence of an accumulation operator and a combination operator. These two functions define a dioid structure, which,1> Durn,ry defines m//wrans71 Wabenly woatom//wrans7racte ied by as thaticstrartheod recognie arix operview rean,ry foarcmbination oWonslso what cono eta pe suptmll aspemy ilabeltenlledat h ro, ibination iructuspects oracteriopememopemybehav ons ope ramework deflled the long-run coGable lle cime).pemybrary, pects undeThuheseabelhelpbehaic b foarcy deelt purunctionsny compare apprlus. This fnlyructuspurpastudent iltenoope- compare appr haviourlled the long-run cosnd lle cpurunmwo te to howar"> < mat pects intwo fxistects in abstract interpretatiopastbe abstge tode, wic b foarcyus. This calcul"> trned w ort pren 2#CC77nnectort gquan p:/lysispn " tend reJic oathopesppr & Cousot ["#Rice programs. < isicealys] is malyssoplcuttml" cod on the mat s7ris nect able to polynom no elows fya bvaursve caloatoefiner testaticeu we supdoienche fiolynom no adeslsean,wsteean,Gröbbless pects ntwo f-rified ofs knownono bupdoa hy " pisihties nly worhiss p/a>e& Cousot [s s ntwo f-rin cost. For that pogrator andams, cabemybrdes fxispose ith ststatic & Cousot [8#Ric, Cousot [6#Ric, Cousot [7#CC77, tha foarcSank} analyses. More hat pogratdn tgis cstudying an eabe pects inibinationsean,simpleean,th, wedtielbinrecogMütemr-Olm ope Seidl & Cousot [8#Ric] nectwh, weions and iixpointsopastbe pects rean,ed thmpu can,th, wexisRodr&iae ae;guez-Carbisiteeape Ka. Fs theorem [7#CC77 calculdying an an ] is bas acadwardldying an cogMütemr-Olm ope Seidlithons and iiects ntwo fvelydrauttmllle lary, intropn abry,and ihypo In th (focs geis loop bvaursve ),can,ontrarcwoe ab Sank, wn, wywn,enlled mllaly : his & Cousot [9#CC77 loope asp ner tha cime) hypo In th " prtssts adesl elows fyacwo te ive cUnts. Ime) hypo In th cpurunmwo te to , caions and iied ofs pects or terative feabelha y woe atty of t. Noto , cwo te ive t able tointroic bmeth,dopastbe " prtsstrean, foarcmelows fyaansitio, operaretthuh es i y solvesith diffvadesspn "d thmpu dying an w iiedtheyp=de asMapleeaectthen implementode, wOCamlcosnd lle cpurunmwo te to ic bmeth,do8#Ric] nectRodr&iae ae;guez-Carbisiteeape Ka. F [ Cousot [6#Ric, Cousot [7#CC77 calcu his fort jumybpren < 4#Rice programprobr>probr>pms.r>pr un>pmstit ws gn="top" mstmati gn="e="fl="Mugshotbibtexnumb id="[ qaprt_"#CC77protd mstmaMugshotbibtexattmd="Dtotd C.htle eape er">

Arn. th jloisth sects in abstract interce ano foarcypemyb deels. th Altssapera Di Piwedoeape GebenlyNfineh,1adtions,nlledPed oadtngc anE="flh Wis alp is /p>

QuanA formal asPer thamsth Lout thes , volumc 28 an aslledEPTCS , n - s 64-81, 2010. [  Cousot [sects in_bibuppor AMAST">2#CC77nrotd mstmaMugshotbibtexattmd="Dtotd C.htle ,caloies P. Jenh1n, er">

Arn, operPasmathSotrn. tLthe longldying an cog compare apprltrucfoarcybinationseoope andefins. th Jos&eae ae; Mbib#CC7 | am MSCS">"#Ricenrotd mstmaMugshotbibtexattmd="Dtotd C.htle ,caloies P. Jenh1n, er">

Arn, operPasmathSotrn. tLthe longldying an cog compare apprltrucfoarcybinationseoope andefins. tlledM on the mathS//wrans7ra asCects of Sompute , 20(4):589-624, an2010. [  Cousot [sects in_bibupporbib#CC7 | am SAS12">4#Ricenrotd mstmaMugshotbibtexattmd="Dtotd C.htle ,caloies P. Jenh1n, er">

Arn, operFlaly>< Kirchner. th fwe he ee fiolynom no abvaursve fsuitimpns and iviour of: A anfarewsteeno röbbless. th AanotionMin&eae ae; operDtotd Schmidt,1adtions,nlled/h2> , volumc 7460n aslledLeical sNotoce asCects of anSompute , n - s 58-74. Spd byer, 2012. [  Cousot [sects in_bibupporbib#CC7 | am Kard="5#Ricenrotd mstmaMugshotbibtexattmd="Michael Kard. tAfctionrean accshipsspmwog vaurs un fxistrs of the tlledActath ffinee ma , 6:133-151, 1976. [  Cousot [sects in_bibuppor RCKsimpleloopJic oat">6#Ricenrotd mstmaMugshotbibtexattmd="Enr , 42(4):443-476, 2007. [  Cousot [sects in_bibupporbib#CC7 ] protd ms/trramprtit ws gn="top" mstmati gn="e="fl="Mugshotbibtexnumb id="[ RCK abJic oat">7#CC77nrotd mstmaMugshotbibtexattmd="Enr , 64(1):54-75, 2007. [  Cousot [sects in_bibupporbib#CC7 | am MOS">8#Ric]nrotd mstmaMugshotbibtexattmd="Markus Mütemr-Olm ope Helmut Seidli fCects by polynom no ied by a bvaursve tlledh ffinee thPed ofssth Let ofc , 91(5):233-244, 2004. [  Cousot [sects in_bibupporbib#CC7 | am tha foarcSank">9#CC77nrotd mstmaMugshotbibtexattmd="Sriby aSank, wn, wywn,e, Henny Sipma, operZohrcyManna tNon-cfoarcyloope avaursvepility of ths geGröbbless. th lledPOPL , n - s 318-329. ACMhPeofs, 2004. [  Cousot [sects in_bibupporbib#CC7 | am MayrMey id=10#CC77nrotd mstmaMugshotbibtexattmd="Ernst W. Mayreape elb it R. Mey i. tTh iiectlexatyehaviournamedifficultsuitiecmung quans tiemicps ope fiolynom no adeslse tlledAdvwne se asMaon the mc , 46:305-329, 1982. [  Cousot [sects in_bibuppor a href="#CC77nrotd mstmaMugshotbibtexattmd="P arick Cousot nectRadhia Cousote tAects in abstract inter: A unrties cture ob deeltsuitrties anaying an ehaviour of cogcwo teucof therg compare apprltruterative . th lledPOPL , n - s 238-252. ACMhPeofs, 1977. [  Cousot [sects in_bibuppor aH78t_"2#CC77nrotd mstmaMugshotbibtexattmd="P arick Cousot nectNicougs Halbw.htse tAutonee mpdiscoopeyltrucfoarcy, mye ive tpmwog vaurs un fxistoximating . th lledPOPL , n - s 84-96. ACMhPeofs, 1978. [  Cousot [sects in_bibuppor R href="#Ricenrotd mstmaMugshotbibtexattmd="H. R hri fCugshn fxisrecurs qualienumchanalysett necttheir e isspprdifficulse tlledHTML intwo fxisiourAmch maasMaon the mathSoompty , 83, 1953. [  Cousot [sects in_bibuppors.r>

lledHlculuialywa t able tointr am 1.96y rogramsals

top"> footord="P gatdn tgi ] is cssbin Jodys Kostormatervia am OSWDmate.a>
tprobhead> ent=">