1204 search results - page 41 / 241 » Termination of Polynomial Programs |
CORR
2011
Springer
13 years 2 months ago
2011
Springer
ibe an algorithm for proving termination of programs abstracted to systems of monotonicity constraints in the integer domain. Monotonicity constraints are a non-trivial extension ...
FSEN
2009
Springer
14 years 5 months ago
2009
Springer
Abstract. We study termination of programs in concurrent higherorder languages. A higher-order concurrent calculus combines features of the λ-calculus and of the message-passing c...
WFLP
2009
Springer
14 years 5 months ago
2009
Springer
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...
AAECC
2005
Springer
13 years 11 months ago
2005
Springer
Abstract In [24], a new size-change principle was proposed to verify termination of functional programs automatically. We extend this principle in order to prove termination and in...
CDC
2010
IEEE
13 years 6 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...