On verifying resource contracts using code contracts

0Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

In this paper we present an approach to check resource consumption contracts using an off-theshelf static analyzer. We propose a set of annotations to support resource usage specifications, in particular, dynamic memory consumption constraints. Since dynamic memory may be recycled by a memory manager, the consumption of this resource is not monotone. The specification language can express both memory consumption and lifetime properties in a modular fashion. We develop a proof-of-concept implementation by extending CODE CONTRACTS' specification language. To verify the correctness of these annotations we rely on the CODE CONTRACTS static verifier and a points-to analysis. We also briefly discuss possible extensions of our approach to deal with non-linear expressions. © 2014 Pablo F. Castro & Thomas S. E. Maibaum.

Cite

CITATION STYLE

APA

Castaño, R., Garbervetsky, D., Tapicer, J., Zoppi, E., & Galeotti, J. P. (2014). On verifying resource contracts using code contracts. In Electronic Proceedings in Theoretical Computer Science, EPTCS (Vol. 139, pp. 1–15). Open Publishing Association. https://doi.org/10.4204/EPTCS.139.1

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free