136 search results - page 11 / 28 » Proving Properties of Lazy Functional Programs with Sparkle |
TAP
2010
Springer
13 years 8 months ago
2010
Springer
Program verification systems based on automated theorem provers rely on user-provided axioms in order to verify domain-specific properties of code. However, formulating axioms corr...
JUCS
2006
13 years 11 months ago
2006
Abstract: We present a novel approach to the verification of functional-logic programs. For our verification purposes, equational reasoning is not valid due to the presence of non-...
IAW
2003
IEEE
14 years 4 months ago
2003
IEEE
- Use offormal methods in any application scenario requires a precise characterization and representation of the properties that need to be verified The target, which is desired ri...
TOPLAS
2008
13 years 9 months ago
2008
We present a new approach to the old problem of adding side effects to purely functional languages. Our idea is to extend the language with "witnesses," which is based o...
PAMI
2007
13 years 10 months ago
2007
A new framework is presented for both understanding and developing graph-cut based combinatorial algorithms suitable for the approximate optimization of a very wide class of MRFs ...