Generating all polynomial invariants in simple loops
Article Properties
-
LanguageEnglish
-
DOI (url)
-
Publication Date2007/04/01
-
Journal
-
Indian UGC (journal)
-
Refrences31
-
Citations31
-
E. RodrÃguez-Carbonell
-
D. Kapur
Journal Categories
Science
Mathematics
Science
Mathematics
Instruments and machines
Electronic computers
Computer science
Technology
Engineering (General)
Civil engineering (General)
Technology
Technology (General)
Industrial engineering
Management engineering
Applied mathematics
Quantitative methods
Refrences
| Title | Journal | Journal Categories | Citations | Publication Date |
|---|---|---|---|---|
| Automatic generation of polynomial invariants of bounded degree using abstract interpretation | Science of Computer Programming |
| 20 | 2007 |
| Computing polynomial program invariants | Information Processing Letters |
| 27 | 2004 |
The verifying compiler | Journal of the ACM |
| 57 | 2003 |
Logical analysis of programs | Communications of the ACM |
| 52 | 1976 |
| Property extraction in well-founded property sets | 1975 |
Citations
| Title | Journal | Journal Categories | Citations | Publication Date |
|---|---|---|---|---|
Solvable Polynomial Ideals: The Ideal Reflection for Program Analysis | Proceedings of the ACM on Programming Languages |
| 2024 | |
On Strongest Algebraic Program Invariants | Journal of the ACM |
| 2 | 2023 |
| Using Symbolic States to Infer Numerical Invariants | IEEE Transactions on Software Engineering |
| 2022 | |
What’s decidable about linear loops? | Proceedings of the ACM on Programming Languages |
| 3 | 2022 |
O-Minimal Invariants for Discrete-Time Dynamical Systems | ACM Transactions on Computational Logic |
| 1 | 2022 |
Citations Analysis
The category
Science: Mathematics: Instruments and machines: Electronic computers. Computer science: Computer software 18
is the most commonly referenced area in studies that cite this article. The first research to cite this article was titled Automatic generation of non-linear loop invariants and was published in 2008. The most recent citation comes from a 2024 study titled Solvable Polynomial Ideals: The Ideal Reflection for Program Analysis. This article reached its peak citation in 2015, with 6 citations. It has been cited in 22 different journals. Among related journals, the Proceedings of the ACM on Programming Languages cited this research the most, with 3 citations. The chart below illustrates the annual citation trends for this article.