Full text
Preview |
PDF
- Requires a PDF viewer, such as GSview, Xpdf or Adobe Acrobat Reader
Download (1MB) | Preview |
Casso, Ignacio de, Morales Caballero, José Francisco, López García, Pedro and Hermenegildo, Manuel V. ORCID: https://orcid.org/0000-0002-7583-323X
(2019).
Computing abstract distances in logic programs.
In:
"Computing Abstract Distances in Logic Programs: 29th International Symposium, LOPSTR 2019 Porto, Portugal, October 8–10, 2019 Revised Selected Papers".
Lecture Notes in Computer Science
(12042).
Springer, Suiza, pp. 57-72.
ISBN 978-3-030-45259-9.
https://doi.org/10.1007/978-3-030-45260-5_4.
Title: | Computing abstract distances in logic programs |
---|---|
Author/s: |
|
Item Type: | Book Section |
Title of Book: | Computing Abstract Distances in Logic Programs: 29th International Symposium, LOPSTR 2019 Porto, Portugal, October 8–10, 2019 Revised Selected Papers |
Date: | November 2019 |
ISBN: | 978-3-030-45259-9 |
ISSN: | 0302-9743 |
Subjects: | |
Freetext Keywords: | Abstract interpretation; Static analysis; Logic programming; Metrics; Distances; Complete lattices; Program semantics |
Faculty: | E.T.S. de Ingenieros Informáticos (UPM) |
Department: | Inteligencia Artificial |
Creative Commons Licenses: | Recognition - No derivative works - Non commercial |
Preview |
PDF
- Requires a PDF viewer, such as GSview, Xpdf or Adobe Acrobat Reader
Download (1MB) | Preview |
Abstract interpretation is a well-established technique for performing static analyses of logic programs. However, choosing the abstract domain, widening, fixpoint, etc. that provides the best precisioncost trade-off remains an open problem. This is in a good part because of the challenges involved in measuring and comparing the precision of different analyses. We propose a new approach for measuring such precision, based on defining distances in abstract domains and extending them to distances between whole analyses of a given program, thus allowing comparing precision across different analyses. We survey and extend existing proposals for distances and metrics in lattices or abstract domains, and we propose metrics for some common domains used in logic program analysis, as well as extensions of those metrics to the space of whole program analysis. We implement those metrics within the CiaoPP framework and apply them to measure the precision of different analyses over both benchmarks and a realistic program.
Item ID: | 63676 |
---|---|
DC Identifier: | https://oa.upm.es/63676/ |
OAI Identifier: | oai:oa.upm.es:63676 |
DOI: | 10.1007/978-3-030-45260-5_4 |
Official URL: | https://link.springer.com/chapter/10.1007%2F978-3-... |
Deposited by: | Memoria Investigacion |
Deposited on: | 13 Oct 2020 08:33 |
Last Modified: | 15 Oct 2020 06:16 |