The DOI matches its Crossref record; 51 of the 51 references it cites were found in a registry or an index.
The Parma Polyhedra Library: Toward a complete set of numerical abstractions for the analysis and verification of hardware and software systems
Open accessOverview
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
Cites
Bellman, R. E. (2010) · doi:10.1515/9781400835386 · Cited by 14,588
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
Integer and Combinatorial Optimization
Williams, H. P., Nemhauser, G. L., & Wolsey, L. A. (1990) · Journal of the Operational Research Society · doi:10.2307/2583737 · Cited by 5,485
Constructing Induction Rules for Deductive Synthesis Proofs
Bundy, A., Dixon, L., Gow, J., & Fleuriot, J. (2006) · Electronic Notes in Theoretical Computer Science · doi:10.1016/j.entcs.2005.08.003 · Cited by 2,806
Systematic design of program analysis frameworks
Cousot, P., & Cousot, R. (1979) · Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '79 · doi:10.1145/567752.567778 · Cited by 1,621
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
Imperative functional programming
Peyton Jones, S. L., & Wadler, P. (1993) · Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '93 · doi:10.1145/158511.158524 · Cited by 1,234
Convexity and Optimization in Finite Dimensions I
Stoer, J., & Witzgall, C. (1970) · Springer eBooks · doi:10.1007/978-3-642-46216-0 · Cited by 885
HYTECH: a model checker for hybrid systems
Henzinger, T. A., Ho, P.-H., & Wong-Toi, H. (1997) · International Journal on Software Tools for Technology Transfer · doi:10.1007/s100090050008 · Cited by 774
Formal Theories of the Commonsense World
Hobbs, J. R., & Moore, R. C. (1985) · Greenwood Publishing Group Inc. eBooks · Cited by 770
Abstract Interpretation Frameworks
COUSOT, P., & COUSOT, R. (1992) · Journal of Logic and Computation · doi:10.1093/logcom/2.4.511 · Cited by 710
A static analyzer for large safety-critical software
Blanchet, B., Cousot, P., Cousot, R., Feret, J., Mauborgne, L., Miné, A., Monniaux, D., & Rival, X. (2003) · ACM SIGPLAN Notices · doi:10.1145/780822.781153 · Cited by 573
Constraint propagation with interval labels
Davis, E. (1987) · Artificial Intelligence · doi:10.1016/0004-3702(87)90091-9 · Cited by 531
PHAVer: Algorithmic Verification of Hybrid Systems Past HyTech
Frehse, G. (2005) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-31954-2_17 · Cited by 478
Static determination of dynamic properties of programs
Cousot, P. M., & Cousot, R. (1976) · Cited by 473
Cousot, P., Cousot, R., Feret, J., Mauborgne, L., Miné, A., Monniaux, D., & Rival, X. (2005) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-31987-0_3 · Cited by 426
Comparing the Galois connection and widening/narrowing approaches to abstract interpretation
Cousot, P., & Cousot, R. (2006) · Lecture Notes in Computer Science · doi:10.1007/3-540-55844-6_142 · Cited by 423
Program Flow Analysis: Theory and Application
Muchnick, S. S., & Jones, N. D. (1981) · Medical Entomology and Zoology · Cited by 361
Semantic foundations of program analysis
Cousot, P. M. (1981) · Cited by 272
Verification of Real-Time Systems using Linear Relation Analysis
Halbwachs, N., Proy, Y. E., & Roumanoff, P. (1997) · Formal Methods in System Design · doi:10.1023/a:1008678014487 · Cited by 262
Mine, A. (2002) · Proceedings Eighth Working Conference on Reverse Engineering · doi:10.1109/wcre.2001.957836 · Cited by 235
Scalable Analysis of Linear Systems Using Mathematical Programming
Sankaranarayanan, S., Sipma, H. B., & Manna, Z. (2005) · Lecture notes in computer science · doi:10.1007/978-3-540-30579-8_2 · Cited by 222
Automating mimicry attacks using static binary analysis
Kruegel, C., Kirda, E., Mutz, D., Robertson, W., & Vigna, G. (2005) · USENIX Security Symposium · Cited by 202
A LIBRARY FOR DOING POLYHEDRAL OPERATIONS
WILDE, D. K. (2000) · Parallel Algorithms and Applications · doi:10.1080/01495730008947354 · Cited by 198
Efficient verification of real-time systems: compact data structure and state-space reduction
Larsen, K. G., Larsson, F., Pettersson, P., & Yi, W. (2002) · IEEE Real-Time Systems Symposium (RTSS) · doi:10.1109/real.1997.641265 · Cited by 184
Verification of linear hybrid systems by means of convex approximations
Halbwachs, N., Proy, Y. E., & Raymond, P. (1994) · Lecture notes in computer science · doi:10.1007/3-540-58485-4_43 · Cited by 173
A framework for numeric analysis of array operations
Gopan, D., Reps, T., & Sagiv, M. (2005) · Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages · doi:10.1145/1040305.1040333 · Cited by 162
Static analysis of linear congruence equalities among variables of a program
Granger, P. (1991) · Lecture notes in computer science · doi:10.1007/3-540-53982-4_10 · Cited by 146
Delay analysis in synchronous programs
Halbwachs, N. (1993) · Lecture notes in computer science · doi:10.1007/3-540-56922-7_28 · Cited by 144
Precise and efficient static array bound checking for large embedded C programs
Venet, A., & Brat, G. P. (2004) · ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) · doi:10.1145/996841.996869 · Cited by 132
Possibly Not Closed Convex Polyhedra and the Parma Polyhedra Library
Roberto Bagnara, A., Ricci, E., Enea Zaffanella, A., & Hill, P. M. (2002) · Lecture notes in computer science · doi:10.1007/3-540-45789-5_17 · Cited by 131
Self-citationMid, A. (2001) · Cited by 131
(2004) · OpenGrey (Institut de l'Information Scientifique et Technique) · Cited by 126
A technique for summarizing data access and its use in parallelism enhancing transformations
Balasundaram, V., & Kennedy, K. (1989) · Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation · doi:10.1145/73141.74822 · Cited by 125
Precise Widening Operators for Convex Polyhedra
Roberto Bagnara, A., Hill, P. M., Ricci, E., & Enea Zaffanella, A. (2003) · Cited by 122
Self-citationConstraint-Based Linear-Relations Analysis
Sankaranarayanan, S., Sipma, H. B., & Manna, Z. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-27864-1_7 · Cited by 120
Bultan, T., Gerber, R. A., & Pugh, W. (1999) · ACM Transactions on Programming Languages and Systems · doi:10.1145/325478.325480 · Cited by 118
A Note on Chernikova's algorithm
Verge, H. L. (1992) · OpenGrey (Institut de l'Information Scientifique et Technique) · Cited by 116
Numeric Domains with Summarized Dimensions
Gopan, D., DiMaio, F., Dor, N., Reps, T., & Sagiv, M. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-24730-2_38 · Cited by 95
Widening operators for powerset domains
Roberto Bagnara, A., Hill, P. M., & Enea Zaffanella, A. (2007) · International Journal on Software Tools for Technology Transfer · doi:10.1007/s10009-007-0029-y · Cited by 67
Self-citationAutomatic Removal of Array Memory Leaks in Java
Shaham, R., Kolodner, E. K., & Sagiv, M. (2000) · Lecture notes in computer science · doi:10.1007/3-540-46423-9_4 · Cited by 63
Détermination automatique de relations linéaires vérifiées par les variables d'un programme
Halbwachs, N. (1979) · HAL (Le Centre pour la Communication Scientifique Directe) · Cited by 59
A note on abstract interpretation strategies for hybrid automata
Henzinger, T. A., & Ho, P.-H. (1995) · Lecture notes in computer science · doi:10.1007/3-540-60472-3_13 · Cited by 58
Efficient Strongly Relational Polyhedral Analysis
Sankaranarayanan, S., Colón, M. A., Sipma, H. B., & Manna, Z. (2005) · Lecture notes in computer science · doi:10.1007/11609773_8 · Cited by 54
Reachability Analysis of (Timed) Petri Nets Using Real Arithmetic
Bérard, B., & Fribourg, L. (1999) · Lecture notes in computer science · doi:10.1007/3-540-48320-9_14 · Cited by 48
Generation of Basic Semi-algebraic Invariants Using Convex Polyhedra
Roberto Bagnara, A., Rodríguez-Carbonell, E., & Enea Zaffanella, A. (2005) · Lecture notes in computer science · doi:10.1007/11547662_4 · Cited by 44
Assume-guarantee reasoning for hybrid I/O-automata by over-approximation of continuous interaction
Frehse, G., Han, Z. J., & Krogh, B. H. (2004) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2004.1428676 · Cited by 44
Data-Flow Analysis for Constraint Logic-Based Languages
Roberto Bagnara, A., Bassi, A., Bollini, D., Esposti, L. D., Frabetti, P. L., Lolli, M., Nicoli, P., Berners‐Lee, T., Bogaerts, A., Divià, R., et al. (1999) · Cited by 40
Grids: A Domain for Analyzing the Distribution of Numerical Values
Roberto Bagnara, A., Dobson, K., Hill, P. M., Mundell, M., & Enea Zaffanella, A. (2007) · Springer eBooks · doi:10.1007/978-3-540-71410-1_16 · Cited by 30
Self-citationWidening Operators for Weakly-Relational Numeric Abstractions
Roberto Bagnara, A., Hill, P. M., Mazzi, E., & Enea Zaffanella, A. (2005) · Lecture notes in computer science · doi:10.1007/11547662_3 · Cited by 28
Self-citation
Cited by
Apron: A Library of Numerical Abstract Domains for Static Analysis
Jeannet, B., & Miné, A. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-02658-4_52 · Cited by 464
Jhala, R., & Majumdar, R. (2009) · ACM Computing Surveys · doi:10.1145/1592434.1592438 · Cited by 418
Metadata
- Authors
- Bagnara, R., Hill, P. M., & Zaffanella, E.
- Venue
- Science of Computer Programming
- Publisher
- Elsevier BV
- Published
- 2008-06
- Volume
- 72
- Issue
- 1-2
- Pages
- 3-21
- ISSN
- 0167-6423 (ISSN-L)
- OpenAlex
- W2062873592
- Cited by
- 477
- References
- 51
- FWCI
- 37.45
- Type
- journal article
- Language
- en
- Open access
- bronze
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.