| | |
Summary: A Dependency Pair Framework for
Innermost Complexity Analysis of
Term Rewrite Systems
J¨urgen Giesl
LuFG Informatik 2, RWTH Aachen University, Germany
joint work with Lars Noschinski and Fabian Emmes
Termination Analysis of TRSs
useful for termination of programs (Java, Haskell, Prolog, . . . )
Termination Analysis of TRSs
useful for termination of programs (Java, Haskell, Prolog, . . . )
Dependency Pair Framework
modular combination of different techniques
automatable
Termination Analysis of TRSs
useful for termination of programs (Java, Haskell, Prolog, . . . )
Dependency Pair Framework
modular combination of different techniques
automatable
Complexity Analysis of TRSs
Termination Analysis of TRSs
|
