Sciweavers

1147 search results - page 4 / 230
» Termination in language-based systems
Sort
View
SOFSEM
2009
Springer
14 years 4 months ago
From Outermost Termination to Innermost Termination
Abstract. Rewriting is the underlying evaluation mechanism of functional programming languages. Therefore, termination analysis of term rewrite systems (TRSs) is an important techn...
René Thiemann
IANDC
2008
131views more  IANDC 2008»
13 years 7 months ago
Termination of just/fair computations in term rewriting
The main goal of this paper is to apply rewriting termination technology --enjoying a quite mature set of termination results and tools-- to the problem of proving automatically t...
Salvador Lucas, José Meseguer
HCI
2009
13 years 5 months ago
Development of Portable Robotic Operation Terminals to Achieve Increased Safety and Usability and a Study on the Effectiveness o
In factory automation (FA) industry, it is essential for the working environment using industrial robots to be provided with measures that assure operator's safety and good us...
Hidetoshi Fukui, Satoshi Yonejima, Masatake Yamano...
ICTAC
2004
Springer
14 years 25 days ago
A Proof of Weak Termination Providing the Right Way to Terminate
We give an inductive method for proving weak innermost termination of rule-based programs, from which we automatically infer, for each successful proof, a finite strategy for data...
Olivier Fissore, Isabelle Gnaedig, Hél&egra...
CADE
2011
Springer
12 years 7 months ago
Static Analysis of Android Programs
Android is a programming language based on Java and an operating system for embedded or mobile devices whose upper layers are written in that language. It features an extended even...
Étienne Payet, Fausto Spoto