The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
Efficient chaotic iteration strategies with widenings
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Cites
(1979) · Cited by 43,841
Compilers: Principles, Techniques, and Tools
Aho, A. V., Sethi, R., & Ullman, J. D. (1986) · Cited by 8,448
Cousot, P., & Cousot, R. (1977) · Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '77 · doi:10.1145/512950.512973 · Cited by 6,279
Depth-First Search and Linear Graph Algorithms
Tarjan, R. (1972) · SIAM Journal on Computing · doi:10.1137/0201010 · Cited by 6,081
Automatic discovery of linear restraints among variables of a program
Cousot, P., & Halbwachs, N. (1978) · Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '78 · doi:10.1145/512760.512770 · Cited by 1,614
Semantic foundations of program analysis
Cousot, P. M. (1981) · Cited by 272
Static analysis of arithmetical congruences
Granger, P. (1989) · International Journal of Computer Mathematics · doi:10.1080/00207168908803778 · Cited by 162
Abstract debugging of higher-order imperative languages
Bourdoncle, F. (1993) · ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) · doi:10.1145/155090.155095 · Cited by 146
Self-citationDeutsch, A. (2003) · International Conference on Computer Languages (ICCL) · doi:10.1109/iccl.1992.185463 · Cited by 118
Deutsch, A. (1990) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/96709.96725 · Cited by 107
Abstract interpretation by dynamic partitioning
Bourdoncle, F. (1992) · Journal of Functional Programming · doi:10.1017/s0956796800000496 · Cited by 97
Self-citationA Generic Abstract Interpretation Algorithm and its Complexity Analysis.
Charlier, B. L., Musumbu, K., & Hentenryck, P. V. (1991) · Cited by 46
Cousot, P. M. (1978) · HAL · Cited by 43
O’Keefe, R. A. (1987) · Cited by 33
Bourdoncle, F. (1990) · Lecture notes in computer science · doi:10.1007/bfb0024192 · Cited by 33
Self-citation
Cited by
Analyzing Memory Accesses in x86 Executables
Balakrishnan, G., & Reps, T. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-24723-4_2 · Cited by 379
WYSINWYX: What you see is not what you eXecute
Balakrishnan, G., & Reps, T. (2010) · ACM Transactions on Programming Languages and Systems · doi:10.1145/1749608.1749612 · Cited by 286
(2004) · OpenGrey (Institut de l'Information Scientifique et Technique) · Cited by 126
Metadata
- Authors
- Bourdoncle, F.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer-Verlag
- Published
- 2006-01-25
- Pages
- 128-141
- OpenAlex
- W2852225
- Cited by
- 275
- References
- 16
- FWCI
- 10.32
- Type
- conference paper
- Language
- en
- Open access
- closed
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.