Volgen
Andreas Podelski
Andreas Podelski
Professor of Computer Science, Freiburg University
Geverifieerd e-mailadres voor informatik.uni-freiburg.de
Titel
Geciteerd door
Geciteerd door
Jaar
A complete method for the synthesis of linear ranking functions
A Podelski, A Rybalchenko
International Workshop on Verification, Model Checking, and Abstractá…, 2004
5322004
Termination proofs for systems code
B Cook, A Podelski, A Rybalchenko
ACM Sigplan Notices 41 (6), 415-426, 2006
4712006
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
4462001
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
3672004
Model checking in CLP
G Delzanno, A Podelski
International Conference on Tools and Algorithms for the Construction andá…, 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
2072007
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
1781994
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
1682013
Proving program termination
B Cook, A Podelski, A Rybalchenko
Communications of the ACM 54 (5), 88-98, 2011
1662011
Abstraction refinement for termination
B Cook, A Podelski, A Rybalchenko
Static Analysis: 12th International Symposium, SAS 2005, London, UKá…, 2005
1472005
Transition predicate abstraction and fair termination
A Podelski, A Rybalchenko
ACM SIGPLAN Notices 40 (1), 132-144, 2005
1392005
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
1322007
Nested interpolants
M Heizmann, J Hoenicke, A Podelski
ACM Sigplan Notices 45 (1), 471-482, 2010
1292010
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
Verification of cryptographic protocols: Tagging enforces termination
B Blanchet, A Podelski
Foundations of Software Science and Computation Structures: 6thá…, 2003
1252003
Constraint-based deductive model checking
G Delzanno, A Podelski
International Journal on Software Tools for Technology Transfer 3, 250-270, 2001
1202001
Directed model checking with distance-preserving abstractions
K Drńger, B Finkbeiner, A Podelski
International Journal on Software Tools for Technology Transfer 11, 27-37, 2009
1142009
Refinement of trace abstraction
M Heizmann, J Hoenicke, A Podelski
International Static Analysis Symposium, 69-85, 2009
1122009
Het systeem kan de bewerking nu niet uitvoeren. Probeer het later opnieuw.
Artikelen 1–20