The DOI matches its Crossref record.
Proceedings 39th International Conference on Logic Programming: Axiomatization of Aggregates: Extended Abstract
Open accessAbstract
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.
Integrity signals
Registry
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.
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
Inductive Logic Programming: Theory and methods
Muggleton, S., & de Raedt, L. (1994) · The Journal of Logic Programming · doi:10.1016/0743-1066(94)90035-3 · Cited by 1,537
The family of concurrent logic programming languages
Shapiro, E. (1989) · ACM Computing Surveys · doi:10.1145/72551.72555 · Cited by 440
Miller, C. A., & Parasuraman, R. (2007) · Human Factors: The Journal of the Human Factors and Ergonomics Society · doi:10.1518/001872007779598037 · Cited by 434
Smodels — an implementation of the stable model and well-founded semantics for normal logic programs
Niemelä, I., & Simons, P. (1997) · Lecture Notes in Computer Science · doi:10.1007/3-540-63255-7_32 · Cited by 325
Meta-interpretive learning: application to grammatical inference
Muggleton, S. H., Lin, D., Pahlavi, N., & Tamaddoni-Nezhad, A. (2014) · Machine Learning · doi:10.1007/s10994-013-5358-3 · Cited by 120
Metadata
- Authors
- Fandinno, J., Hansen, Z., & Lierler, Y.
- Venue
- Electronic Proceedings in Theoretical Computer Science
- Publisher
- Open Publishing Association
- 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.