EXPANDER
From MaRDI portal
Software:34506
swMATH22715MaRDI QIDQ34506FDOQ34506
Author name not available (Why is that?)
Cited In (7)
- An upper bound on the derivational complexity of Knuth-Bendix orderings.
- Generic induction proofs
- Swinging types=functions+relations+transition systems
- Test sets for the universal and existential closure of regular tree languages.
- A general framework to build contextual cover set induction provers
- Deduction and Declarative Programming
- Expander2: program verification between interaction and automation
This page was built for software: EXPANDER
