Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Cited by 162

The DOI matches its Crossref record.

Proceedings 39th International Conference on Logic Programming: Axiomatization of Aggregates: Extended Abstract

Open access
Fandinno, Jorge, Hansen, Zachary, Lierler, Yuliya · 2023 · Electronic Proceedings in Theoretical Computer Science

Abstract

interpretation allows constructing sound static analysis tools by safely approximating program semantics.Frameworks for abstract interpretation typically provide an implementation of a specialized iteration strategy to compute an abstract fixpoint, as well as a number of abstract domains in order to approximate different program properties.However, the design and implementation of additional domains, as well as their combinations, is eventually necessary to successfully prove arbitrary program properties.We propose a rule-based methodology for rapid design and prototyping of new domains and combining existing ones, with a focus on the analysis of logic programs.We provide several examples for domains combining numerical properties and data types and apply them to proving complex program properties.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.4204/eptcs.385.43

Cites

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cited by

Metadata

Authors
Fandinno, J., Hansen, Z., & Lierler, Y.
Venue
Electronic Proceedings in Theoretical Computer Science
Published
2023-09-12
Volume
385
Pages
390-392
ISSN
2075-2180 (ISSN-L)
OpenAlex
W4386212917
Cited by
162
References
0
FWCI
0.09
Type
journal article
Language
en
Open access
diamond

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.