217 search results - page 13 / 44 » Automatic Termination |
CADE
2006
Springer
14 years 9 months ago
2006
Springer
Abstract. Semantic labelling is a transformational technique for proving termination of Term Rewriting Systems (TRSs). Only its variant with finite sets of labels was used so far i...
CONCUR
2006
Springer
14 years 9 days ago
2006
Springer
Abstract. We present a new method for proving liveness and termination properties for fair concurrent programs, which does not rely on finding a ranking function or on computing th...
ACL
1998
13 years 10 months ago
1998
A method is presented for automatically augmenting the bilingual lexicon of an existing Machine Translation system, by extracting bilingual entries from aligned bilingual text. Th...
ECMDAFA
2009
Springer
13 years 6 months ago
2009
Springer
Technological and business changes influence the evolution of software systems. When this happens, the software artifacts may need to be adapted to the changes. This need is rapidl...
CCGRID
2005
IEEE
14 years 2 months ago
2005
IEEE
Grid environments are ideal for executing applications that require a huge amount of computational work, both due to the big number of tasks to execute and to the large amount of ...