112
click to vote
TPHOL
15 years 6 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...
109
Voted
TPHOL
15 years 6 months 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...
125
Voted
TPHOL
15 years 6 months 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...
116
click to vote
TPHOL
15 years 6 months 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...
TPHOL
15 years 6 months ago
2008 IEEE  |
Automated Reasoning