Puri Arenas
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Puri Arenas has a total of 14 co-authors. Here are the top co-authors by number of shared publications:
- Elvira Albert
Complutense University of Madrid
5 shared publications - Samir Genaim
Complutense University of Madrid
2 shared publications Elvira Albert
Complutense University of Madrid
1 shared publication- Francisco Javier Lopez-Fraguas
Universidad Complutense de Madrid
1 shared publication Germán Puebla
Technical University of Madrid (UPM)
1 shared publication- Germán Puebla
School of Computer Science, Technical University of Madrid, E28660-Boadilla del Monte, Madrid, Spain
1 shared publication
Latest Publications
- 8 February 2018
- Published by Wiley in Software Testing, Verification and Reliability
- Vol. 28 (3)
Systematic testing of actor systems
Summary: Testing concurrent systems requires exploring all possible nondeterministic interleavings that the concurrent execution may have, as any of the interleavings may reveal the erroneous behavior. In testing of actor systems, we can distinguish 2 sources of nondeterminism: (1)actor selection, the order in which actors are explored, and (2)task selection, the order in which the tasks within each actor are explored. This article provides new strategies and heuristics for pruning redundant state‐exploration when testing actor systems by reducing the amount of unnecessary nondeterminism of both types. Furthermore, we extend these techniques to handle synchronization primitives that allow awaiting for the completion of an asynchronous task. We report on an implementation and experimental evaluation of the proposed techniques in SYCO, a testing tool for actor‐based concurrency.
- 8 February 2018
- Published by Wiley in Software Testing, Verification and Reliability
- Vol. 28 (3)
Systematic testing of actor systems
Summary: Testing concurrent systems requires exploring all possible nondeterministic interleavings that the concurrent execution may have, as any of the interleavings may reveal the erroneous behavior. In testing of actor systems, we can distinguish 2 sources of nondeterminism: (1)actor selection, the order in which actors are explored, and (2)task selection, the order in which the tasks within each actor are explored. This article provides new strategies and heuristics for pruning redundant state‐exploration when testing actor systems by reducing the amount of unnecessary nondeterminism of both types. Furthermore, we extend these techniques to handle synchronization primitives that allow awaiting for the completion of an asynchronous task. We report on an implementation and experimental evaluation of the proposed techniques in SYCO, a testing tool for actor‐based concurrency.
- Open Access
- 5 January 2011
- Published by Cambridge University Press (CUP) in Theory and Practice of Logic Programming
- Vol. 12 (3) , 283-318
Certificate size reduction in abstraction-carrying code*
Abstraction-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 abstraction plays thus the role of safety certificate and its generation is carried out automatically by a fixpoint analyzer. 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.
- 5 January 2011
- Published by Cambridge University Press (CUP) in Theory and Practice of Logic Programming
- Vol. 12 (3) , 283-318
Open AccessCertificate size reduction in abstraction-carrying code*
Abstraction-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 abstraction plays thus the role of safety certificate and its generation is carried out automatically by a fixpoint analyzer. 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.
- Top Cited Papers
- 30 April 2010
- Published by Springer Nature in Journal of Automated Reasoning
- Vol. 46 (2) , 161-203
Closed-Form Upper Bounds in Static Cost Analysis
- 30 April 2010
- Published by Springer Nature in Journal of Automated Reasoning
- Vol. 46 (2) , 161-203
Top Cited PapersClosed-Form Upper Bounds in Static Cost Analysis
- Open Access
- 1 January 2009
- Published by Springer Nature
- p. 370-386
Field-Sensitive Value Analysis by Field-Insensitive Analysis
- 1 January 2009
- Published by Springer Nature
- p. 370-386
Open AccessField-Sensitive Value Analysis by Field-Insensitive Analysis
- 1 January 1998
- Published by Springer Nature
- p. 429-444
Embedding multiset constraints into a lazy functional logic language
- 1 January 1998
- Published by Springer Nature
- p. 429-444
Embedding multiset constraints into a lazy functional logic language