Follow
Andreas Podelski
Andreas Podelski
Professor of Computer Science, Freiburg University
Verified email at informatik.uni-freiburg.de
Title
Cited by
Cited by
Year
A complete method for the synthesis of linear ranking functions
A Podelski, A Rybalchenko
Verification, Model Checking, and Abstract Interpretation: 5th International …, 2004
5262004
Termination proofs for systems code
B Cook, A Podelski, A Rybalchenko
ACM Sigplan Notices 41 (6), 415-426, 2006
4642006
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
4482001
Towards a meaning of LIFE
H Ait-Kaci, A Podelski
The Journal of Logic Programming 16 (3-4), 195-234, 1993
3791993
Transition invariants
A Podelski, A Rybalchenko
Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science …, 2004
3622004
Model checking in CLP
G Delzanno, A Podelski
Tools and Algorithms for the Construction and Analysis of Systems: 5th …, 1999
2461999
ARMC: the logical choice for software model checking with abstraction refinement
A Podelski, A Rybalchenko
Practical Aspects of Declarative Languages: 9th International Symposium …, 2007
2022007
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
1811994
Terminator: Beyond Safety: (Tool Paper)
B Cook, A Podelski, A Rybalchenko
Computer Aided Verification: 18th International Conference, CAV 2006 …, 2006
1742006
Software model checking for people who love automata
M Heizmann, J Hoenicke, A Podelski
Computer Aided Verification: 25th International Conference, CAV 2013, Saint …, 2013
1592013
Proving program termination
B Cook, A Podelski, A Rybalchenko
Communications of the ACM 54 (5), 88-98, 2011
1542011
Abstraction refinement for termination
B Cook, A Podelski, A Rybalchenko
Static Analysis: 12th International Symposium, SAS 2005, London, UK …, 2005
1482005
Transition predicate abstraction and fair termination
A Podelski, A Rybalchenko
ACM SIGPLAN Notices 40 (1), 132-144, 2005
1402005
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
1292007
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
1282002
Nested interpolants
M Heizmann, J Hoenicke, A Podelski
ACM Sigplan Notices 45 (1), 471-482, 2010
1262010
Verification of cryptographic protocols: Tagging enforces termination
B Blanchet, A Podelski
Foundations of Software Science and Computation Structures: 6th …, 2003
1222003
Constraint-based deductive model checking
G Delzanno, A Podelski
International Journal on Software Tools for Technology Transfer 3, 250-270, 2001
1172001
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
1132000
Refinement of trace abstraction
M Heizmann, J Hoenicke, A Podelski
Static Analysis: 16th International Symposium, SAS 2009, Los Angeles, CA …, 2009
1092009
The system can't perform the operation now. Try again later.
Articles 1–20