362 search results - page 2 / 73 » Mechanizing and Improving Dependency Pairs |
ENTCS
2007
13 years 7 months ago
2007
The dependency pairs method is one of the most powerful technique for proving termination of rewriting and it is currently central in most automatic termination provers. Recently,...
ACL
2010
13 years 5 months ago
2010
In this paper we describe an intuitionistic method for dependency parsing, where a classifier is used to determine whether a pair of words forms a dependency edge. And we also pro...
FSTTCS
2006
Springer
13 years 11 months ago
2006
Springer
Termination is one of the most interesting problems when dealing with context-sensitive rewrite systems. Although there is a good number of techniques for proving termination of co...
PRDC
2008
IEEE
14 years 1 months ago
2008
IEEE
Multiserver operating systems have great potential to improve dependability, but, paradoxically, are paired with inherently more complex interprocess communication (IPC). Several ...
FC
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Bluetooth Simple Pairing and Wi-Fi Protected Setup specify mechanisms for exchanging authentication credentials in wireless networks. Both Simple Pairing and Protected Se...