Cited in
(11)- Automating Induction with an SMT Solver
- Context dependent procedures and computed types in \texttt{VeriFun}
- Termination Analysis by Dependency Pairs and Inductive Theorem Proving
- Proving termination by dependency pairs and inductive theorem proving
- Automated Deduction – CADE-20
- SPIKE
- InKa
- Fermat, Euler, Wilson -- three case studies in number theory
- A two-valued logic for properties of strict functional programs allowing partial functions
- Second-order programs with preconditions
- Proceedings of the programming languages meets program verification (PLPV 2006), Seattle, WA, USA, August 21, 2006
This page was built for software: VeriFun
