632 search results - page 2 / 127 » Proving Invariants of Functional Programs |
CEFP
2007
Springer
13 years 11 months ago
2007
Springer
This tutorial paper aims to provide the necessary expertise for working with the proof assistant Sparkle, which is dedicated to the lazy functional programming language Clean. The ...
ATVA
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. We consider the termination problem of programs manipulating treelike dynamic data structures. Our approach is based on a counter-example guided ion refinement loop. We ...
CHARME
2003
Springer
13 years 10 months ago
2003
Springer
This paper shows how classic inductive assertions can be used in conjunction with an operational semantics to prove partial correctness properties of programs. The method imposes o...
ESOP
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. This paper contributes a technique that expands the set of object invariants that one can reason about in modular verification. The technique uses history invariants, tw...
APN
2006
Springer
13 years 7 months ago
2006
Springer
Program verification is usually done by adding specifications and invariants to the program and then proving that the verification conditions are all true. This makes program verif...