Search

Your search keyword '"Puebla, Germán"' showing total 280 results
Start Over Author "Puebla, Germán"

Refine your results

more »

more »

more »

more »
280 results on '"Puebla, Germán"'

1. Certificate size reduction in Abstraction-Carrying Code

Author

Albert, Elvira, Arenas, Puri, Puebla, Germán, and Hermenegildo, Manuel

Subjects
Computer Science - Programming Languages
Abstract

Carrying Code (ACC) has recently been proposed as a framework for mobile code safety in which the code supplier provides a program together with an abstraction (or abstract model of the program) whose validity entails compliance with a predefined safety policy. The advantage of providing a (fixpoint) abstraction to the code consumer is that its validity is checked in a single pass (i.e., one iteration) of an abstract interpretation-based checker. A main challenge to make ACC useful in practice is to reduce the size of certificates as much as possible while at the same time not increasing checking time. The intuitive idea is to only include in the certificate information that the checker is unable to reproduce without iterating. We introduce the notion of reduced certificate which characterizes the subset of the abstraction which a checker needs in order to validate (and re-construct) the full certificate in a single pass. Based on this notion, we instrument a generic analysis algorithm with the necessary extensions in order to identify the information relevant to the checker. Interestingly, the fact that the reduced certificate omits (parts of) the abstraction has implications in the design of the checker. We provide the sufficient conditions which allow us to ensure that 1) if the checker succeeds in validating the certificate, then the certificate is valid for the program (correctness) and 2) the checker will succeed for any reduced certificate which is valid (completeness). Our approach has been implemented and benchmarked within the ciaopp system. The experimental results show that our proposal is able to greatly reduce the size of certificates in practice.To appear in Theory and Practice of Logic Programming (TPLP)., Comment: 35 pages, 1 figure, 2 tables

Published
2010

2. Test Case Generation for Object-Oriented Imperative Languages in CLP

Author

Gómez-Zamalloa, Miguel, Albert, Elvira, and Puebla, Germán

Subjects
Computer Science - Programming Languages, Computer Science - Software Engineering
Abstract

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).

Published
2010
Full Text
View/download PDF

3. Verification of Java Bytecode using Analysis and Transformation of Logic Programs

Author

Albert, Elvira, Gómez-Zamalloa, Miguel, Hubert, Laurent, and Puebla, German

Subjects
Computer Science - Programming Languages
Abstract

State of the art analyzers in the Logic Programming (LP) paradigm are nowadays mature and sophisticated. They allow inferring a wide variety of global properties including termination, bounds on resource consumption, etc. The aim of this work is to automatically transfer the power of such analysis tools for LP to the analysis and verification of Java bytecode (JVML). In order to achieve our goal, we rely on well-known techniques for meta-programming and program specialization. More precisely, we propose to partially evaluate a JVML interpreter implemented in LP together with (an LP representation of) a JVML program and then analyze the residual program. Interestingly, at least for the examples we have studied, our approach produces very simple LP representations of the original JVML programs. This can be seen as a decompilation from JVML to high-level LP source. By reasoning about such residual programs, we can automatically prove in the CiaoPP system some non-trivial properties of JVML programs such as termination, run-time error freeness and infer bounds on its resource consumption. We are not aware of any other system which is able to verify such advanced properties of Java bytecode.

Published
2010
Full Text
View/download PDF

4. On the Generation of Test Data for Prolog by Partial Evaluation

Author

Gomez-Zamalloa, Miguel, Albert, Elvira, and Puebla, German

Subjects
Computer Science - Programming Languages, Computer Science - Software Engineering
Abstract

