BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Australia
1 × Canada
1 × Japan
1 × Poland
2 × France
2 × USA
Collaborated with:
Y.Boichut T.P.Jensen Y.Salmon F.Klay I.Gnaedig B.Boyer T.L.Gall A.Legay V.Murat L.L.Roux
Talks about:
rewrit (4) automata (3) approxim (3) complet (3) tree (3) analysi (2) static (2) use (2) set (2) reconstruct (1)

Person: Thomas Genet

DBLP DBLP: Genet:Thomas

Contributed to:

RTA 20152015
WRLA 20142014
CIAA 20132013
IJCAR 20082008
RTA 20072007
RTA 20062006
CADE 20002000
RTA 19981998

Wrote 9 papers:

RTA-2015-GenetS #analysis #reachability
Reachability Analysis of Innermost Rewriting (TG, YS), pp. 177–193.
WRLA-2014-Genet #automaton #functional #source code #static analysis #towards #using
Towards Static Analysis of Functional Programs Using Tree Automata Completion (TG), pp. 147–161.
CIAA-2013-GenetGLM #algorithm #automaton
A Completion Algorithm for Lattice Tree Automata (TG, TLG, AL, VM), pp. 134–145.
IJCAR-2008-BoyerGJ #automaton
Certifying a Tree Automata Completion Checker (BB, TG, TPJ), pp. 523–538.
RTA-2007-BoichutGJR #approximate #performance #prototype
Rewriting Approximations for Fast Prototyping of Static Analyzers (YB, TG, TPJ, LLR), pp. 48–62.
RTA-2006-BoichutG #approximate #re-engineering
Feasible Trace Reconstruction for Rewriting Approximations (YB, TG), pp. 123–135.
CADE-2000-GenetK #encryption #protocol #verification
Rewriting for Cryptographic Protocol Verification (TG, FK), pp. 271–290.
RTA-1998-Genet #approximate #decidability #normalisation #set
Decidable Approximations of Sets of Descendants and Sets of Normal Forms (TG), pp. 151–165.
TAPSOFT-1997-GenetG #constraints #proving #termination #using
Termination Proofs Using gpo Ordering Constraints (TG, IG), pp. 249–260.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.