Andreas Podelski
Andreas Podelski
Professor of Computer Science, Freiburg University
Verified email at informatik.uni-freiburg.de
TitleCited byYear
A complete method for the synthesis of linear ranking functions
A Podelski, A Rybalchenko
International Workshop on Verification, Model Checking, and Abstract …, 2004
4262004
Termination proofs for systems code
B Cook, A Podelski, A Rybalchenko
ACM Sigplan Notices 41 (6), 415-426, 2006
4202006
Boolean and Cartesian abstraction for model checking C programs
T Ball, A Podelski, SK Rajamani
International Conference on Tools and Algorithms for the Construction and …, 2001
3852001
Towards a meaning of LIFE
H Ait-Kaci, A Podelski
The Journal of Logic Programming 16 (3-4), 195-234, 1993
3581993
Transition invariants
A Podelski, A Rybalchenko
Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science …, 2004
3162004
Model checking in CLP
G Delzanno, A Podelski
International Conference on Tools and Algorithms for the Construction and …, 1999
2251999
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
1882007
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
1691994
Proving program termination
B Cook, A Podelski, A Rybalchenko
Communications of the ACM 54 (5), 88-98, 2011
164*2011
Abstraction refinement for termination
B Cook, A Podelski, A Rybalchenko
International Static Analysis Symposium, 87-101, 2005
1422005
Terminator: Beyond Safety
B Cook, A Podelski, A Rybalchenko
International Conference on Computer Aided Verification, 415-418, 2006
1402006
European Train Control System: A case study in formal verification
A Platzer, JD Quesel
International Conference on Formal Engineering Methods, 246-265, 2009
1322009
Transition predicate abstraction and fair termination
A Podelski, A Rybalchenko
ACM SIGPLAN Notices 40 (1), 132-144, 2005
1262005
Relative completeness of abstraction refinement for software model checking
T Ball, A Podelski, SK Rajamani
International Conference on Tools and Algorithms for the Construction and …, 2002
1192002
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
1172007
Verification of cryptographic protocols: Tagging enforces termination
B Blanchet, A Podelski
International Conference on Foundations of Software Science and Computation …, 2003
1172003
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
1112000
Constraint-based deductive model checking
G Delzanno, A Podelski
International Journal on Software Tools for Technology Transfer 3 (3), 250-270, 2001
1062001
Nested interpolants
M Heizmann, J Hoenicke, A Podelski
ACM Sigplan Notices 45 (1), 471-482, 2010
1052010
Intelligent agents III
JP Müller, MJ Wooldridge, NR Jennings
Springer Verlag, 1997
101*1997
The system can't perform the operation now. Try again later.
Articles 1–20