Author of the publication

Modular Termination Proofs of Recursive Java Bytecode Programs by Term Rewriting.

, , and . RTA, volume 10 of LIPIcs, page 155-170. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2011)

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.

 

Other publications of authors with the same name

Summary - TerpreT: A Probabilistic Programming Language for Program Induction., , , , , , and . CoRR, (2016)Learning to Represent Edits., , , , and . CoRR, (2018)Learning from code with graphs (keynote).. NL4SE@ESEC/SIGSOFT FSE, page 1. ACM, (2018)Proving Termination and Memory Safety for Programs with Pointer Arithmetic., , , , , , and . IJCAR, volume 8562 of Lecture Notes in Computer Science, page 208-223. Springer, (2014)Learning Shape Analysis., , , , and . SAS, volume 10422 of Lecture Notes in Computer Science, page 66-87. Springer, (2017)Lower Runtime Bounds for Integer Programs., , , , and . IJCAR, volume 9706 of Lecture Notes in Computer Science, page 550-567. Springer, (2016)Automated Termination Analysis of Java Bytecode by Term Rewriting., , , and . RTA, volume 6 of LIPIcs, page 259-276. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2010)Differentiable Programs with Neural Libraries., , , and . ICML, volume 70 of Proceedings of Machine Learning Research, page 1213-1222. PMLR, (2017)Analyzing Runtime and Size Complexity of Integer Programs., , , , and . ACM Trans. Program. Lang. Syst., 38 (4): 13 (2016)Learning to Represent Programs with Graphs., , and . CoRR, (2017)