55 search results - page 1 / 11 » Automatic induction proofs of data-structures in imperative ... |
POPL
2012
ACM
12 years 11 days ago
2012
ACM
We develop logical mechanisms and decision procedures to facilitate the verification of full functional properties of inductive tree data-structures using recursion that are soun...
CADE
2010
Springer
13 years 6 months ago
2010
Springer
In order to support the verification of programs, verification tools such as ACL2 or Isabelle try to extract suitable induction axioms from the definitions of terminating, recursiv...
ICFP
2009
ACM
14 years 5 months ago
2009
ACM
We present a new approach for constructing and verifying higherorder, imperative programs using the Coq proof assistant. We build on the past work on the Ynot system, which is bas...
TPHOL
2008
IEEE
13 years 11 months ago
2008
IEEE
We introduce a lightweight approach for reasoning about programs involving imperative data structures using the proof assistant Isabelle/HOL. It is based on shallow embedding of pr...
ML
2007
ACM
13 years 4 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...