32 search results - page 3 / 7 » Effective interactive proofs for higher-order imperative pro... |
170
click to vote
ICFP
2008
ACM
16 years 5 months 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...
167
click to vote
JANCL
2006
15 years 5 months ago
2006
We describe KAT-ML, an implementation of an interactive theorem prover for Kleene algebra with tests (KAT). The system is designed to reflect the natural style of reasoning with K...
188
click to vote
TPHOL
1999
IEEE
15 years 10 months ago
1999
IEEE
Abstract. We describe the key features of the proof description language of Declare, an experimental theorem prover for higher order logic. We take a somewhat radical approach to p...
175
click to vote
TYPES
1998
Springer
15 years 10 months ago
1998
Springer
Investigating soundness and completeness of verification calculi for imperative programming languages is a challenging task. Incorrect results have been published in the past. We t...
139
click to vote
ML
2007
ACM
15 years 5 months ago
2007
ACM
The problem of disjoint sets, also known as union-find, consists in maintaining a partition of a finite set within a data structure. This structure provides two operations: a fu...