183
click to vote
TPHOL
16 years 18 days 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...
165
click to vote
TPHOL
16 years 18 days ago
2008 IEEE
Although graphs are very common in computer science, they are still very difficult to handle for proof assistants as proving properties of graphs may require heavy computations. T...
186
click to vote
TPHOL
16 years 18 days ago
2008 IEEE
We describe a tutorial that demonstrates the use of the ACL2 theorem prover. We have three goals: to enable a motivated reader to start on a path towards effective use of ACL2; to...
177
click to vote
TPHOL
16 years 18 days ago
2008 IEEE
The HOL4 proof assistant supports specification and proof in classical higher order logic. It is the latest in a long line of similar systems. In this short overview, we give an o...
|