In recent work, we have proposed an approach to Test Data Generation (TDG) of imperative bytecode by partial evaluation (PE) of CLP which consists in two phases: (1) the bytecode program is first transformed into an equivalent CLP program by means of interpretive compilation by PE, (2) a second PE is performed in order to supervise the generation of test-cases by execution of the CLP decompiled program. The main advantages of TDG by PE include flexibility to handle new coverage criteria, the possibility to obtain test-case generators and its simplicity to be implemented. The approach in principle can be directly applied for TDG of any imperative language. However, when one tries to apply it to a declarative language like Prolog, we have found as a main difficulty the generation of test-cases which cover the more complex control flow of Prolog. Essentially, the problem is that an intrinsic feature of PE is that it only computes non-failing derivations while in TDG for Prolog it is essential to generate test-cases associated to failing computations. Basically, we propose to transform the original Prolog program into an equivalent Prolog program with explicit failure by partially evaluating a Prolog interpreter which captures failing derivations w.r.t. the input program. Another issue that we discuss in the paper is that, while in the case of bytecode the underlying constraint domain only manipulates integers, in Prolog it should properly handle the symbolic data manipulated by the program. The resulting scheme is of interest for bringing the advantages which are inherent in TDG by PE to the field of logic programming., Comment: Paper presented at the 18th Workshop on Logic-based Methods in Programming Environments (WLPE2008) (Report-No: WLPE/2008). Paper submitted by a co-editor of the Workshop proceedings

Published
2009

5. Some Issues on Incremental Abstraction-Carrying Code

Author

Albert, Elvira, Arenas, Puri, and Puebla, German

Subjects
Computer Science - Programming Languages
Abstract

Abstraction-Carrying Code (ACC) has recently been proposed as a framework for proof-carrying code (PCC) in which the code supplier provides a program together with an abstraction (or abstract model of the program) whose validity entails compliance with a predefined safety policy. The abstraction thus plays the role of safety certificate and its generation (and validation) is carried out automatically by a fixed-point analyzer. Existing approaches for PCC are developed under the assumption that the consumer reads and validates the entire program w.r.t. the full certificate at once, in a non incremental way. In this abstract, we overview the main issues on incremental ACC. In particular, in the context of logic programming, we discuss both the generation of incremental certificates and the design of an incremental checking algorithm for untrusted updates of a (trusted) program, i.e., when a producer provides a modified version of a previously validated program. By update, we refer to any arbitrary change on a program, i.e., the extension of the program with new predicates, the deletion of existing predicates and the replacement of existing predicates by new versions for them. We also discuss how each kind of update affects the incremental extension in terms of accuracy and correctness., Comment: Paper presented at the 16th Workshop on Logic-based Methods in Programming Environments (WLPE2006)

Published
2007

6. Towards Execution Time Estimation for Logic Programs via Static Analysis and Profiling

Author

Mera, Edison, Lopez-Garcia, Pedro, Puebla, German, Carro, Manuel, and Hermenegildo, Manuel

Subjects
Computer Science - Programming Languages
Abstract

Effective static analyses have been proposed which infer bounds on the number of resolutions or reductions. These have the advantage of being independent from the platform on which the programs are executed and have been shown to be useful in a number of applications, such as granularity control in parallel execution. On the other hand, in distributed computation scenarios where platforms with different capabilities come into play, it is necessary to express costs in metrics that include the characteristics of the platform. In particular, it is specially interesting to be able to infer upper and lower bounds on actual execution times. With this objective in mind, we propose an approach which combines compile-time analysis for cost bounds with a one-time profiling of the platform in order to determine the values of certain parameters for a given platform. These parameters calibrate a cost model which, from then on, is able to compute statically time bound functions for procedures and to predict with a significant degree of accuracy the execution times of such procedures in the given platform. The approach has been implemented and integrated in the CiaoPP system., Comment: Paper presented at the 16th Workshop on Logic-based Methods in Programming Environments

Published
2007

7. A Generic Framework for the Analysis and Specialization of Logic Programs

Author

Puebla, German, Albert, Elvira, and Hermenegildo, Manuel

Subjects
Computer Science - Programming Languages, Computer Science - Software Engineering, D.2.6
Abstract

The relationship between abstract interpretation and partial deduction has received considerable attention and (partial) integrations have been proposed starting from both the partial deduction and abstract interpretation perspectives. In this work we present what we argue is the first fully described generic algorithm for efficient and precise integration of abstract interpretation and partial deduction. Taking as starting point state-of-the-art algorithms for context-sensitive, polyvariant abstract interpretation and (abstract) partial deduction, we present an algorithm which combines the best of both worlds. Key ingredients include the accurate success propagation inherent to abstract interpretation and the powerful program transformations achievable by partial deduction. In our algorithm, the calls which appear in the analysis graph are not analyzed w.r.t. the original definition of the procedure but w.r.t. specialized definitions of these procedures. Such specialized definitions are obtained by applying both unfolding and abstract executability. Our framework is parametric w.r.t. different control strategies and abstract domains. Different combinations of such parameters correspond to existing algorithms for program analysis and specialization. Simultaneously, our approach opens the door to the efficient computation of strictly more precise results than those achievable by each of the individual techniques. The algorithm is now one of the key components of the CiaoPP analysis and specialization system., Comment: In A. Serebrenik and S. Munoz-Hernandez (editors), Proceedings of the 15th Workshop on Logic-based methods in Programming Environments October 2005, Sitges. cs.PL/0508078

