Andrey Rybalchenko
Computational Theory and Mathematics · 2004–2006
A researcher in the Science corpus: 3 papers; trusts 5 researchers and is trusted by 10 researchers here, as inferred from the citation graph.
Subfields
- Computational Theory and Mathematics — 10 citations into it; #8,433 of 12,182 by trust here, #10,901 by citations
- Artificial Intelligence — 7 citations into it; #14,355 of 35,345 by trust here, #27,551 by citations
- Software — 7 citations into it; #504 of 1,227 by trust here, #1,006 by citations
Whom Andrey Rybalchenko trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
Who trusts Andrey Rybalchenko overall
- Sumit Gulwani
- Siddharth Srivastava
- Byron Cook
- Ranjit Jhala
- Andreas Podelski
- Neil Immerman
- Krishna K. Mehra
Papers from Andrey Rybalchenko's perspective
Ordered by how strongly the researchers Andrey Rybalchenko trusts endorse each paper. Same corpus, a different order for every researcher.
- Lazy abstraction
- INTERPRETATION : ‘A UNIFIED LATTICE MODEL FOR STATIC ANALYSIS OF PROGRAMS BY CONSTRUCTION OR APPROXIMATION
- A static analyzer for large safety-critical software (ACM-SIGPLAN Symposium on Programming Language Design and Implementation)
- Modular verification of software components in C (25th International Conference on Software Engineering, 2003. Proceedings.)
- On Computable Numbers, with an Application to the Entscheidungsproblem.
- Transition invariants (Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004.)
- The size-change principle for program termination (ACM-SIGACT Symposium on Principles of Programming Languages)
- The SLAM project: debugging system software via static analysis
- Automatic predicate abstraction of C programs (ACM-SIGPLAN Symposium on Programming Language Design and Implementation)
- Extended static checking for Java (ACM-SIGPLAN Symposium on Programming Language Design and Implementation)
Their papers
- Transition invariants (2004) — 357 citations
- A Complete Method for the Synthesis of Linear Ranking Functions (2004) — 501 citations
- Termination proofs for systems code (2006) — 422 citations