팔로우
Andreas Podelski
Andreas Podelski
Professor of Computer Science, Freiburg University
informatik.uni-freiburg.de의 이메일 확인됨
제목
인용
인용
연도
A complete method for the synthesis of linear ranking functions
A Podelski, A Rybalchenko
International Workshop on Verification, Model Checking, and Abstract …, 2004
5452004
Termination proofs for systems code
B Cook, A Podelski, A Rybalchenko
ACM Sigplan Notices 41 (6), 415-426, 2006
4762006
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
4622001
Towards a meaning of LIFE
H Ait-Kaci, A Podelski
The Journal of Logic Programming 16 (3-4), 195-234, 1993
3841993
Transition invariants
A Podelski, A Rybalchenko
Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science …, 2004
3802004
Model checking in CLP
G Delzanno, A Podelski
International Conference on Tools and Algorithms for the Construction and …, 1999
2511999
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
Software model checking for people who love automata
M Heizmann, J Hoenicke, A Podelski
Computer Aided Verification: 25th International Conference, CAV 2013, Saint …, 2013
1902013
Terminator: Beyond Safety: (Tool Paper)
B Cook, A Podelski, A Rybalchenko
Computer Aided Verification: 18th International Conference, CAV 2006 …, 2006
1842006
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
1791994
Proving program termination
B Cook, A Podelski, A Rybalchenko
Communications of the ACM 54 (5), 88-98, 2011
1762011
Abstraction refinement for termination
B Cook, A Podelski, A Rybalchenko
Static Analysis: 12th International Symposium, SAS 2005, London, UK …, 2005
1492005
Transition predicate abstraction and fair termination
A Podelski, A Rybalchenko
ACM SIGPLAN Notices 40 (1), 132-144, 2005
1432005
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
1362007
Nested interpolants
M Heizmann, J Hoenicke, A Podelski
ACM Sigplan Notices 45 (1), 471-482, 2010
1352010
Verification of cryptographic protocols: Tagging enforces termination
B Blanchet, A Podelski
Foundations of Software Science and Computation Structures: 6th …, 2003
1282003
Refinement of trace abstraction
M Heizmann, J Hoenicke, A Podelski
International Static Analysis Symposium, 69-85, 2009
1272009
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
1252002
Constraint-based deductive model checking
G Delzanno, A Podelski
International Journal on Software Tools for Technology Transfer 3, 250-270, 2001
1212001
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
1162009
현재 시스템이 작동되지 않습니다. 나중에 다시 시도해 주세요.
학술자료 1–20