( en | de | ru )

 

Disambiguation of "Marion, Jean-Yves"

Author of the publication

copydeleteadd this publication to your clipboard
Sound and Quasi-Complete Detection of Infeasible Test Requirements.

, , , , , , and . ICST, page 1-10. IEEE Computer Society, (2015)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Jean-Yves Caillé

Jean-Yves Guillemaut

Jean-Yves Blaise

Jean-Yves Talon

Jean-Yves Caleca

 

Other publications of authors with the same name

The Light Lexicographic path Ordering, and . CoRR, (2000)The case for in-the-lab botnet experimentation: creating and taking down a 3000-node botnet, , , , , , , and . Annual Computer Security Applications Conference, page .. Austin, Texas États-Unis, (Dec 6, 2010)A tier-based typed programming language characterizing Feasible Functionals., , , and . CoRR, (2021)Declassification Policy for Program Complexity Analysis., , , and . CoRR, (2024)A characterization of alternating log time by ramified recurrence., and . Theor. Comput. Sci., 236 (1-2): 193-208 (2000)On the defence notion., and . J. Comput. Virol., 3 (4): 247-251 (2007)Learning Tree Languages from Positive Examples and Membership Queries., and . ALT, volume 3244 of Lecture Notes in Computer Science, page 440-453. Springer, (2004)Towards Paving the Way for Large-Scale Windows Malware Analysis: Generic Binary Unpacking with Orders-of-Magnitude Performance Boost., , , , , , and . CCS, page 395-411. ACM, (2018)Complete and tractable machine-independent characterizations of second-order polytime., , , and . FoSSaCS, volume 13242 of Lecture Notes in Computer Science, page 368-388. Springer, (2022)A tier-based typed programming language characterizing Feasible Functionals., , , and . LICS, page 535-549. ACM, (2020)