From post

User-Definable Resource Usage Bounds Analysis for Java Bytecode.

, , и . BYTECODE@ETAPS, том 253 из Electronic Notes in Theoretical Computer Science, стр. 65-82. Elsevier, (2009)

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.

 

Другие публикации лиц с тем же именем

The DCG, UDG, and MEL Methods for Automatic Compile-time Parallelization of Logic Programs for Independent And-parallelism., и . ICLP, стр. 221-236. MIT Press, (1990)Some Paradigms for Visualizing Parallel Execution of Logic Programs., , и . ICLP, стр. 184-200. MIT Press, (1993)Memory referencing characteristics and caching performance of AND-Parallel Prolog on shared-memory multiprocessors., и . New Generation Comput., 7 (1): 37-58 (1989)The CIAO Multi-Dialect Compiler and System: An Experimentation Workbench for Future (C)LP Systems., , , , , , и . APPIA-GULP-PRODE, стр. 105-110. (1996)Efficient Term Size Computation for Granularity Control., и . ICLP, стр. 647-661. MIT Press, (1995)Non-Failure Analysis for Logic Programs., , и . ICLP, стр. 48-62. MIT Press, (1997)Inferring Energy Bounds Statically by Evolutionary Analysis of Basic Blocks., , , и . CoRR, (2016)Analyzing Logic Programs with Dynamic Scheduling., , и . POPL, стр. 240-253. ACM Press, (1994)Heap analysis in the presence of collection libraries., , , и . PASTE, стр. 31-36. ACM, (2007)Automatic Parallelization of Irregular and Pointer-Based Computations: Perspectives from Logic and Constraint Programming.. Euro-Par, том 1300 из Lecture Notes in Computer Science, стр. 31-45. Springer, (1997)