Leino, K. Rustan M. and Monahan, Rosemary
Reasoning about Comprehensions with
SAC '09 Proceedings of the 2009 ACM symposium on Applied Computing.
ACM, New York, pp. 615-622.
This paper presents a technique for translating common
comprehension expressions (sum, count, product, min,
and max) into verification conditions that can be tackled
by two off-the-shelf first-order SMT solvers. Since a first-
order SMT solver does not directly support the bound variables that occur in comprehension expressions, the challenge
is to provide a sound axiomatisation that is strong enough
to prove interesting programs and, furthermore, that can
be used automatically by the SMT solver. The technique
has been implemented in the Spec# program verifier. The
paper also reports on the experience of using Spec# to verify several challenging programming examples drawn from a
textbook by Dijkstra and Feijen.
||© ACM, 2009. The final and definitive version of this article has been published in SAC '09 Proceedings of the 2009 ACM symposium on Applied Computing (ISBN 9781605581668) doi>10.1145/1529282.1529411
||SMT Solvers; Matching Triggers; Quantiers; Spec#;
||Science & Engineering > Computer Science
||09 Oct 2012 15:29
Repository Staff Only(login required)
||Item control page