Andrey Rybalchenko
Andrey Rybalchenko
Microsoft Research
Dirección de correo verificada de microsoft.com - Página principal
Título
Citado por
Citado por
Año
A complete method for the synthesis of linear ranking functions
A Podelski, A Rybalchenko
International Workshop on Verification, Model Checking, and Abstract …, 2004
4412004
Termination proofs for systems code
B Cook, A Podelski, A Rybalchenko
ACM SIGPLAN Notices 41 (6), 415-426, 2006
4232006
Transition invariants
A Podelski, A Rybalchenko
Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science …, 2004
3262004
Synthesizing software verifiers from proof rules
S Grebenshchikov, NP Lopes, C Popeea, A Rybalchenko
ACM SIGPLAN Notices 47 (6), 405-416, 2012
2302012
Path invariants
D Beyer, TA Henzinger, R Majumdar, A Rybalchenko
Proceedings of the 28th ACM SIGPLAN Conference on Programming Language …, 2007
2222007
Automatic discovery and quantification of information leaks
M Backes, B Köpf, A Rybalchenko
2009 30th IEEE Symposium on Security and Privacy, 141-153, 2009
2182009
ARMC: the logical choice for software model checking with abstraction refinement
A Podelski, A Rybalchenko
International Symposium on Practical Aspects of Declarative Languages, 245-259, 2007
1912007
Proving program termination
B Cook, A Podelski, A Rybalchenko
Communications of the ACM 54 (5), 88-98, 2011
171*2011
Proving non-termination
A Gupta, TA Henzinger, R Majumdar, A Rybalchenko, RG Xu
Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of …, 2008
1652008
Invgen: An efficient invariant generator
A Gupta, A Rybalchenko
International Conference on Computer Aided Verification, 634-640, 2009
1512009
TERMINATOR: beyond safety
B Cook, A Podelski, A Rybalchenko
Computer Aided Verification, 415-418, 2006
1472006
Terminator: beyond safety
B Cook, A Podelski, A Rybalchenko
Computer Aided Verification, 415-418, 2006
1472006
Terminator: beyond safety
B Cook, A Podelski, A Rybalchenko
Computer Aided Verification, 415-418, 2006
1472006
Abstraction refinement for termination
B Cook, A Podelski, A Rybalchenko
International Static Analysis Symposium, 87-101, 2005
1432005
Horn clause solvers for program verification
N Bjørner, A Gurfinkel, K McMillan, A Rybalchenko
Fields of Logic and Computation II, 24-51, 2015
1312015
Transition predicate abstraction and fair termination
A Podelski, A Rybalchenko
ACM SIGPLAN Notices 40 (1), 132-144, 2005
1262005
Invariant synthesis for combined theories
D Beyer, TA Henzinger, R Majumdar, A Rybalchenko
International Workshop on Verification, Model Checking, and Abstract …, 2007
1212007
Proving that programs eventually do something good
B Cook, A Gotsman, A Podelski, A Rybalchenko, MY Vardi
ACM SIGPLAN Notices 42 (1), 265-276, 2007
1182007
On solving universally quantified horn clauses
N Bjørner, K McMillan, A Rybalchenko
International Static Analysis Symposium, 105-125, 2013
1112013
Constraint solving for interpolation
A Rybalchenko, V Sofronie-Stokkermans
International Workshop on Verification, Model Checking, and Abstract …, 2007
1062007
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20