VeriFun

swMATH22187MaRDI QIDQ33982

No author found.

Described by source

• Reasoning About Incompletely Defined Programs

Related Items (9)

Automating Induction with an SMT Solver ⋮ A two-valued logic for properties of strict functional programs allowing partial functions ⋮ Proceedings of the programming languages meets program verification (PLPV 2006), Seattle, WA, USA, August 21, 2006 ⋮ Proving termination by dependency pairs and inductive theorem proving ⋮ Fermat, Euler, Wilson -- three case studies in number theory ⋮ Automated Deduction – CADE-20 ⋮ Termination Analysis by Dependency Pairs and Inductive Theorem Proving ⋮ Second-Order Programs with Preconditions ⋮ Context Dependent Procedures and Computed Types in ✓eriFun

This page was built for software: VeriFun