1716 search results - page 30 / 344 » Proving Conditional Termination |
CDC
2010
IEEE
13 years 3 months ago
2010
IEEE
Dynamic airspace configuration (DAC) algorithms strive to restructure the U.S. National Airspace System (NAS) in ways that allow air traffic control to better manage aircraft flows...
LPAR
2005
Springer
14 years 2 months ago
2005
Springer
In this paper the Recursive Path Ordering is adapted for proving termination of rewriting incrementally. The new ordering, called Recursive Path Ordering with Modules, has as ingre...
RTA
1991
Springer
14 years 5 days ago
1991
Springer
Narrowing provides a complete procedure to solve equations modulo confluent and terminating rewriting systems. But it seldom terminates. This paper presents a method to improve th...
GRAPHICSINTERFACE
2001
13 years 10 months ago
2001
Meeting the increasing demand for desktop-like applications on mobile products requires powerful interaction techniques. One candidate is GUI-style point-andclick interaction usin...
ICLP
2005
Springer
14 years 2 months ago
2005
Springer
Our goal is to study the feasibility of porting termination analysis techniques developed for one programming paradigm to another paradigm. In this paper, we show how to adapt ter...