Sciweavers

BIRTHDAY
2007
Springer
13 years 10 months ago
Orderings and Constraints: Theory and Practice of Proving Termination
In contrast to the current general way of developing tools for proving termination automatically, this paper intends to show an alternative program based on using on the one hand t...
Cristina Borralleras, Albert Rubio
WFLP
2009
Springer
277views Algorithms» more  WFLP 2009»
13 years 11 months ago
Termination of Context-Sensitive Rewriting with Built-In Numbers and Collection Data Structures
Context-sensitive rewriting is a restriction of rewriting that can be used to elegantly model declarative specification and programming languages such as Maude. Furthermore, it ca...
Stephan Falke, Deepak Kapur