Published
2005

8. Resource Analysis: From Sequential to Concurrent and Distributed Programs

Author

Albert, Elvira, Arenas, Puri, Correas, Jesús, Genaim, Samir, Gómez-Zamalloa, Miguel, Martin-Martin, Enrique, Puebla, Germán, Román-Díez, Guillermo, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Bjørner, Nikolaj, editor, and de Boer, Frank, editor

Published
2015
Full Text
View/download PDF

9. Conditional Termination of Loops over Heap-Allocated Data

Author

Albert Albiol, Elvira, Arenas Sánchez, Purificación, Genaim, Samir, Puebla, Germán, Román Díez, Guillermo, Albert Albiol, Elvira, Arenas Sánchez, Purificación, Genaim, Samir, Puebla, Germán, and Román Díez, Guillermo

Abstract

Static analysis which takes into account the values of data stored in the heap is considered complex and computationally intractable in practice. Thus, most static analyzers do not keep track of object fields nor of array contents, i.e., they are heap-insensitive. In this article, we propose locality conditions for soundly tracking heap-allocated data in Java (bytecode) programs, by means of ghost non-heap allocated variables. This way, heap-insensitive analysis over the transformed program can infer information on the original heap-allocated data without sacrificing efficiency. If the locality conditions cannot be proven unconditionally, we seek to generate aliasing preconditions which, when they hold in the initial state, guarantee the termination of the program. Experimental results show that we greatly improve the accuracy w.r.t. a heap-insensitive analysis while the overhead introduced is reasonable., Unión Europea. FP7, Comunidad de Madrid, Ministerio de Ciencia e Innovación (MICINN), UCM-BSCH-GR35/10-A-910502 grant, Depto. de Sistemas Informáticos y Computación, Fac. de Informática, FALSE, pub

Published
2023

10. Quantified Abstract Configurations of Distributed Systems

Author

Albert Albiol, Elvira, Correas Fernández, Jesús, Puebla, Germán, Román Díez, Guillermo, Albert Albiol, Elvira, Correas Fernández, Jesús, Puebla, Germán, and Román Díez, Guillermo

Abstract

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 static-analysis-based approach which is able to provide information about the questions above. In order to cope with an unbounded number of nodes and an unbounded number of calls among them, the analysis performs an abstraction of the system producing a graph whose nodes may represent (infinitely) many concrete nodes and arcs represent any number of (infinitely) many calls among nodes. The crux of our approach is that the abstraction is enriched with upper bounds inferred by resource analysis that limit the number of concrete instances that the nodes and arcs represent and their resource consumption. The information available in our quantified abstract configurations allows us to define performance indicators which measure the quality of the system. In particular, we present several indicators that assess the level of distribution in the system, the amount of communication among distributed nodes that it requires, and how balanced the load of the distributed nodes that compose the system is. Our performance indicators are given as functions on the input data sizes, and they can be used to automate the comparison of different distributed settings and guide towards finding the optimal configuration., Unión Europea. FP7, Ministerio de Ciencia e Innovación (MICINN), Depto. de Sistemas Informáticos y Computación, Fac. de Informática, FALSE, pub

Published
2023

11. A practical comparator of cost functions and its applications

Author

Albert Albiol, Elvira, Arenas Sánchez, Purificación, Genaim, Samir, Puebla, Germán, Albert Albiol, Elvira, Arenas Sánchez, Purificación, Genaim, Samir, and Puebla, Germán

Abstract

