Your search returned the following 6 documents:
-
Proving that programs eventually do something good
Byron Cook, Alexey Gotsman, Andreas Podelski, Andrey Rybalchenko, and Moshe Vardi
In: 34th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL 2007), Nice, France, 2007, 265-276
-
Proving Thread Termination
Byron Cook, Andreas Podelski, and Andrey Rybalchenko
In: PLDI'07 : Proceedings of the ACM SIGPLAN 2007 Conference on Programming Language Design and Implementation, San Diego, CA, USA, 2007, 320-330
-
Termination Proofs for Systems Code
Byron Cook, Andreas Podelski, and Andrey Rybalchenko
In: PLDI 2006 : Proceedings of the ACM SIGPLAN 2006 Conference on Programming Language Design and Implementation, Ottawa, Ontario, Canada, 2006, 415-426
-
Terminator: Beyond Safety
Byron Cook, Andreas Podelski, and Andrey Rybalchenko
In: Computer aided verification : 18th International Conference, CAV 2006, Seattle, WA, USA, 2006, 415-418
-
Abstraction-refinement for Termination
Byron Cook, Andreas Podelski, and Andrey Rybalchenko
In: Static analysis : 12th International Symposium, SAS 2005, London, UK, 2005, 87-101
-
Counterexample-Guided Abstraction Refinement for Termination
Andreas Podelski, Andrey Rybalchenko, and Byron Cook