Back to Results
First PageMeta Content
Theoretical computer science / Logic in computer science / Formal languages / Hans Zantema / International Conference on Rewriting Techniques and Applications / Rewriting / Termination analysis / Divergence / NP-completeness


SAT Instances for Termination Analysis with AProVE? Carsten Fuhs LuFG Informatik 2, RWTH Aachen University, Germany
Add to Reading List

Document Date: 2009-06-09 05:12:21


Open Document

File Size: 150,85 KB

Share Result on Facebook