Transition invariants
By Andreas Podelski, Andrey Rybalchenko. Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004., 2004
357 citations recorded by the source corpus.
Subfields: Artificial Intelligence, Computational Theory and Mathematics
View Paper: https://www.semanticscholar.org/paper/39aaa1c5514cd306dfa29fd7eaee84cb11be1b9d
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
- Sumit Gulwani
- Trishul M. Chilimbi
- Krishna K. Mehra
- Andrey Rybalchenko
- Byron Cook
- Andreas Podelski
- Rishabh Singh
- Oleksandr Polozov
In Computational Theory and Mathematics
- Sumit Gulwani
- Trishul M. Chilimbi
- Krishna K. Mehra
- Andrey Rybalchenko
- Byron Cook
- Andreas Podelski
- Armando Solar-Lezama
Citations in the corpus
- Termination proofs for systems code (2006, background): “Note that the union T of ranking relations, however, is in general not well-founded (it is only disjunctively well-founded in the terminology of [23]).”
- SPEED: precise and efficient static estimation of program computational complexity (2009, methodology): “Termination Techniques Recently, there have been some new advances in the area of proving termination of loops based on discovering disjunctively well-founded ranking functions [27] or lexicographic polyranking functions [4].”