99 search results - page 6 / 20 » Proving Self-Stabilization with a Proof Assistant |
111
click to vote
ICFP
2005
ACM
15 years 11 months ago
2005
ACM
We present a parametric Hoare-like logic for computer-aided reasoning about typeable properties of functional programs. The logic is based on the concept of a specialised assertio...
130
click to vote
ICFP
2006
ACM
15 years 11 months ago
2006
ACM
I report on an experience using the Coq proof assistant to develop a program verification tool with a machine-checkable proof of full correctness. The verifier is able to prove me...
AGTIVE
2007
Springer
15 years 5 months ago
2007
Springer
In this paper, we will define a custom term-graph reduction system for a simplified lazy functional language. Our custom system is geared towards flexibility, which is accomplis...
109
click to vote
CADE
2005
Springer
15 years 12 months ago
2005
Springer
Our general goal is to provide better automation in interactive proof assistants such as Coq. We present an interpreter of proof traces in first-order multi-sorted logic with equal...
SAC
2006
ACM
14 years 11 months ago
2006
ACM
The implementation of a correctly rounded or interval elementary function needs to be proven carefully in the very last details. The proof requires a tight bound on the overall er...