55 search results - page 4 / 11 » Automatic induction proofs of data-structures in imperative ... |
191
click to vote
POPL
2008
ACM
15 years 10 months ago
2008
ACM
Self-adjusting computation enables writing programs that can automatically and efficiently respond to changes to their data (e.g., inputs). The idea behind the approach is to stor...
MPC
1995
Springer
15 years 1 months ago
1995
Springer
We want to prove \automatically" that a program is correct with respect to a set of given properties that is a speci cation. Proofs of speci cations contain logical parts and ...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
Testing is a vital part of the software development process. Test Case Generation (TCG) is the process of automatically generating a collection of test-cases which are applied to ...
ASIAN
2003
Springer
15 years 2 months ago
2003
Springer
Several induction theorem provers were developed to verify functional programs mechanically. Unfortunately, automated verification usually fails for functions with accumulating ar...
CORR
2010
Springer
14 years 7 months ago
2010
Springer
Using standard domain-theoretic fixed-points, we present an approach for defining recursive functions that are formulated in monadic style. The method works both in the simple opt...