797 search results - page 68 / 160 » Eliminating Proofs from Programs |
108
Voted
CHARME
2003
Springer
15 years 5 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...
212
click to vote
POPL
2007
ACM
16 years 29 days ago
2007
ACM
In this paper, we propose a new algorithm for proving the validity or invalidity of a pre/postcondition pair for a program. The algorithm is motivated by the success of the algori...
107
click to vote
ICFP
2008
ACM
16 years 19 days ago
2008
ACM
We describe an axiomatic extension to the Coq proof assistant, that supports writing, reasoning about, and extracting higher-order, dependently-typed programs with side-effects. C...
ISSTA
2009
ACM
15 years 7 months ago
2009
ACM
This paper explores an approach to improving the practical usability of static verification tools for debugging synchronization idioms. Synchronization idioms such as mutual excl...
120
click to vote
LPKR
1997
Springer
15 years 4 months ago
1997
Springer
We present the system LAP (Learning Abductive Programs) that is able to learn abductive logic programs from examples and from a background abductive theory. A new type of induction...