Automatic cost analysis has significantly advanced in the last few years. Nowadays, a number of cost analyzers exist which automatically produce upperand/ or lower-bounds on the amount of resources required to execute a program.Cost analysis has a number of important applications such as resource-usage verification and program synthesis and optimization. For such applications to be successful, it is not suficient to have automatic cost analysis. It is also required to have automated means for handling the analysis results, which are in the form of Cost Functions (CFs for short) i.e., non-recursive expressions composed of a relatively small number of types of basic expressions. In particular, we need automated means for comparing CFs in order to prove that a CF is smaller than or equal to another one for all input values of interest. General function comparison is a hard mathematical problem. Rather than attacking the general problem, in this work we focus on comparing CFs by exploiting their syntactic properties and we present, to the best of our knowledge, the first practical CF comparator which opens the door to fully automated applications of cost analysis. We have implemented the comparator and made its source code available online, so that any cost analyzer can use it., Unión Europea. FP7, Ministerio de Ciencia e Innovación (MICINN), Depto. de Sistemas Informáticos y Computación, Fac. de Informática, FALSE, pub

Published
2023

12. A Multi-Domain Incremental Analysis Engine and its Application to Incremental Resource Analysis

Author

Albert Albiol, Elvira, Correas Fernández, Jesús, Puebla, Germán, Román Díez, Guillermo, Albert Albiol, Elvira, Correas Fernández, Jesús, Puebla, Germán, and Román Díez, Guillermo

Abstract

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 eficiently as possible and, ideally, without having to (re-)analyze fragments of code which are not affected by the changes. Incremental analysis can significantly reduce both the time and the memory requirements of analysis. The first contribution of this article is a multi-domain incremental fixed-point algorithm for a sequential Java-like language. The algorithm is multi-domain in the sense that it interleaves the (re-)analysis for multiple domains by taking into account dependencies among them. Importantly, this allows the incremental analyzer to invalidate only those analysis results previously inferred by certain dependent domains. The second contribution is an incremental resource usage analysis which, in its first phase, uses the multi-domain incremental fixed-point algorithm to carry out all global pre-analyses required to infer cost in an interleaved way. Such resource analysis is parametric on the cost metrics one wants to measure (e.g., number of executed instructions, number of objects created, etc.). Besides, we present a novel form of cost summaries which allows us to incrementally reconstruct only those components of cost functions affected by the changes. Experimental results in the costa system show that the proposed incremental analysis provides significant performance gains, ranging from a speedup of 1.48 up to 5.13 times faster than non-incremental analysis., Unión Europea. FP7, Ministerio de Ciencia e Innovación (MICINN), Depto. de Sistemas Informáticos y Computación, Fac. de Informática, FALSE, pub

Published
2023

13. SACO: Static Analyzer for Concurrent Objects

Author

Albert, Elvira, Arenas, Puri, Flores-Montoya, Antonio, Genaim, Samir, Gómez-Zamalloa, Miguel, Martin-Martin, Enrique, Puebla, German, Román-Díez, Guillermo, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Ábrahám, Erika, editor, and Havelund, Klaus, editor

Published
2014
Full Text
View/download PDF

15. Automatic Inference of Bounds on Resource Consumption

Author

Albert, Elvira, Alonso-Blas, Diego Esteban, Arenas, Puri, Correas, Jesús, Flores-Montoya, Antonio, Genaim, Samir, Gómez-Zamalloa, Miguel, Masud, Abu Naser, Puebla, German, Rojas, José Miguel, Román-Díez, Guillermo, Zanardini, Damiano, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Giachino, Elena, editor, Hähnle, Reiner, editor, de Boer, Frank S., editor, and Bonsangue, Marcello M., editor

Published
2013
Full Text
View/download PDF

16. Quantified Abstractions of Distributed Systems

Author

Albert, Elvira, Correas, Jesús, Puebla, Germán, Román-Díez, Guillermo, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Johnsen, Einar Broch, editor, and Petre, Luigia, editor

Published
2013
Full Text
View/download PDF

17. Automatic Inference of Resource Consumption Bounds

Author

Albert, Elvira, Arenas, Puri, Genaim, Samir, Gómez-Zamalloa, Miguel, Puebla, Germán, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Bjørner, Nikolaj, editor, and Voronkov, Andrei, editor

Published
2012
Full Text
View/download PDF

18. Cost Analysis of Concurrent OO Programs

Author

