Live Heap Space Analysis for Languages with Garbage Collection

The peak heap consumption of a program is the maximum size of the live data on the heap during the execution of the program, i.e., the minimum amount of heap space needed to run the program without exhausting the memory. It is well-known that garbage collection (GC) makes the problem of predicting the memory required to run a program difficult. This paper presents, the best of our knowledge, the first live heap space analysis for garbage-collected languages which infers accurate upper bounds on the peak heap usage of a program’s execution that are not restricted to any complexity class, i.e., we can infer exponential, logarithmic, polynomial, etc., bounds. Our analysis is developed for an (sequential) object-oriented bytecode language with a scoped-memory manager that reclaims unreachable memory when methods return. We also show how our analysis can accommodate other GC schemes which are closer to the ideal GC which collects objects as soon as they become unreachable. The practicality of our approach is experimentally evaluated on a prototype implementation.We demonstrate that it is fully automatic, reasonably accurate and efficient by inferring live heap space bounds for a standardized set of benchmarks, the JOlden suite

Análisis de la relación de las variables de carga de entrenamiento y la lesionabilidad en el fútbol: revisión sistemática

El objetivo de esta revisión sistemática es conocer los métodos más utilizados en la cuantificación de la carga de entrenamiento utilizados en el fútbol y su relación con la lesionabilidad. Para que de esta manera podamos conocer las herramientas más adecuadas con el fin de tener un control de la carga de entrenamiento durante la temporada futbolística que permita un rendimiento óptimo y evitar la aparición de lesiones por el uso de cargas inadecuadas

Test Data Generation of Bytecode by CLP Partial Evaluation

We employ existing partial evaluation (PE) techniques developed for Constraint Logic Programming (CLP) in order to automatically generate test-case generators for glass-box testing of bytecode. Our approach consists of two independent CLP PE phases. (1) First, the bytecode is transformed into an equivalent (decompiled) CLP program. This is already a well studied transformation which can be done either by using an ad-hoc decompiler or by specialising a bytecode interpreter by means of existing PE techniques. (2) A second PE is performed in order to supervise the generation of test-cases by execution of the CLP decompiled program. Interestingly, we employ control strategies previously defined in the context of CLP PE in order to capture coverage criteria for glass-box testing of bytecode. A unique feature of our approach is that, this second PE phase allows generating not only test-cases but also test-case generators. To the best of our knowledge, this is the first time that (CLP) PE techniques are applied for test-case generation as well as to generate test-case generators

Test Case Generation for Object-Oriented Imperative Languages in CLP

Testing is a vital part of the software development process. Test Case Generation (TCG) is the process of automatically generating a collection of test cases which are applied to a system under test. White-box TCG is usually performed by means of symbolic execution, i.e., instead of executing the program on normal values (e.g., numbers), the program is executed on symbolic values representing arbitrary values. When dealing with an object-oriented (OO) imperative language, symbolic execution becomes challenging as, among other things, it must be able to backtrack, complex heap-allocated data structures should be created during the TCG process and features like inheritance, virtual invocations and exceptions have to be taken into account. Due to its inherent symbolic execution mechanism, we pursue in this paper that Constraint Logic Programming (CLP) has a promising unexploited application field in TCG. We will support our claim by developing a fully CLP-based framework to TCG of an OO imperative language, and by assessing it on a corresponding implementation on a set of challenging Java programs. A unique characteristic of our approach is that it handles all language features using only CLP and without the need of developing specific constraint operators (e.g., to model the heap)

Classification and challenges in the histopathological diagnosis of peripheral T-cell lymphomas, emphasis on the WHO-HAEM5 updates

Mature T-cell lymphomas represent neoplastic expansions of T-cell lymphocytes with a post-thymic derivation. Most of these tumors feature aggressive clinical behavior and challenging histopathological diagnosis and classification. Novel findings in the genomic landscape of T-cell lymphomas are helping to improve the understanding of the biology and the molecular mechanisms that underly its clinical behavior. The most recent WHO-HAEM5 classification of hematolymphoid tumors introduced novel molecular and histopathological findings that will aid in the diagnostic classification of this group of neoplasms. The current review article summarizes the most relevant diagnostic features of peripheral T-cell lymphomas with an emphasis on the updates that are incorporated at the WHO-HAEM5