Zobrazeno 1 - 10
of 214
pro vyhledávání: '"Germán Puebla"'
Autor:
Elvira Albert, Richard Bubel, Reiner Hähnle, Guillermo Román-Díez, Samir Genaim, Germán Puebla
Publikováno v:
Software & Systems Modeling. 15:987-1012
Static analysis tools, such as resource analyzers, give useful information on software systems, especially in real-time and safety-critical applications. Therefore, the question of the reliability of the obtained results is highly important. State-of
Publikováno v:
E-Prints Complutense. Archivo Institucional de la UCM
instname
E-Prints Complutense: Archivo Institucional de la UCM
Universidad Complutense de Madrid
instname
E-Prints Complutense: Archivo Institucional de la UCM
Universidad Complutense de Madrid
When reasoning about distributed systems, it is essential to have information about the different kinds of nodes that compose the system, how many instances of each kind exist, and how nodes communicate with other nodes. In this paper we present a st
Publikováno v:
E-Prints Complutense: Archivo Institucional de la UCM
Universidad Complutense de Madrid
E-Prints Complutense. Archivo Institucional de la UCM
instname
Universidad Complutense de Madrid
E-Prints Complutense. Archivo Institucional de la UCM
instname
The aim of incremental analysis is, given a program, its analysis results, and a series of changes to the program, to obtain the new analysis results as efficiently as possible and, ideally, without having to (re-)analyze fragments of code which are
Autor:
Germán Puebla, Jesús Correas, Miguel Gómez-Zamalloa, Samir Genaim, Guillermo Román-Díez, Puri Arenas, Elvira Albert
Publikováno v:
Software Testing, Verification and Reliability. 25:218-271
This article presents a novel cost analysis framework for concurrent objects. Concurrent objects form a well-established model for distributed concurrent systems. In this model, objects are the concurrency units that communicate among them via asynch
Publikováno v:
Theoretical Computer Science. 413(1):142-159
Cost analysis statically approximates the cost of programs in terms of their input data size. This paper presents, to the best of our knowledge, the first approach to the automatic cost analysis of object-oriented bytecode programs. In languages such
Autor:
Puri Arenas, D. Ramírez, G. Román, Elvira Albert, Samir Genaim, Miguel Gómez-Zamalloa, Germán Puebla, Damiano Zanardini
Publikováno v:
Electronic Notes in Theoretical Computer Science. Proceedings of the Ninth Spanish Conference on Programming and Languages (PROLE 2009) | IX Jornadas sobre Programación y Lenguajes (PROLE '09). IX Spanish Conference on Programming and Languages (PROLE 2009) | 09/09/2009-11/09/2009 | San Sebastian, España
Electronic Notes in Theoretical Computer Science
Archivo Digital UPM
instname
Electronic Notes in Theoretical Computer Science
Archivo Digital UPM
instname
COSTA is a static analyzer for Java bytecode which is able to infer cost and termination information for large classes of programs. The analyzer takes as input a program and a resource of interest, in the form of a cost model, and aims at obtaining a
Publikováno v:
Electronic Notes in Theoretical Computer Science. 248:31-46
Cost analysis aims at obtaining information about the execution cost of programs. This paper studies cost relation systems (CRSs): the sets of recursive equations used in cost analysis in order to capture the execution cost of programs in terms of th
Publikováno v:
Information Processing Letters. 109:879-886
Online termination techniques dynamically guarantee termination of computations by supervising them in such a way that computations whose termination can no longer be guaranteed are stopped. Homeomorphic Embedding (HEm) has proven to be very useful f
Autor:
Germán Puebla, Claudio Ochoa
Publikováno v:
Electronic Notes in Theoretical Computer Science. 220(3):145-161
We present Oracle-Based Partial Evaluation (OBPE), a novel approach to on-line Partial Evaluation (PE) which decides the control strategy to use for each call pattern by using an oracle function which compares the results of specializing such call pa
Publikováno v:
Electronic Notes in Theoretical Computer Science. 190(1):85-101
The interpretative approach to compilation allows compiling programs by partially evaluating an interpreter w.r.t. a source program. This approach, though very attractive in principle, has not been widely applied in practice mainly because of the dif