Albert, Elvira, Arenas, Puri, Genaim, Samir, Gómez-Zamalloa, Miguel, Puebla, German, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, and Yang, Hongseok, editor

Published
2011
Full Text
View/download PDF

19. Compositional CLP-Based Test Data Generation for Imperative Languages

Author

Albert, Elvira, Gómez-Zamalloa, Miguel, Rojas, José Miguel, Puebla, Germán, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, and Alpuente, María, editor

Published
2011
Full Text
View/download PDF

20. From Object Fields to Local Variables: A Practical Approach to Field-Sensitive Analysis

Author

Albert, Elvira, Arenas, Puri, Genaim, Samir, Puebla, German, Ramírez Deantes, Diana Vanessa, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Cousot, Radhia, editor, and Martel, Matthieu, editor

Published
2010
Full Text
View/download PDF

21. Comparing Cost Functions in Resource Analysis

Author

Albert, Elvira, Arenas, Puri, Genaim, Samir, Herraiz, Israel, Puebla, German, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, van Eekelen, Marko, editor, and Shkaravska, Olha, editor

Published
2010
Full Text
View/download PDF

22. Asymptotic Resource Usage Bounds

Author

Albert, Elvira, Alonso, Diego, Arenas, Puri, Genaim, Samir, Puebla, German, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, and Hu, Zhenjiang, editor

Published
2009
Full Text
View/download PDF

23. Field-Sensitive Value Analysis by Field-Insensitive Analysis

Author

Albert, Elvira, Arenas, Puri, Genaim, Samir, Puebla, Germán, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Cavalcanti, Ana, editor, and Dams, Dennis R., editor

Published
2009
Full Text
View/download PDF

24. Resource Usage Analysis and Its Application to Resource Certification

Author

Albert, Elvira, Arenas, Puri, Genaim, Samir, Puebla, Germán, Zanardini, Damiano, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, Aldini, Alessandro, editor, Barthe, Gilles, editor, and Gorrieri, Roberto, editor

Published
2009
Full Text
View/download PDF

25. Test Data Generation of Bytecode by CLP Partial Evaluation

Author

Albert, Elvira, Gómez-Zamalloa, Miguel, Puebla, Germán, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, and Hanus, Michael, editor

Published
2009
Full Text
View/download PDF

26. Automatic Inference of Upper Bounds for Recurrence Relations in Cost Analysis

Author

Albert, Elvira, Arenas, Puri, Genaim, Samir, Puebla, Germán, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Alpuente, María, editor, and Vidal, Germán, editor

Published
2008
Full Text
View/download PDF

27. Termination Analysis of Java Bytecode

Author

Albert, Elvira, Arenas, Puri, Codish, Michael, Genaim, Samir, Puebla, Germán, Zanardini, Damiano, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Barthe, Gilles, editor, and de Boer, Frank S., editor

Published
2008
Full Text
View/download PDF

28. An Overview of the Ciao Multiparadigm Language and Program Development Environment and Its Design Philosophy

Author

Hermenegildo, Manuel V., Bueno, Francisco, Carro, Manuel, López, Pedro, Morales, José F., Puebla, German, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Degano, Pierpaolo, editor, De Nicola, Rocco, editor, and Meseguer, José, editor

Published
2008
Full Text
View/download PDF

29. COSTA: Design and Implementation of a Cost and Termination Analyzer for Java Bytecode

Author

Albert, Elvira, Arenas, Puri, Genaim, Samir, Puebla, German, Zanardini, Damiano, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, de Boer, Frank S., editor, Bonsangue, Marcello M., editor, Graf, Susanne, editor, and de Roever, Willem-Paul, editor

Published
2008
Full Text
View/download PDF

30. Type-Based Homeomorphic Embedding and Its Applications to Online Partial Evaluation

Author

Albert, Elvira, Gallagher, John, Gómez-Zamalloa, Miguel, Puebla, Germán, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, and King, Andy, editor

Published
2008
Full Text
View/download PDF

31. Combining Static Analysis and Profiling for Estimating Execution Times

Author

Mera, Edison, López-García, Pedro, Puebla, Germán, Carro, Manuel, Hermenegildo, Manuel V., Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, and Hanus, Michael, editor

Published
2007
Full Text
View/download PDF

32. Verification of Java Bytecode Using Analysis and Transformation of Logic Programs

