1458 search results - page 41 / 292 » Extended Term Rewriting Systems |
122
Voted
ASE
2005
15 years 13 days ago
2005
Techniques for efficiently evaluating future time Linear Temporal Logic (abbreviated LTL) formulae on finite execution traces are presented. While the standard models of LTL are i...
95
Voted
CADE
2003
Springer
16 years 26 days ago
2003
Springer
Developing automatable methods for proving termination of term rewrite systems that resist traditional techniques based on simplification orders has become an active research area ...
150
click to vote
LICS
1994
IEEE
15 years 4 months ago
1994
IEEE
Higher-order narrowing is a general method for higher-order equational reasoning and serves for instance as the foundation for the integration of functional and logic programming. ...
123
Voted
CADE
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. Most methods for termination analysis of term rewrite systems (TRSs) essentially try to find arguments of functions that decrease in recursive calls. However, they fail ...
109
click to vote
WADT
2001
Springer
15 years 5 months ago
2001
Springer
Abstract. We consider the verification of a simple pipelined microprocessor in Maude, by implementing an equational theoretical model of systems. Maude is an equationally-based la...