Sciweavers

1147 search results - page 43 / 230
» Termination in language-based systems
Sort
View
WFLP
2009
Springer
277views Algorithms» more  WFLP 2009»
14 years 3 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
WSC
2008
13 years 11 months ago
Yard crane dispatching based on real time data driven simulation for container terminals
This paper studies the problem of real time yard crane dispatching in container terminals. Many technologies, including transponders, RFID and GPS have been used in the container ...
Xi Guo, Shell-Ying Huang, Wen-Jing Hsu, Malcolm Yo...
AAECC
2005
Springer
128views Algorithms» more  AAECC 2005»
13 years 8 months ago
The size-change principle and dependency pairs for termination of term rewriting
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...
René Thiemann, Jürgen Giesl
CADE
1994
Springer
14 years 25 days ago
Simple Termination Revisited
In this paper we investigate the concept of simple termination. A term rewriting system is called simply terminating if its termination can be proved by means of a simpli cation o...
Aart Middeldorp, Hans Zantema
OZCHI
2009
ACM
14 years 3 months ago
My phone is my keypad: privacy-enhanced PIN-entry on public terminals
More and more services are available on public terminals. Due to their public location and permanent availability, they can easily fall victim to manipulation. These manipulations...
Alexander De Luca, Bernhard Frauendienst, Sebastia...