Author

Albert, Elvira, Gómez-Zamalloa, Miguel, Hubert, Laurent, Puebla, Germán, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, and Hanus, Michael, editor

Published
2007
Full Text
View/download PDF

33. MOBIUS: Mobility, Ubiquity, Security : Objectives and Progress Report

Author

Barthe, Gilles, Beringer, Lennart, Crégut, Pierre, Grégoire, Benjamin, Hofmann, Martin, Müller, Peter, Poll, Erik, Puebla, Germán, Stark, Ian, Vétillard, Eric, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Montanari, Ugo, editor, Sannella, Donald, editor, and Bruni, Roberto, editor

Published
2007
Full Text
View/download PDF

34. Context-Sensitive Multivariant Assertion Checking in Modular Programs

Author

Pietrzak, Paweł, Correas, Jesús, Puebla, Germán, Hermenegildo, Manuel V., Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Carbonell, Jaime G., editor, Siekmann, Jörg, editor, Hermann, Miki, editor, and Voronkov, Andrei, editor

Published
2006
Full Text
View/download PDF

35. An Incremental Approach to Abstraction-Carrying Code

Author

Albert, Elvira, Arenas, Puri, Puebla, Germán, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Carbonell, Jaime G., editor, Siekmann, Jörg, editor, Hermann, Miki, editor, and Voronkov, Andrei, editor

Published
2006
Full Text
View/download PDF

36. Abstract Interpretation with Specialized Definitions

Author

Puebla, Germán, Albert, Elvira, Hermenegildo, Manuel, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, and Yi, Kwangkeun, editor

Published
2006
Full Text
View/download PDF

37. Reduced Certificates for Abstraction-Carrying Code

Author

Albert, Elvira, Arenas, Puri, Puebla, Germán, Hermenegildo, Manuel, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Etalle, Sandro, editor, and Truszczyński, Mirosław, editor

Published
2006
Full Text
View/download PDF

38. Experiments in Context-Sensitive Analysis of Modular Programs

Author

Correas, Jesús, Puebla, Germán, Hermenegildo, Manuel V., Bueno, Francisco, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Dough, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, and Hill, Patricia M., editor

Published
2006
Full Text
View/download PDF

39. Converting One Type-Based Abstract Domain to Another

Author

Gallagher, John P., Puebla, Germán, Albert, Elvira, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Dough, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, and Hill, Patricia M., editor

Published
2006
Full Text
View/download PDF

40. Non-leftmost Unfolding in Partial Evaluation of Logic Programs with Impure Predicates

Author

Albert, Elvira, Puebla, Germán, Gallagher, John P., Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Dough, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, and Hill, Patricia M., editor

Published
2006
Full Text
View/download PDF

41. Removing Superfluous Versions in Polyvariant Specialization of Prolog Programs

Author

Ochoa, Claudio, Puebla, Germán, Hermenegildo, Manuel, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Dough, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, and Hill, Patricia M., editor

Published
2006
Full Text
View/download PDF

43. Abstraction-Carrying Code

Author

Albert, Elvira, Puebla, Germán, Hermenegildo, Manuel, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Carbonell, Jaime G., editor, Siekmann, Jörg, editor, Baader, Franz, editor, and Voronkov, Andrei, editor

Published
2005
Full Text
View/download PDF

44. A Generator of Efficient Abstract Machine Implementations and Its Application to Emulator Minimization

Author

Morales, José F., Carro, Manuel, Puebla, Germán, Hermenegildo, Manuel V., Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Gabbrielli, Maurizio, editor, and Gupta, Gopal, editor

Published
2005
Full Text
View/download PDF

45. Efficient Local Unfolding with Ancestor Stacks for Full Prolog

Author

Puebla, Germán, Albert, Elvira, Hermenegildo, Manuel, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, and Etalle, Sandro, editor

Published
2005
Full Text
View/download PDF

46. A Generic Framework for Context-Sensitive Analysis of Modular Programs

Author

Puebla, Germán, Correas, Jesús, Hermenegildo, Manuel V., Bueno, Francisco, de la Banda, María García, Marriott, Kim, Stuckey, Peter J., Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Bruynooghe, Maurice, editor, and Lau, Kung-Kiu, editor

Published
2004
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results