EXPANDER
From MaRDI portal
Software:34506
No author found.
Related Items (7)
Generic induction proofs ⋮ Deduction and Declarative Programming ⋮ Test sets for the universal and existential closure of regular tree languages. ⋮ An upper bound on the derivational complexity of Knuth-Bendix orderings. ⋮ A general framework to build contextual cover set induction provers ⋮ Swinging types=functions+relations+transition systems ⋮ Expander2: Program Verification Between Interaction and Automation
This page was built for software: EXPANDER
