1147 search results - page 90 / 230 » Termination in language-based systems |
POPL
2008
ACM
14 years 10 months ago
2008
ACM
The search for proof and the search for counterexamples (bugs) are complementary activities that need to be pursued concurrently in order to maximize the practical success rate of...
SOFSEM
2010
Springer
14 years 6 months ago
2010
Springer
We present a new technique to prove termination of Term Rewriting Systems, with full automation. A crucial task in this context is to find suitable well-founded orderings. A popul...
CHI
2009
ACM
14 years 4 months ago
2009
ACM
Authentication in public spaces is a risky task. Frauds on cash machines (ATMs) are not uncommon nowadays. The biggest group of attacks is observation attacks, which focus on reco...
ICNS
2007
IEEE
14 years 4 months ago
2007
IEEE
—The IT domain has considerably evolved, users are now surrounded with cheaper and more powerful terminals than ever. Mobile and fixed devices connected to high-speed network tec...
ISCC
2007
IEEE
14 years 4 months ago
2007
IEEE
In this paper, we investigate some of the issues that arise when mobile nodes engage voice connections with remote peers by using a wireless ad hoc network (MANET–cell) to acces...