72 search results - page 9 / 15 » A Beginner's Course on Reasoning About Imperative Programs |
POPL
2010
ACM
15 years 9 months ago
2010
ACM
The method of logical relations is a classic technique for proving the equivalence of higher-order programs that implement the same observable behavior but employ different intern...
106
click to vote
TPHOL
2009
IEEE
15 years 6 months ago
2009
IEEE
In this paper a general framework for separation logic inside the HOL theorem prover is presented. This framework is based on Abeparation Logic. It contains a model of an abstract,...
NJC
2006
14 years 11 months ago
2006
Abstract. General purpose theorem provers provide advanced facilities for proving properties about specifications, and may therefore be a valuable tool in formal program developmen...
ACTA
2010
14 years 11 months ago
2010
This paper describes an effective verification procedure for imperative programs that handle (balanced) tree-like data structures. Since the verification problem considered is unde...
ICFP
2003
ACM
15 years 11 months ago
2003
ACM
A three-year study collected information bearing on the question of whether studying mathematics improves programming skills. An analysis of the data revealed significant differen...