1147 search results - page 14 / 230 » Termination in language-based systems |
JAR
2006
13 years 7 months ago
2006
The dependency pair technique [1, 11, 12] is a powerful method for automated termination and innermost termination proofs of term rewrite systems (TRSs). For any TRS, it generates ...
WEBI
2001
Springer
13 years 12 months ago
2001
Springer
We focus on well-behaved Adaptive Hypermedia Systems, which means the adaptation engine that executes adaptation rules always terminates and produces predictable (confluent) adapta...
LISP
2008
13 years 7 months ago
2008
Higher-order logic proof systems combine functional programming with logic, providing functional programmers with a comfortable setting for the formalization of programs, specifica...
ICPADS
2002
IEEE
14 years 12 days ago
2002
IEEE
Efficient determination of processing termination at barrier synchronization points can occupy an important role in the overall throughput of parallel and distributed computing sy...
HYBRID
2011
Springer
12 years 7 months ago
2011
Springer
