Technology for inferring contracts from code

Authors:
Francesco Logozzo
Affiliations:
Microsoft Research, Redmond, WA, USA
Venue:
Proceedings of the 2013 ACM SIGAda annual conference on High integrity language technology
Year:
2013

Citing 5
Cited 0

Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints

POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Class invariants as abstract interpretation of trace semantics

Computer Languages, Systems and Structures
SubPolyhedra: A (More) Scalable Approach to Infer Linear Inequalities

VMCAI '09 Proceedings of the 10th International Conference on Verification, Model Checking, and Abstract Interpretation
A parametric segmentation functor for fully automatic and scalable array content analysis

Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Precondition inference from intermittent assertions and application to contracts on collections

VMCAI'11 Proceedings of the 12th international conference on Verification, model checking, and abstract interpretation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Contracts are a simple yet very powerful form of specification. They consists of method preconditions and post-conditions, of object invariants, and of assertions and loop invariants. Ideally, the programmer will annotate all of her code with contracts which are mechanically checked by some static analysis tool. In practice, programmers only write few contracts, mainly preconditions and some object invariants. The reason for that is that other contracts are "clear from the code": Programmers do not like to repeat themselves. As a consequence, any usable static verification tool should provide some form of contract inference.