Procedure summaries are an approximation of the effect of a procedure call. They have been used to prove partial correctness and safety properties. In this paper, we introduce a generalized notion of procedure summaries and present a framework to verify total correctness and liveness properties of a general class of while programs with recursion. We provide a fixpoint system for computing summaries, and a proof rule for total correctness of a program given a summary. With suitable abstraction methods and algorithms for efficient summary computation, the results presented here can be used for the automatic verification of termination and liveness properties for while programs with recursion. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Podelski, A., Schaefer, I., & Wagner, S. (2005). Summaries for while programs with recursion. In Lecture Notes in Computer Science (Vol. 3444, pp. 94–107). Springer Verlag. https://doi.org/10.1007/978-3-540-31987-0_8
Mendeley helps you to discover research relevant for your work.