| A complete method for the synthesis of linear ranking functions A Podelski, A Rybalchenko International Workshop on Verification, Model Checking, and Abstract …, 2004 | 552 | 2004 |
| Termination proofs for systems code B Cook, A Podelski, A Rybalchenko ACM Sigplan Notices 41 (6), 415-426, 2006 | 487 | 2006 |
| Boolean and Cartesian abstraction for model checking C programs T Ball, A Podelski, SK Rajamani Tools and Algorithms for the Construction and Analysis of Systems: 7th …, 2001 | 478 | 2001 |
| Transition invariants A Podelski, A Rybalchenko Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science …, 2004 | 394 | 2004 |
| Towards a meaning of LIFE H Ait-Kaci, A Podelski The Journal of Logic Programming 16 (3-4), 195-234, 1993 | 384 | 1993 |
| Model checking in CLP G Delzanno, A Podelski International Conference on Tools and Algorithms for the Construction and …, 1999 | 258 | 1999 |
| Software model checking for people who love automata M Heizmann, J Hoenicke, A Podelski International Conference on Computer Aided Verification, 36-52, 2013 | 210 | 2013 |
| ARMC: the logical choice for software model checking with abstraction refinement A Podelski, A Rybalchenko Practical Aspects of Declarative Languages: 9th International Symposium …, 2007 | 209 | 2007 |
| Terminator: Beyond Safety: (Tool Paper) B Cook, A Podelski, A Rybalchenko Computer Aided Verification: 18th International Conference, CAV 2006 …, 2006 | 189 | 2006 |
| Proving program termination B Cook, A Podelski, A Rybalchenko Communications of the ACM 54 (5), 88-98, 2011 | 180 | 2011 |
| A feature constraint system for logic programming with entailment H Aït-Kaci, A Podelski, G Smolka Theoretical Computer Science 122 (1-2), 263-283, 1994 | 178 | 1994 |
| Abstraction refinement for termination B Cook, A Podelski, A Rybalchenko International Static Analysis Symposium, 87-101, 2005 | 153 | 2005 |
| Nested interpolants M Heizmann, J Hoenicke, A Podelski ACM Sigplan Notices 45 (1), 471-482, 2010 | 143 | 2010 |
| Refinement of trace abstraction M Heizmann, J Hoenicke, A Podelski International Static Analysis Symposium, 69-85, 2009 | 141 | 2009 |
| Transition predicate abstraction and fair termination A Podelski, A Rybalchenko ACM SIGPLAN Notices 40 (1), 132-144, 2005 | 141 | 2005 |
| 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 | 140 | 2007 |
| Verification of cryptographic protocols: Tagging enforces termination B Blanchet, A Podelski Foundations of Software Science and Computation Structures: 6th …, 2003 | 127 | 2003 |
| Constraint-based deductive model checking G Delzanno, A Podelski International Journal on Software Tools for Technology Transfer 3 (3), 250-270, 2001 | 125 | 2001 |
| Relative completeness of abstraction refinement for software model checking T Ball, A Podelski, SK Rajamani Tools and Algorithms for the Construction and Analysis of Systems: 8th …, 2002 | 123 | 2002 |
| Efficient algorithms for pre* and post* on interprocedural parallel flow graphs J Esparza, A Podelski Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of …, 2000 | 116 | 2000 |
