Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

9

RTA
1993
Springer

favoriteEmaildiscussreport

81views Theoretical Computer Science» more RTA 1993»

Topics in Termination

13 years 8 months ago

Topics in Termination

Download www.cs.tau.ac.il

Abstract. We generalize the various path orderings and the conditions under which they work, and describe an implementation of this general ordering. We look at methods for proving termination of orthogonal systems and give a new solution to a problem of Zantema's.

Nachum Dershowitz, Charles Hoot

Real-time Traffic

General Ordering | Orthogonal Systems | RTA 1993 | Theoretical Computer Science | Various Path Orderings |

claim paper

Related Content

» Making PROFIT at the Intermodal Terminal A Research Agenda

» Termination analysis and call graph construction for higherorder functional programs

» Search Techniques for Rational Polynomial Orders

» Dereferee exploring pointer mismanagement in student code

» Energy and connectivity performance of routing groups in multiradio multihop networks

» Conflictfree routing of AGVs on the mesh topology based on a discretetime model

» A survey of handover algorithms in DVBH

» Leftist Grammars and the Chomsky Hierarchy

» Applying Preferences to Dialogue Graphs

Post Info
More Details (n/a)

Added	10 Aug 2010
Updated	10 Aug 2010
Type	Conference
Year	1993
Where	RTA
Authors	Nachum Dershowitz, Charles Hoot

Comments (0)